./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7 --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.2-hotfix-svcomp22-839c364 [2021-11-25 19:19:33,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:19:33,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:19:33,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:19:33,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:19:33,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:19:33,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:19:33,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:19:33,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:19:33,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:19:34,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:19:34,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:19:34,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:19:34,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:19:34,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:19:34,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:19:34,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:19:34,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:19:34,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:19:34,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:19:34,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:19:34,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:19:34,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:19:34,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:19:34,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:19:34,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:19:34,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:19:34,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:19:34,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:19:34,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:19:34,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:19:34,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:19:34,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:19:34,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:19:34,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:19:34,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:19:34,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:19:34,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:19:34,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:19:34,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:19:34,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:19:34,048 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 19:19:34,097 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:19:34,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:19:34,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:19:34,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:19:34,100 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:19:34,100 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:19:34,101 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:19:34,101 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:19:34,101 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:19:34,102 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:19:34,102 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:19:34,103 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:19:34,110 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:19:34,110 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:19:34,111 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:19:34,111 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:19:34,111 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:19:34,111 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:19:34,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:19:34,113 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:19:34,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:19:34,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:19:34,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:19:34,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 19:19:34,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:19:34,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 19:19:34,115 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:19:34,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 19:19:34,116 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:19:34,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 19:19:34,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:19:34,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:19:34,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:19:34,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:19:34,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:19:34,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 19:19:34,120 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:19:34,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:19:34,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 19:19:34,120 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:19:34,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:19:34,121 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_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/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_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7 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-25 19:19:34,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:19:34,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:19:34,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:19:34,501 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:19:34,502 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:19:34,503 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2021-11-25 19:19:34,596 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/data/25dd3f2be/191372703a9746f9a5a7fbd77a8bb7c6/FLAG3caf46c42 [2021-11-25 19:19:35,212 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:19:35,213 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2021-11-25 19:19:35,248 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/data/25dd3f2be/191372703a9746f9a5a7fbd77a8bb7c6/FLAG3caf46c42 [2021-11-25 19:19:35,462 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/data/25dd3f2be/191372703a9746f9a5a7fbd77a8bb7c6 [2021-11-25 19:19:35,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:19:35,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:19:35,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:19:35,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:19:35,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:19:35,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:19:35" (1/1) ... [2021-11-25 19:19:35,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@763a48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:35, skipping insertion in model container [2021-11-25 19:19:35,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:19:35" (1/1) ... [2021-11-25 19:19:35,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:19:35,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:19:35,780 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 19:19:36,243 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39095,39108] [2021-11-25 19:19:36,250 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39180,39193] [2021-11-25 19:19:36,251 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39232,39245] [2021-11-25 19:19:36,375 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49285,49298] [2021-11-25 19:19:36,376 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49334,49347] [2021-11-25 19:19:36,378 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49462,49475] [2021-11-25 19:19:36,379 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49520,49533] [2021-11-25 19:19:36,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:19:36,395 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:19:36,409 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 19:19:36,435 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39095,39108] [2021-11-25 19:19:36,436 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39180,39193] [2021-11-25 19:19:36,437 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39232,39245] [2021-11-25 19:19:36,448 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49285,49298] [2021-11-25 19:19:36,449 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49334,49347] [2021-11-25 19:19:36,454 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49462,49475] [2021-11-25 19:19:36,455 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_1857c9ad-45e7-4004-9239-b436b3d583b9/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49520,49533] [2021-11-25 19:19:36,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:19:36,560 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:19:36,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36 WrapperNode [2021-11-25 19:19:36,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:19:36,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:19:36,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:19:36,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:19:36,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36" (1/1) ... [2021-11-25 19:19:36,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36" (1/1) ... [2021-11-25 19:19:36,681 INFO L137 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 190 [2021-11-25 19:19:36,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:19:36,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:19:36,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:19:36,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:19:36,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36" (1/1) ... [2021-11-25 19:19:36,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36" (1/1) ... [2021-11-25 19:19:36,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36" (1/1) ... [2021-11-25 19:19:36,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36" (1/1) ... [2021-11-25 19:19:36,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36" (1/1) ... [2021-11-25 19:19:36,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36" (1/1) ... [2021-11-25 19:19:36,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36" (1/1) ... [2021-11-25 19:19:36,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:19:36,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:19:36,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:19:36,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:19:36,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36" (1/1) ... [2021-11-25 19:19:36,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:19:36,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:19:36,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:19:36,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1857c9ad-45e7-4004-9239-b436b3d583b9/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:19:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2021-11-25 19:19:36,879 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2021-11-25 19:19:36,880 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2021-11-25 19:19:36,880 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2021-11-25 19:19:36,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 19:19:36,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 19:19:36,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 19:19:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 19:19:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:19:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 19:19:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:19:36,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:19:36,883 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 19:19:37,020 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:19:37,023 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:19:37,511 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:19:37,524 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:19:37,525 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-25 19:19:37,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:19:37 BoogieIcfgContainer [2021-11-25 19:19:37,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:19:37,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:19:37,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:19:37,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:19:37,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:19:35" (1/3) ... [2021-11-25 19:19:37,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1335122d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:19:37, skipping insertion in model container [2021-11-25 19:19:37,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:36" (2/3) ... [2021-11-25 19:19:37,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1335122d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:19:37, skipping insertion in model container [2021-11-25 19:19:37,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:19:37" (3/3) ... [2021-11-25 19:19:37,541 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2021-11-25 19:19:37,548 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 19:19:37,548 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:19:37,549 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-25 19:19:37,549 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 19:19:37,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,663 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,664 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,667 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,667 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,668 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,668 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,669 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,670 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-25 19:19:37,670 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-25 19:19:37,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,678 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,678 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-25 19:19:37,678 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-25 19:19:37,678 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,679 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,680 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,681 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,681 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,681 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,681 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,681 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-25 19:19:37,682 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-25 19:19:37,682 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,682 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,682 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-25 19:19:37,683 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-25 19:19:37,683 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,683 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,683 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,683 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,684 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,684 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,684 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,684 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,685 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,685 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,685 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,685 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,685 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,686 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,686 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,686 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,686 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,687 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,687 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,687 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,687 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,688 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,688 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,688 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,688 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,688 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,689 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,689 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,689 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,689 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,690 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,690 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,690 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,690 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,691 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,691 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,692 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,692 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,692 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-25 19:19:37,693 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-25 19:19:37,693 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,693 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,693 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-25 19:19:37,694 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-25 19:19:37,694 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,694 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,694 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,695 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,695 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,695 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,695 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,695 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,696 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,697 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,697 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-25 19:19:37,697 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-25 19:19:37,697 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,697 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,698 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-25 19:19:37,698 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-25 19:19:37,698 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,698 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,699 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,699 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,699 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,700 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,700 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,700 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,700 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,700 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,701 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,701 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,702 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,702 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,702 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,702 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,703 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,703 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,703 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,703 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,703 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,704 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,704 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,704 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,704 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,705 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,707 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,711 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,711 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,712 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,712 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,712 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,712 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,718 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,718 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,718 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,718 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,721 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,721 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,721 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,721 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,722 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,722 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,722 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,722 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,723 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,723 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,723 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,724 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,724 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,724 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,724 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,724 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,738 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,738 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,738 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,738 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,738 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,740 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,740 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,740 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,741 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,741 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,741 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,741 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,741 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,750 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,750 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,750 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,751 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,751 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,751 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,751 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,751 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,752 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,752 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,752 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,752 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,752 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,753 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,753 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,753 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,753 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,753 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,754 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,754 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,754 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,754 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,755 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,755 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,756 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,756 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,757 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,757 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,757 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,757 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,757 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-25 19:19:37,758 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-25 19:19:37,758 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,758 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,758 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,758 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,759 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-25 19:19:37,759 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-25 19:19:37,759 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,792 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,793 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,793 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,793 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,793 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,793 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,794 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,794 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,794 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,794 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,794 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,795 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,795 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,795 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-25 19:19:37,795 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-25 19:19:37,795 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,796 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,796 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-25 19:19:37,796 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-25 19:19:37,796 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,797 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,797 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,797 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,797 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,797 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,798 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,798 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,798 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,798 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,799 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,799 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,799 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,799 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,799 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,800 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,800 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,800 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,800 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,800 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,801 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,801 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,802 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,803 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,803 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,803 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,803 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,804 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,804 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,804 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,804 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,804 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,807 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,807 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,807 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,807 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,808 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,808 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,808 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,808 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,808 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,809 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,809 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,809 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,809 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,809 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,810 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,810 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,810 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,810 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,811 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,811 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,811 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,811 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,811 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,812 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,812 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,812 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,812 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,813 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,813 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,813 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,813 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,813 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,814 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,817 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-25 19:19:37,818 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,818 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-25 19:19:37,818 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,818 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,819 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,819 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,819 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,819 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,820 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,820 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,820 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,821 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,821 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,821 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,821 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,821 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,822 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,822 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,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-25 19:19:37,822 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,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-25 19:19:37,823 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,823 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,823 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,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-25 19:19:37,823 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,824 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,824 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,824 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,824 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-25 19:19:37,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-25 19:19:37,825 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,825 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,825 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,829 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,829 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,829 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,830 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,830 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,830 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,830 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,830 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,830 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,831 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,831 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,831 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,831 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,831 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,832 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,832 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-25 19:19:37,832 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:37,832 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-25 19:19:37,835 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-25 19:19:37,887 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:19:37,895 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-25 19:19:37,895 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-11-25 19:19:37,918 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 19:19:37,935 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 220 transitions, 456 flow [2021-11-25 19:19:37,944 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 220 transitions, 456 flow [2021-11-25 19:19:37,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 210 places, 220 transitions, 456 flow [2021-11-25 19:19:38,072 INFO L129 PetriNetUnfolder]: 17/218 cut-off events. [2021-11-25 19:19:38,072 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-25 19:19:38,080 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-25 19:19:38,100 INFO L116 LiptonReduction]: Number of co-enabled transitions 17440 [2021-11-25 19:19:44,551 INFO L131 LiptonReduction]: Checked pairs total: 29990 [2021-11-25 19:19:44,552 INFO L133 LiptonReduction]: Total number of compositions: 198 [2021-11-25 19:19:44,561 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 60 transitions, 136 flow [2021-11-25 19:19:44,672 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-25 19:19:44,683 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-25 19:19:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 19:19:44,703 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:19:44,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:19:44,705 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-25 19:19:44,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:19:44,711 INFO L85 PathProgramCache]: Analyzing trace with hash 858118945, now seen corresponding path program 1 times [2021-11-25 19:19:44,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:19:44,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225532079] [2021-11-25 19:19:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:19:44,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:19:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:19:45,274 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-25 19:19:45,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:19:45,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225532079] [2021-11-25 19:19:45,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225532079] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:19:45,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:19:45,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 19:19:45,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323547568] [2021-11-25 19:19:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:19:45,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 19:19:45,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:19:45,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 19:19:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:19:45,328 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-25 19:19:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:19:45,802 INFO L93 Difference]: Finished difference Result 1904 states and 6246 transitions. [2021-11-25 19:19:45,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:19:45,804 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-25 19:19:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:19:45,846 INFO L225 Difference]: With dead ends: 1904 [2021-11-25 19:19:45,846 INFO L226 Difference]: Without dead ends: 1901 [2021-11-25 19:19:45,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-25 19:19:45,851 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:19:45,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 11 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 19:19:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2021-11-25 19:19:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1900. [2021-11-25 19:19:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1896 states have (on average 3.2906118143459917) internal successors, (6239), 1899 states have internal predecessors, (6239), 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-25 19:19:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 6239 transitions. [2021-11-25 19:19:46,033 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 6239 transitions. Word has length 17 [2021-11-25 19:19:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:19:46,034 INFO L470 AbstractCegarLoop]: Abstraction has 1900 states and 6239 transitions. [2021-11-25 19:19:46,034 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-25 19:19:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 6239 transitions. [2021-11-25 19:19:46,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 19:19:46,041 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:19:46,042 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-25 19:19:46,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 19:19:46,043 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-25 19:19:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:19:46,046 INFO L85 PathProgramCache]: Analyzing trace with hash 551663106, now seen corresponding path program 1 times [2021-11-25 19:19:46,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:19:46,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221637705] [2021-11-25 19:19:46,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:19:46,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:19:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:19:46,280 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-25 19:19:46,281 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:19:46,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221637705] [2021-11-25 19:19:46,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221637705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:19:46,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:19:46,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 19:19:46,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919450083] [2021-11-25 19:19:46,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:19:46,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 19:19:46,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:19:46,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 19:19:46,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:19:46,284 INFO L87 Difference]: Start difference. First operand 1900 states and 6239 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-25 19:19:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:19:46,925 INFO L93 Difference]: Finished difference Result 2947 states and 9726 transitions. [2021-11-25 19:19:46,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 19:19:46,926 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-25 19:19:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:19:46,958 INFO L225 Difference]: With dead ends: 2947 [2021-11-25 19:19:46,958 INFO L226 Difference]: Without dead ends: 2804 [2021-11-25 19:19:46,959 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-25 19:19:46,964 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-25 19:19:46,969 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-25 19:19:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2021-11-25 19:19:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2472. [2021-11-25 19:19:47,083 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-25 19:19:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 8169 transitions. [2021-11-25 19:19:47,103 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 8169 transitions. Word has length 18 [2021-11-25 19:19:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:19:47,103 INFO L470 AbstractCegarLoop]: Abstraction has 2472 states and 8169 transitions. [2021-11-25 19:19:47,103 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-25 19:19:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 8169 transitions. [2021-11-25 19:19:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 19:19:47,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:19:47,107 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-25 19:19:47,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 19:19:47,109 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-25 19:19:47,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:19:47,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1943633856, now seen corresponding path program 2 times [2021-11-25 19:19:47,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:19:47,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727211042] [2021-11-25 19:19:47,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:19:47,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:19:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:19:47,464 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-25 19:19:47,464 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:19:47,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727211042] [2021-11-25 19:19:47,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727211042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:19:47,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:19:47,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 19:19:47,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307368189] [2021-11-25 19:19:47,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:19:47,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 19:19:47,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:19:47,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 19:19:47,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:19:47,467 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-25 19:19:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:19:48,076 INFO L93 Difference]: Finished difference Result 2702 states and 8801 transitions. [2021-11-25 19:19:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 19:19:48,077 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-25 19:19:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:19:48,105 INFO L225 Difference]: With dead ends: 2702 [2021-11-25 19:19:48,105 INFO L226 Difference]: Without dead ends: 2571 [2021-11-25 19:19:48,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:19:48,107 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 132 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:19:48,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 9 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 19:19:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2021-11-25 19:19:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2392. [2021-11-25 19:19:48,250 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-25 19:19:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 7878 transitions. [2021-11-25 19:19:48,271 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 7878 transitions. Word has length 18 [2021-11-25 19:19:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:19:48,271 INFO L470 AbstractCegarLoop]: Abstraction has 2392 states and 7878 transitions. [2021-11-25 19:19:48,271 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-25 19:19:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 7878 transitions. [2021-11-25 19:19:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:19:48,279 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:19:48,279 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-25 19:19:48,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 19:19:48,280 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-25 19:19:48,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:19:48,281 INFO L85 PathProgramCache]: Analyzing trace with hash 612061240, now seen corresponding path program 1 times [2021-11-25 19:19:48,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:19:48,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318806216] [2021-11-25 19:19:48,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:19:48,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:19:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:19:48,801 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-25 19:19:48,801 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:19:48,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318806216] [2021-11-25 19:19:48,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318806216] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:19:48,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:19:48,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:19:48,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983223980] [2021-11-25 19:19:48,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:19:48,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:19:48,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:19:48,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:19:48,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:19:48,803 INFO L87 Difference]: Start difference. First operand 2392 states and 7878 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-25 19:19:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:19:50,906 INFO L93 Difference]: Finished difference Result 3213 states and 10406 transitions. [2021-11-25 19:19:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:19:50,907 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-25 19:19:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:19:50,941 INFO L225 Difference]: With dead ends: 3213 [2021-11-25 19:19:50,941 INFO L226 Difference]: Without dead ends: 3127 [2021-11-25 19:19:50,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:19:50,946 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 276 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:19:50,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 28 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:19:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2021-11-25 19:19:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 2882. [2021-11-25 19:19:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2878 states have (on average 3.2932592077831826) internal successors, (9478), 2881 states have internal predecessors, (9478), 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-25 19:19:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 9478 transitions. [2021-11-25 19:19:51,096 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 9478 transitions. Word has length 25 [2021-11-25 19:19:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:19:51,098 INFO L470 AbstractCegarLoop]: Abstraction has 2882 states and 9478 transitions. [2021-11-25 19:19:51,099 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-25 19:19:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 9478 transitions. [2021-11-25 19:19:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:19:51,110 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:19:51,110 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-25 19:19:51,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 19:19:51,110 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-25 19:19:51,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:19:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash 673642219, now seen corresponding path program 1 times [2021-11-25 19:19:51,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:19:51,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314275367] [2021-11-25 19:19:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:19:51,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:19:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:19:51,593 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-25 19:19:51,593 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:19:51,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314275367] [2021-11-25 19:19:51,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314275367] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:19:51,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:19:51,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:19:51,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328536615] [2021-11-25 19:19:51,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:19:51,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:19:51,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:19:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:19:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:19:51,596 INFO L87 Difference]: Start difference. First operand 2882 states and 9478 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-25 19:19:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:19:53,962 INFO L93 Difference]: Finished difference Result 3829 states and 12331 transitions. [2021-11-25 19:19:53,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 19:19:53,963 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-25 19:19:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:19:54,000 INFO L225 Difference]: With dead ends: 3829 [2021-11-25 19:19:54,000 INFO L226 Difference]: Without dead ends: 3743 [2021-11-25 19:19:54,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 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-25 19:19:54,002 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 256 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:19:54,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 38 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:19:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2021-11-25 19:19:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3442. [2021-11-25 19:19:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 3438 states have (on average 3.268760907504363) internal successors, (11238), 3441 states have internal predecessors, (11238), 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-25 19:19:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 11238 transitions. [2021-11-25 19:19:54,142 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 11238 transitions. Word has length 25 [2021-11-25 19:19:54,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:19:54,143 INFO L470 AbstractCegarLoop]: Abstraction has 3442 states and 11238 transitions. [2021-11-25 19:19:54,143 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-25 19:19:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 11238 transitions. [2021-11-25 19:19:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:19:54,153 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:19:54,154 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-25 19:19:54,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 19:19:54,154 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-25 19:19:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:19:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash -626712486, now seen corresponding path program 2 times [2021-11-25 19:19:54,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:19:54,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935674621] [2021-11-25 19:19:54,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:19:54,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:19:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:19:54,624 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-25 19:19:54,624 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:19:54,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935674621] [2021-11-25 19:19:54,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935674621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:19:54,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:19:54,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:19:54,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357890837] [2021-11-25 19:19:54,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:19:54,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:19:54,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:19:54,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:19:54,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:19:54,626 INFO L87 Difference]: Start difference. First operand 3442 states and 11238 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-25 19:19:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:19:57,157 INFO L93 Difference]: Finished difference Result 4830 states and 15400 transitions. [2021-11-25 19:19:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 19:19:57,158 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-25 19:19:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:19:57,178 INFO L225 Difference]: With dead ends: 4830 [2021-11-25 19:19:57,178 INFO L226 Difference]: Without dead ends: 4744 [2021-11-25 19:19:57,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=322, Invalid=800, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 19:19:57,180 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 247 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:19:57,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 42 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 19:19:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2021-11-25 19:19:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 3372. [2021-11-25 19:19:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3372 states, 3368 states have (on average 3.253562945368171) internal successors, (10958), 3371 states have internal predecessors, (10958), 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-25 19:19:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 10958 transitions. [2021-11-25 19:19:57,335 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 10958 transitions. Word has length 25 [2021-11-25 19:19:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:19:57,335 INFO L470 AbstractCegarLoop]: Abstraction has 3372 states and 10958 transitions. [2021-11-25 19:19:57,336 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-25 19:19:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 10958 transitions. [2021-11-25 19:19:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:19:57,346 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:19:57,346 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-25 19:19:57,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 19:19:57,346 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-25 19:19:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:19:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1115878098, now seen corresponding path program 3 times [2021-11-25 19:19:57,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:19:57,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037300836] [2021-11-25 19:19:57,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:19:57,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:19:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:19:57,820 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-25 19:19:57,820 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:19:57,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037300836] [2021-11-25 19:19:57,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037300836] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:19:57,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:19:57,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:19:57,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287438417] [2021-11-25 19:19:57,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:19:57,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:19:57,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:19:57,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:19:57,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:19:57,822 INFO L87 Difference]: Start difference. First operand 3372 states and 10958 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-25 19:20:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:01,375 INFO L93 Difference]: Finished difference Result 4456 states and 14139 transitions. [2021-11-25 19:20:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 19:20:01,375 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-25 19:20:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:01,390 INFO L225 Difference]: With dead ends: 4456 [2021-11-25 19:20:01,391 INFO L226 Difference]: Without dead ends: 4370 [2021-11-25 19:20:01,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=456, Invalid=1266, Unknown=0, NotChecked=0, Total=1722 [2021-11-25 19:20:01,393 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 244 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 2679 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:01,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 65 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2679 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 19:20:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2021-11-25 19:20:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 3162. [2021-11-25 19:20:01,513 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-25 19:20:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 10221 transitions. [2021-11-25 19:20:01,560 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 10221 transitions. Word has length 25 [2021-11-25 19:20:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:01,561 INFO L470 AbstractCegarLoop]: Abstraction has 3162 states and 10221 transitions. [2021-11-25 19:20:01,561 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-25 19:20:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 10221 transitions. [2021-11-25 19:20:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:20:01,572 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:01,572 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-25 19:20:01,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 19:20:01,572 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-25 19:20:01,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:01,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1853265656, now seen corresponding path program 4 times [2021-11-25 19:20:01,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:01,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611269439] [2021-11-25 19:20:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:01,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:02,026 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-25 19:20:02,026 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:02,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611269439] [2021-11-25 19:20:02,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611269439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:02,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:02,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:20:02,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916145952] [2021-11-25 19:20:02,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:02,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:20:02,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:02,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:20:02,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:20:02,029 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-25 19:20:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:05,180 INFO L93 Difference]: Finished difference Result 4162 states and 13215 transitions. [2021-11-25 19:20:05,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 19:20:05,181 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-25 19:20:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:05,197 INFO L225 Difference]: With dead ends: 4162 [2021-11-25 19:20:05,198 INFO L226 Difference]: Without dead ends: 4076 [2021-11-25 19:20:05,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=409, Invalid=1151, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 19:20:05,199 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 228 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:05,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 61 Invalid, 2601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 19:20:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2021-11-25 19:20:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3106. [2021-11-25 19:20:05,315 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-25 19:20:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 10045 transitions. [2021-11-25 19:20:05,330 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 10045 transitions. Word has length 25 [2021-11-25 19:20:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:05,330 INFO L470 AbstractCegarLoop]: Abstraction has 3106 states and 10045 transitions. [2021-11-25 19:20:05,330 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-25 19:20:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 10045 transitions. [2021-11-25 19:20:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:20:05,339 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:05,339 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-25 19:20:05,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 19:20:05,340 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-25 19:20:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:05,340 INFO L85 PathProgramCache]: Analyzing trace with hash 532362993, now seen corresponding path program 2 times [2021-11-25 19:20:05,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:05,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334914043] [2021-11-25 19:20:05,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:05,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:05,806 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-25 19:20:05,806 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:05,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334914043] [2021-11-25 19:20:05,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334914043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:05,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:05,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:20:05,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843004526] [2021-11-25 19:20:05,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:05,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:05,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:05,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:05,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:05,808 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-25 19:20:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:08,381 INFO L93 Difference]: Finished difference Result 4602 states and 14458 transitions. [2021-11-25 19:20:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 19:20:08,382 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-25 19:20:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:08,403 INFO L225 Difference]: With dead ends: 4602 [2021-11-25 19:20:08,403 INFO L226 Difference]: Without dead ends: 4516 [2021-11-25 19:20:08,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=400, Invalid=1006, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:20:08,406 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 278 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:08,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 46 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:20:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2021-11-25 19:20:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 3036. [2021-11-25 19:20:08,523 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-25 19:20:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 9835 transitions. [2021-11-25 19:20:08,538 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 9835 transitions. Word has length 25 [2021-11-25 19:20:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:08,538 INFO L470 AbstractCegarLoop]: Abstraction has 3036 states and 9835 transitions. [2021-11-25 19:20:08,539 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-25 19:20:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 9835 transitions. [2021-11-25 19:20:08,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:20:08,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:08,547 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-25 19:20:08,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 19:20:08,548 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-25 19:20:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:08,548 INFO L85 PathProgramCache]: Analyzing trace with hash -365364165, now seen corresponding path program 3 times [2021-11-25 19:20:08,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:08,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909306700] [2021-11-25 19:20:08,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:08,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:09,036 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-25 19:20:09,036 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:09,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909306700] [2021-11-25 19:20:09,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909306700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:09,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:09,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:20:09,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638606975] [2021-11-25 19:20:09,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:09,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:09,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:09,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:09,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:09,039 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-25 19:20:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:11,893 INFO L93 Difference]: Finished difference Result 4382 states and 13798 transitions. [2021-11-25 19:20:11,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 19:20:11,894 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-25 19:20:11,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:11,908 INFO L225 Difference]: With dead ends: 4382 [2021-11-25 19:20:11,909 INFO L226 Difference]: Without dead ends: 4296 [2021-11-25 19:20:11,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=439, Invalid=1121, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 19:20:11,910 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 266 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:11,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 58 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:20:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2021-11-25 19:20:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 2966. [2021-11-25 19:20:12,018 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-25 19:20:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 9565 transitions. [2021-11-25 19:20:12,064 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 9565 transitions. Word has length 25 [2021-11-25 19:20:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:12,064 INFO L470 AbstractCegarLoop]: Abstraction has 2966 states and 9565 transitions. [2021-11-25 19:20:12,065 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-25 19:20:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 9565 transitions. [2021-11-25 19:20:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:20:12,072 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:12,072 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-25 19:20:12,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 19:20:12,073 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-25 19:20:12,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:12,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1499949225, now seen corresponding path program 4 times [2021-11-25 19:20:12,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:12,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020004565] [2021-11-25 19:20:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:12,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:12,518 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-25 19:20:12,518 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:12,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020004565] [2021-11-25 19:20:12,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020004565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:12,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:12,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:20:12,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679854940] [2021-11-25 19:20:12,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:12,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:12,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:12,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:12,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:12,520 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-25 19:20:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:15,703 INFO L93 Difference]: Finished difference Result 4162 states and 13138 transitions. [2021-11-25 19:20:15,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 19:20:15,703 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-25 19:20:15,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:15,712 INFO L225 Difference]: With dead ends: 4162 [2021-11-25 19:20:15,712 INFO L226 Difference]: Without dead ends: 4076 [2021-11-25 19:20:15,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=479, Invalid=1243, Unknown=0, NotChecked=0, Total=1722 [2021-11-25 19:20:15,714 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 264 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 2674 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:15,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 73 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2674 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 19:20:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2021-11-25 19:20:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 2826. [2021-11-25 19:20:15,811 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-25 19:20:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 9145 transitions. [2021-11-25 19:20:15,857 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 9145 transitions. Word has length 25 [2021-11-25 19:20:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:15,857 INFO L470 AbstractCegarLoop]: Abstraction has 2826 states and 9145 transitions. [2021-11-25 19:20:15,857 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-25 19:20:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 9145 transitions. [2021-11-25 19:20:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:20:15,865 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:15,866 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-25 19:20:15,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 19:20:15,866 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-25 19:20:15,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:15,867 INFO L85 PathProgramCache]: Analyzing trace with hash -794497401, now seen corresponding path program 5 times [2021-11-25 19:20:15,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:15,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761107777] [2021-11-25 19:20:15,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:15,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:16,238 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-25 19:20:16,239 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:16,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761107777] [2021-11-25 19:20:16,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761107777] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:16,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:16,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:20:16,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484221398] [2021-11-25 19:20:16,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:16,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:16,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:16,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:16,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:16,241 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-25 19:20:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:19,149 INFO L93 Difference]: Finished difference Result 4001 states and 12645 transitions. [2021-11-25 19:20:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 19:20:19,149 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-25 19:20:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:19,156 INFO L225 Difference]: With dead ends: 4001 [2021-11-25 19:20:19,157 INFO L226 Difference]: Without dead ends: 3915 [2021-11-25 19:20:19,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=497, Invalid=1309, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 19:20:19,158 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 320 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:19,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 62 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:20:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2021-11-25 19:20:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 2770. [2021-11-25 19:20:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2766 states have (on average 3.2183658712942878) internal successors, (8902), 2769 states have internal predecessors, (8902), 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-25 19:20:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 8902 transitions. [2021-11-25 19:20:19,262 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 8902 transitions. Word has length 25 [2021-11-25 19:20:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:19,263 INFO L470 AbstractCegarLoop]: Abstraction has 2770 states and 8902 transitions. [2021-11-25 19:20:19,263 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-25 19:20:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 8902 transitions. [2021-11-25 19:20:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:20:19,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:19,269 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-25 19:20:19,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 19:20:19,270 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-25 19:20:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1254636031, now seen corresponding path program 6 times [2021-11-25 19:20:19,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:19,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785094666] [2021-11-25 19:20:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:19,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:19,690 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-25 19:20:19,690 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:19,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785094666] [2021-11-25 19:20:19,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785094666] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:19,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:19,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:20:19,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046671922] [2021-11-25 19:20:19,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:19,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:19,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:19,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:19,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:19,692 INFO L87 Difference]: Start difference. First operand 2770 states and 8902 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-25 19:20:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:23,359 INFO L93 Difference]: Finished difference Result 3868 states and 12196 transitions. [2021-11-25 19:20:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 19:20:23,360 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-25 19:20:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:23,367 INFO L225 Difference]: With dead ends: 3868 [2021-11-25 19:20:23,367 INFO L226 Difference]: Without dead ends: 3782 [2021-11-25 19:20:23,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=541, Invalid=1529, Unknown=0, NotChecked=0, Total=2070 [2021-11-25 19:20:23,369 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 216 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 2442 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:23,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 72 Invalid, 2488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2442 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 19:20:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2021-11-25 19:20:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 2700. [2021-11-25 19:20:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2696 states have (on average 3.2240356083086055) internal successors, (8692), 2699 states have internal predecessors, (8692), 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-25 19:20:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 8692 transitions. [2021-11-25 19:20:23,455 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 8692 transitions. Word has length 25 [2021-11-25 19:20:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:23,456 INFO L470 AbstractCegarLoop]: Abstraction has 2700 states and 8692 transitions. [2021-11-25 19:20:23,456 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-25 19:20:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 8692 transitions. [2021-11-25 19:20:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:23,461 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:23,462 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-25 19:20:23,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-25 19:20:23,462 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-25 19:20:23,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1791762257, now seen corresponding path program 1 times [2021-11-25 19:20:23,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:23,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396810616] [2021-11-25 19:20:23,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:23,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:23,959 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-25 19:20:23,959 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:23,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396810616] [2021-11-25 19:20:23,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396810616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:23,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:23,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:20:23,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826882909] [2021-11-25 19:20:23,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:23,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:23,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:23,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:23,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:23,961 INFO L87 Difference]: Start difference. First operand 2700 states and 8692 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-25 19:20:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:25,546 INFO L93 Difference]: Finished difference Result 4642 states and 15224 transitions. [2021-11-25 19:20:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:20:25,546 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-25 19:20:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:25,555 INFO L225 Difference]: With dead ends: 4642 [2021-11-25 19:20:25,555 INFO L226 Difference]: Without dead ends: 4642 [2021-11-25 19:20:25,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:20:25,556 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 274 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:25,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 55 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:20:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4642 states. [2021-11-25 19:20:25,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4642 to 3838. [2021-11-25 19:20:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3838 states, 3834 states have (on average 3.2420448617631714) internal successors, (12430), 3837 states have internal predecessors, (12430), 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-25 19:20:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 12430 transitions. [2021-11-25 19:20:25,675 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 12430 transitions. Word has length 27 [2021-11-25 19:20:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:25,676 INFO L470 AbstractCegarLoop]: Abstraction has 3838 states and 12430 transitions. [2021-11-25 19:20:25,676 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-25 19:20:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 12430 transitions. [2021-11-25 19:20:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:25,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:25,685 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-25 19:20:25,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-25 19:20:25,685 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:20:25,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:25,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1791762266, now seen corresponding path program 1 times [2021-11-25 19:20:25,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:25,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148261334] [2021-11-25 19:20:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:25,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:26,179 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-25 19:20:26,180 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:26,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148261334] [2021-11-25 19:20:26,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148261334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:26,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:26,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:20:26,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077571839] [2021-11-25 19:20:26,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:26,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:26,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:26,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:26,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:26,182 INFO L87 Difference]: Start difference. First operand 3838 states and 12430 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-25 19:20:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:27,448 INFO L93 Difference]: Finished difference Result 4642 states and 15110 transitions. [2021-11-25 19:20:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:20:27,449 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-25 19:20:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:27,459 INFO L225 Difference]: With dead ends: 4642 [2021-11-25 19:20:27,459 INFO L226 Difference]: Without dead ends: 4642 [2021-11-25 19:20:27,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 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-25 19:20:27,461 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 286 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:27,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 58 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 19:20:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4642 states. [2021-11-25 19:20:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4642 to 3838. [2021-11-25 19:20:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3838 states, 3834 states have (on average 3.223265519040167) internal successors, (12358), 3837 states have internal predecessors, (12358), 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-25 19:20:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 12358 transitions. [2021-11-25 19:20:27,646 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 12358 transitions. Word has length 27 [2021-11-25 19:20:27,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:27,647 INFO L470 AbstractCegarLoop]: Abstraction has 3838 states and 12358 transitions. [2021-11-25 19:20:27,647 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-25 19:20:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 12358 transitions. [2021-11-25 19:20:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:27,657 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:27,658 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-25 19:20:27,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-25 19:20:27,658 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:20:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1183722421, now seen corresponding path program 1 times [2021-11-25 19:20:27,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:27,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499021432] [2021-11-25 19:20:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:27,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:28,465 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-25 19:20:28,465 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:28,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499021432] [2021-11-25 19:20:28,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499021432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:28,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:28,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:20:28,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085411614] [2021-11-25 19:20:28,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:28,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:20:28,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:28,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:20:28,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:20:28,467 INFO L87 Difference]: Start difference. First operand 3838 states and 12358 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-25 19:20:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:31,356 INFO L93 Difference]: Finished difference Result 5790 states and 18806 transitions. [2021-11-25 19:20:31,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:20:31,357 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-25 19:20:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:31,368 INFO L225 Difference]: With dead ends: 5790 [2021-11-25 19:20:31,369 INFO L226 Difference]: Without dead ends: 5790 [2021-11-25 19:20:31,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2021-11-25 19:20:31,370 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 340 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 2059 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:31,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 73 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2059 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 19:20:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5790 states. [2021-11-25 19:20:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5790 to 4426. [2021-11-25 19:20:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4426 states, 4422 states have (on average 3.2026232473993668) internal successors, (14162), 4425 states have internal predecessors, (14162), 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-25 19:20:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 14162 transitions. [2021-11-25 19:20:31,495 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 14162 transitions. Word has length 27 [2021-11-25 19:20:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:31,495 INFO L470 AbstractCegarLoop]: Abstraction has 4426 states and 14162 transitions. [2021-11-25 19:20:31,496 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-25 19:20:31,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 14162 transitions. [2021-11-25 19:20:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:31,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:31,507 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-25 19:20:31,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-25 19:20:31,507 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-25 19:20:31,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1747595345, now seen corresponding path program 2 times [2021-11-25 19:20:31,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:31,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478579116] [2021-11-25 19:20:31,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:31,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:31,982 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-25 19:20:31,982 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:31,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478579116] [2021-11-25 19:20:31,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478579116] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:31,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:31,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:20:31,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487236859] [2021-11-25 19:20:31,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:31,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:31,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:31,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:31,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:31,985 INFO L87 Difference]: Start difference. First operand 4426 states and 14162 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-25 19:20:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:33,425 INFO L93 Difference]: Finished difference Result 6232 states and 20286 transitions. [2021-11-25 19:20:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:20:33,425 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-25 19:20:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:33,438 INFO L225 Difference]: With dead ends: 6232 [2021-11-25 19:20:33,438 INFO L226 Difference]: Without dead ends: 6232 [2021-11-25 19:20:33,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:20:33,439 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 267 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:33,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 62 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 19:20:33,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2021-11-25 19:20:33,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 5428. [2021-11-25 19:20:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5428 states, 5424 states have (on average 3.2249262536873156) internal successors, (17492), 5427 states have internal predecessors, (17492), 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-25 19:20:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 17492 transitions. [2021-11-25 19:20:33,602 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 17492 transitions. Word has length 27 [2021-11-25 19:20:33,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:33,603 INFO L470 AbstractCegarLoop]: Abstraction has 5428 states and 17492 transitions. [2021-11-25 19:20:33,603 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-25 19:20:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 17492 transitions. [2021-11-25 19:20:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:33,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:33,616 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-25 19:20:33,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-25 19:20:33,616 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-25 19:20:33,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1747595336, now seen corresponding path program 2 times [2021-11-25 19:20:33,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:33,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572637027] [2021-11-25 19:20:33,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:33,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:34,142 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-25 19:20:34,142 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:34,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572637027] [2021-11-25 19:20:34,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572637027] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:34,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:34,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:20:34,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868889370] [2021-11-25 19:20:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:34,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:34,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:34,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:34,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:34,144 INFO L87 Difference]: Start difference. First operand 5428 states and 17492 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-25 19:20:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:35,904 INFO L93 Difference]: Finished difference Result 6232 states and 20172 transitions. [2021-11-25 19:20:35,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:20:35,904 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-25 19:20:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:35,918 INFO L225 Difference]: With dead ends: 6232 [2021-11-25 19:20:35,918 INFO L226 Difference]: Without dead ends: 6232 [2021-11-25 19:20:35,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:20:35,919 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 231 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:35,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 76 Invalid, 2189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:20:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2021-11-25 19:20:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 4290. [2021-11-25 19:20:36,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4290 states, 4286 states have (on average 3.209052729818012) internal successors, (13754), 4289 states have internal predecessors, (13754), 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-25 19:20:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 13754 transitions. [2021-11-25 19:20:36,126 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 13754 transitions. Word has length 27 [2021-11-25 19:20:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:36,127 INFO L470 AbstractCegarLoop]: Abstraction has 4290 states and 13754 transitions. [2021-11-25 19:20:36,127 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-25 19:20:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 13754 transitions. [2021-11-25 19:20:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:36,136 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:36,137 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-25 19:20:36,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-25 19:20:36,137 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-25 19:20:36,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:36,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1339901129, now seen corresponding path program 3 times [2021-11-25 19:20:36,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:36,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59976013] [2021-11-25 19:20:36,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:36,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:36,766 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-25 19:20:36,767 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:36,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59976013] [2021-11-25 19:20:36,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59976013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:36,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:36,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:20:36,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736674816] [2021-11-25 19:20:36,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:36,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:20:36,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:36,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:20:36,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:20:36,769 INFO L87 Difference]: Start difference. First operand 4290 states and 13754 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-25 19:20:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:38,383 INFO L93 Difference]: Finished difference Result 5952 states and 19332 transitions. [2021-11-25 19:20:38,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 19:20:38,384 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-25 19:20:38,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:38,396 INFO L225 Difference]: With dead ends: 5952 [2021-11-25 19:20:38,396 INFO L226 Difference]: Without dead ends: 5952 [2021-11-25 19:20:38,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2021-11-25 19:20:38,398 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 300 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:38,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 75 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2031 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:20:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2021-11-25 19:20:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 4080. [2021-11-25 19:20:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4080 states, 4076 states have (on average 3.2198233562315997) internal successors, (13124), 4079 states have internal predecessors, (13124), 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-25 19:20:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 13124 transitions. [2021-11-25 19:20:38,591 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 13124 transitions. Word has length 27 [2021-11-25 19:20:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:38,592 INFO L470 AbstractCegarLoop]: Abstraction has 4080 states and 13124 transitions. [2021-11-25 19:20:38,592 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-25 19:20:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 13124 transitions. [2021-11-25 19:20:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:38,603 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:38,603 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-25 19:20:38,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-25 19:20:38,603 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-25 19:20:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:38,604 INFO L85 PathProgramCache]: Analyzing trace with hash -148961921, now seen corresponding path program 4 times [2021-11-25 19:20:38,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:38,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971301077] [2021-11-25 19:20:38,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:38,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:39,173 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-25 19:20:39,173 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:39,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971301077] [2021-11-25 19:20:39,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971301077] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:39,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:39,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:20:39,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318127963] [2021-11-25 19:20:39,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:39,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:39,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:39,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:39,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:39,176 INFO L87 Difference]: Start difference. First operand 4080 states and 13124 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-25 19:20:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:40,738 INFO L93 Difference]: Finished difference Result 5744 states and 18767 transitions. [2021-11-25 19:20:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:20:40,739 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-25 19:20:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:40,751 INFO L225 Difference]: With dead ends: 5744 [2021-11-25 19:20:40,751 INFO L226 Difference]: Without dead ends: 5744 [2021-11-25 19:20:40,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 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-25 19:20:40,752 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 224 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 2041 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:40,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 72 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2041 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:20:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2021-11-25 19:20:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 4868. [2021-11-25 19:20:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4868 states, 4864 states have (on average 3.2508223684210527) internal successors, (15812), 4867 states have internal predecessors, (15812), 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-25 19:20:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 15812 transitions. [2021-11-25 19:20:40,866 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 15812 transitions. Word has length 27 [2021-11-25 19:20:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:40,867 INFO L470 AbstractCegarLoop]: Abstraction has 4868 states and 15812 transitions. [2021-11-25 19:20:40,867 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-25 19:20:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 15812 transitions. [2021-11-25 19:20:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:40,878 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:40,878 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-25 19:20:40,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-25 19:20:40,879 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-25 19:20:40,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash -148961930, now seen corresponding path program 3 times [2021-11-25 19:20:40,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:40,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032985209] [2021-11-25 19:20:40,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:40,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:41,413 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-25 19:20:41,413 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:41,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032985209] [2021-11-25 19:20:41,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032985209] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:41,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:41,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:20:41,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969062667] [2021-11-25 19:20:41,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:41,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:41,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:41,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:41,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:41,415 INFO L87 Difference]: Start difference. First operand 4868 states and 15812 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-25 19:20:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:43,056 INFO L93 Difference]: Finished difference Result 5672 states and 18492 transitions. [2021-11-25 19:20:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:20:43,057 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-25 19:20:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:43,068 INFO L225 Difference]: With dead ends: 5672 [2021-11-25 19:20:43,068 INFO L226 Difference]: Without dead ends: 5672 [2021-11-25 19:20:43,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 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-25 19:20:43,070 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 270 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:43,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 72 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:20:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5672 states. [2021-11-25 19:20:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5672 to 4010. [2021-11-25 19:20:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4010 states, 4006 states have (on average 3.223664503245132) internal successors, (12914), 4009 states have internal predecessors, (12914), 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-25 19:20:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 12914 transitions. [2021-11-25 19:20:43,159 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 12914 transitions. Word has length 27 [2021-11-25 19:20:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:43,159 INFO L470 AbstractCegarLoop]: Abstraction has 4010 states and 12914 transitions. [2021-11-25 19:20:43,159 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-25 19:20:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 12914 transitions. [2021-11-25 19:20:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:43,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:43,169 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-25 19:20:43,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-25 19:20:43,169 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-25 19:20:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2025857443, now seen corresponding path program 5 times [2021-11-25 19:20:43,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:43,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304040411] [2021-11-25 19:20:43,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:43,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:43,617 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-25 19:20:43,617 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:43,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304040411] [2021-11-25 19:20:43,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304040411] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:43,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:43,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:20:43,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836421188] [2021-11-25 19:20:43,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:43,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:43,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:43,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:43,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:43,619 INFO L87 Difference]: Start difference. First operand 4010 states and 12914 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-25 19:20:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:44,976 INFO L93 Difference]: Finished difference Result 5462 states and 17842 transitions. [2021-11-25 19:20:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:20:44,977 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-25 19:20:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:44,989 INFO L225 Difference]: With dead ends: 5462 [2021-11-25 19:20:44,989 INFO L226 Difference]: Without dead ends: 5462 [2021-11-25 19:20:44,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:20:44,990 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 281 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:44,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 63 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 19:20:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states. [2021-11-25 19:20:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 3870. [2021-11-25 19:20:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 3866 states have (on average 3.2265907915157785) internal successors, (12474), 3869 states have internal predecessors, (12474), 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-25 19:20:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 12474 transitions. [2021-11-25 19:20:45,161 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 12474 transitions. Word has length 27 [2021-11-25 19:20:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:45,161 INFO L470 AbstractCegarLoop]: Abstraction has 3870 states and 12474 transitions. [2021-11-25 19:20:45,162 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-25 19:20:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 12474 transitions. [2021-11-25 19:20:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:45,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:45,169 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-25 19:20:45,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-25 19:20:45,173 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-25 19:20:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1027409839, now seen corresponding path program 6 times [2021-11-25 19:20:45,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:45,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118044705] [2021-11-25 19:20:45,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:45,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:45,587 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-25 19:20:45,588 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:45,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118044705] [2021-11-25 19:20:45,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118044705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:45,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:45,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:20:45,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138144815] [2021-11-25 19:20:45,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:45,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:45,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:45,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:45,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:45,589 INFO L87 Difference]: Start difference. First operand 3870 states and 12474 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-25 19:20:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:47,195 INFO L93 Difference]: Finished difference Result 6752 states and 22303 transitions. [2021-11-25 19:20:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 19:20:47,195 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-25 19:20:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:47,210 INFO L225 Difference]: With dead ends: 6752 [2021-11-25 19:20:47,210 INFO L226 Difference]: Without dead ends: 6752 [2021-11-25 19:20:47,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 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-25 19:20:47,211 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 311 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:47,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 70 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:20:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2021-11-25 19:20:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 4560. [2021-11-25 19:20:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4560 states, 4556 states have (on average 3.2618525021949076) internal successors, (14861), 4559 states have internal predecessors, (14861), 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-25 19:20:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4560 states to 4560 states and 14861 transitions. [2021-11-25 19:20:47,316 INFO L78 Accepts]: Start accepts. Automaton has 4560 states and 14861 transitions. Word has length 27 [2021-11-25 19:20:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:47,316 INFO L470 AbstractCegarLoop]: Abstraction has 4560 states and 14861 transitions. [2021-11-25 19:20:47,316 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-25 19:20:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4560 states and 14861 transitions. [2021-11-25 19:20:47,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:47,323 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:47,323 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-25 19:20:47,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-25 19:20:47,324 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:20:47,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:47,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1027409830, now seen corresponding path program 4 times [2021-11-25 19:20:47,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:47,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385964859] [2021-11-25 19:20:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:47,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:47,840 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-25 19:20:47,840 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:47,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385964859] [2021-11-25 19:20:47,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385964859] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:47,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:47,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:20:47,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357662099] [2021-11-25 19:20:47,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:47,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:20:47,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:47,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:20:47,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:20:47,842 INFO L87 Difference]: Start difference. First operand 4560 states and 14861 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-25 19:20:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:49,739 INFO L93 Difference]: Finished difference Result 6752 states and 22189 transitions. [2021-11-25 19:20:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 19:20:49,740 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-25 19:20:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:49,761 INFO L225 Difference]: With dead ends: 6752 [2021-11-25 19:20:49,761 INFO L226 Difference]: Without dead ends: 6752 [2021-11-25 19:20:49,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2021-11-25 19:20:49,764 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 287 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 1896 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:49,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 67 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1896 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:20:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2021-11-25 19:20:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 3912. [2021-11-25 19:20:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 3908 states have (on average 3.227482088024565) internal successors, (12613), 3911 states have internal predecessors, (12613), 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-25 19:20:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 12613 transitions. [2021-11-25 19:20:49,870 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 12613 transitions. Word has length 27 [2021-11-25 19:20:49,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:49,870 INFO L470 AbstractCegarLoop]: Abstraction has 3912 states and 12613 transitions. [2021-11-25 19:20:49,870 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-25 19:20:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 12613 transitions. [2021-11-25 19:20:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:49,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:49,879 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-25 19:20:49,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-25 19:20:49,880 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-25 19:20:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash 485894865, now seen corresponding path program 2 times [2021-11-25 19:20:49,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:49,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264896990] [2021-11-25 19:20:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:49,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:50,310 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-25 19:20:50,310 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:50,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264896990] [2021-11-25 19:20:50,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264896990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:50,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:50,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:20:50,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546988505] [2021-11-25 19:20:50,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:50,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:20:50,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:50,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:20:50,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:20:50,312 INFO L87 Difference]: Start difference. First operand 3912 states and 12613 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-25 19:20:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:52,368 INFO L93 Difference]: Finished difference Result 5804 states and 18881 transitions. [2021-11-25 19:20:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:20:52,368 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-25 19:20:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:52,382 INFO L225 Difference]: With dead ends: 5804 [2021-11-25 19:20:52,382 INFO L226 Difference]: Without dead ends: 5804 [2021-11-25 19:20:52,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-25 19:20:52,383 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 332 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 2241 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:52,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 86 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2241 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:20:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2021-11-25 19:20:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 3852. [2021-11-25 19:20:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3852 states, 3848 states have (on average 3.231029106029106) internal successors, (12433), 3851 states have internal predecessors, (12433), 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-25 19:20:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 12433 transitions. [2021-11-25 19:20:52,493 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 12433 transitions. Word has length 27 [2021-11-25 19:20:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:52,493 INFO L470 AbstractCegarLoop]: Abstraction has 3852 states and 12433 transitions. [2021-11-25 19:20:52,493 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-25 19:20:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 12433 transitions. [2021-11-25 19:20:52,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:52,500 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:52,500 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-25 19:20:52,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-25 19:20:52,500 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-25 19:20:52,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:52,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1058522523, now seen corresponding path program 3 times [2021-11-25 19:20:52,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:52,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17098597] [2021-11-25 19:20:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:52,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:53,074 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-25 19:20:53,074 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:53,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17098597] [2021-11-25 19:20:53,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17098597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:53,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:53,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:20:53,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721014622] [2021-11-25 19:20:53,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:53,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:20:53,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:53,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:20:53,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:20:53,076 INFO L87 Difference]: Start difference. First operand 3852 states and 12433 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-25 19:20:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:54,880 INFO L93 Difference]: Finished difference Result 5618 states and 18323 transitions. [2021-11-25 19:20:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:20:54,882 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-25 19:20:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:54,893 INFO L225 Difference]: With dead ends: 5618 [2021-11-25 19:20:54,894 INFO L226 Difference]: Without dead ends: 5618 [2021-11-25 19:20:54,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-25 19:20:54,895 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 301 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:54,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 76 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:20:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5618 states. [2021-11-25 19:20:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5618 to 3726. [2021-11-25 19:20:54,971 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-25 19:20:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 12055 transitions. [2021-11-25 19:20:54,981 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 12055 transitions. Word has length 27 [2021-11-25 19:20:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:54,982 INFO L470 AbstractCegarLoop]: Abstraction has 3726 states and 12055 transitions. [2021-11-25 19:20:54,982 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-25 19:20:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 12055 transitions. [2021-11-25 19:20:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:54,989 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:54,989 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-25 19:20:54,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-25 19:20:54,990 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-25 19:20:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:54,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1671639415, now seen corresponding path program 4 times [2021-11-25 19:20:54,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:54,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125902566] [2021-11-25 19:20:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:54,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:55,582 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-25 19:20:55,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:55,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125902566] [2021-11-25 19:20:55,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125902566] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:55,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:55,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:20:55,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369790785] [2021-11-25 19:20:55,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:55,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:20:55,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:20:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:20:55,584 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-25 19:20:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:57,417 INFO L93 Difference]: Finished difference Result 5498 states and 17963 transitions. [2021-11-25 19:20:57,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:20:57,418 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-25 19:20:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:57,430 INFO L225 Difference]: With dead ends: 5498 [2021-11-25 19:20:57,430 INFO L226 Difference]: Without dead ends: 5498 [2021-11-25 19:20:57,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-25 19:20:57,431 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 301 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:57,431 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.2s Time] [2021-11-25 19:20:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5498 states. [2021-11-25 19:20:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5498 to 3546. [2021-11-25 19:20:57,503 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-25 19:20:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 11515 transitions. [2021-11-25 19:20:57,512 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 11515 transitions. Word has length 27 [2021-11-25 19:20:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:57,513 INFO L470 AbstractCegarLoop]: Abstraction has 3546 states and 11515 transitions. [2021-11-25 19:20:57,513 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-25 19:20:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 11515 transitions. [2021-11-25 19:20:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:57,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:57,517 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-25 19:20:57,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-25 19:20:57,517 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-25 19:20:57,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash 978343143, now seen corresponding path program 5 times [2021-11-25 19:20:57,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:57,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119551748] [2021-11-25 19:20:57,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:57,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:58,009 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-25 19:20:58,010 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:58,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119551748] [2021-11-25 19:20:58,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119551748] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:58,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:58,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:20:58,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500121550] [2021-11-25 19:20:58,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:58,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:20:58,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:20:58,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:20:58,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:20:58,011 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-25 19:20:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:59,913 INFO L93 Difference]: Finished difference Result 5138 states and 16883 transitions. [2021-11-25 19:20:59,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 19:20:59,914 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-25 19:20:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:59,925 INFO L225 Difference]: With dead ends: 5138 [2021-11-25 19:20:59,925 INFO L226 Difference]: Without dead ends: 5138 [2021-11-25 19:20:59,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:20:59,926 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 341 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 2111 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:59,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 84 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2111 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:20:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2021-11-25 19:20:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 3546. [2021-11-25 19:20:59,998 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-25 19:21:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 11515 transitions. [2021-11-25 19:21:00,007 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 11515 transitions. Word has length 27 [2021-11-25 19:21:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:00,008 INFO L470 AbstractCegarLoop]: Abstraction has 3546 states and 11515 transitions. [2021-11-25 19:21:00,008 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-25 19:21:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 11515 transitions. [2021-11-25 19:21:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:21:00,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:00,012 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-25 19:21:00,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-25 19:21:00,012 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:21:00,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:00,013 INFO L85 PathProgramCache]: Analyzing trace with hash -772704601, now seen corresponding path program 6 times [2021-11-25 19:21:00,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:00,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890494036] [2021-11-25 19:21:00,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:00,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:00,566 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-25 19:21:00,566 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:00,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890494036] [2021-11-25 19:21:00,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890494036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:00,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:00,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:21:00,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231634858] [2021-11-25 19:21:00,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:00,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:21:00,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:21:00,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:21:00,568 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-25 19:21:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:03,206 INFO L93 Difference]: Finished difference Result 7016 states and 23302 transitions. [2021-11-25 19:21:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 19:21:03,207 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-25 19:21:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:03,223 INFO L225 Difference]: With dead ends: 7016 [2021-11-25 19:21:03,223 INFO L226 Difference]: Without dead ends: 7016 [2021-11-25 19:21:03,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2021-11-25 19:21:03,224 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 350 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:03,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 92 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 19:21:03,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2021-11-25 19:21:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 3552. [2021-11-25 19:21:03,317 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-25 19:21:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 11534 transitions. [2021-11-25 19:21:03,331 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 11534 transitions. Word has length 27 [2021-11-25 19:21:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:03,331 INFO L470 AbstractCegarLoop]: Abstraction has 3552 states and 11534 transitions. [2021-11-25 19:21:03,331 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-25 19:21:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 11534 transitions. [2021-11-25 19:21:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:21:03,337 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:03,337 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-25 19:21:03,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-25 19:21:03,337 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:21:03,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:03,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1166751201, now seen corresponding path program 7 times [2021-11-25 19:21:03,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:03,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048205452] [2021-11-25 19:21:03,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:03,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:03,930 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-25 19:21:03,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:03,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048205452] [2021-11-25 19:21:03,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048205452] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:03,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:03,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:21:03,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945344779] [2021-11-25 19:21:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:03,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:21:03,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:21:03,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:21:03,932 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-25 19:21:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:05,996 INFO L93 Difference]: Finished difference Result 5074 states and 16796 transitions. [2021-11-25 19:21:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:21:05,997 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-25 19:21:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:06,008 INFO L225 Difference]: With dead ends: 5074 [2021-11-25 19:21:06,008 INFO L226 Difference]: Without dead ends: 5074 [2021-11-25 19:21:06,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2021-11-25 19:21:06,009 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 298 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:06,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 83 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2127 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:21:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2021-11-25 19:21:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 4200. [2021-11-25 19:21:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4200 states, 4196 states have (on average 3.284556720686368) internal successors, (13782), 4199 states have internal predecessors, (13782), 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-25 19:21:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4200 states to 4200 states and 13782 transitions. [2021-11-25 19:21:06,098 INFO L78 Accepts]: Start accepts. Automaton has 4200 states and 13782 transitions. Word has length 27 [2021-11-25 19:21:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:06,098 INFO L470 AbstractCegarLoop]: Abstraction has 4200 states and 13782 transitions. [2021-11-25 19:21:06,098 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-25 19:21:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4200 states and 13782 transitions. [2021-11-25 19:21:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:21:06,102 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:06,102 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-25 19:21:06,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-25 19:21:06,102 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:21:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1166751192, now seen corresponding path program 1 times [2021-11-25 19:21:06,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:06,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993282700] [2021-11-25 19:21:06,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:06,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:06,666 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-25 19:21:06,666 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:06,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993282700] [2021-11-25 19:21:06,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993282700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:06,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:06,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:21:06,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967992695] [2021-11-25 19:21:06,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:06,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:21:06,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:06,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:21:06,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:21:06,668 INFO L87 Difference]: Start difference. First operand 4200 states and 13782 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-25 19:21:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:08,428 INFO L93 Difference]: Finished difference Result 5074 states and 16682 transitions. [2021-11-25 19:21:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:21:08,429 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-25 19:21:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:08,440 INFO L225 Difference]: With dead ends: 5074 [2021-11-25 19:21:08,441 INFO L226 Difference]: Without dead ends: 5074 [2021-11-25 19:21:08,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2021-11-25 19:21:08,442 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 338 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:08,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 75 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:21:08,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2021-11-25 19:21:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 3352. [2021-11-25 19:21:08,515 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-25 19:21:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 10914 transitions. [2021-11-25 19:21:08,528 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 10914 transitions. Word has length 27 [2021-11-25 19:21:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:08,529 INFO L470 AbstractCegarLoop]: Abstraction has 3352 states and 10914 transitions. [2021-11-25 19:21:08,529 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-25 19:21:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 10914 transitions. [2021-11-25 19:21:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:21:08,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:08,535 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-25 19:21:08,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-25 19:21:08,535 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-25 19:21:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash -536695196, now seen corresponding path program 1 times [2021-11-25 19:21:08,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:08,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658117305] [2021-11-25 19:21:08,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:08,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:08,849 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-25 19:21:08,849 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:08,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658117305] [2021-11-25 19:21:08,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658117305] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:08,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:08,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 19:21:08,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74454398] [2021-11-25 19:21:08,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:08,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:21:08,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:08,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:21:08,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:21:08,852 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-25 19:21:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:09,957 INFO L93 Difference]: Finished difference Result 9472 states and 31200 transitions. [2021-11-25 19:21:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 19:21:09,959 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-25 19:21:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:09,979 INFO L225 Difference]: With dead ends: 9472 [2021-11-25 19:21:09,979 INFO L226 Difference]: Without dead ends: 9472 [2021-11-25 19:21:09,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2021-11-25 19:21:09,980 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 403 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:09,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 26 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-25 19:21:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9472 states. [2021-11-25 19:21:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9472 to 7470. [2021-11-25 19:21:10,139 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-25 19:21:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 25092 transitions. [2021-11-25 19:21:10,160 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 25092 transitions. Word has length 30 [2021-11-25 19:21:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:10,161 INFO L470 AbstractCegarLoop]: Abstraction has 7470 states and 25092 transitions. [2021-11-25 19:21:10,161 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-25 19:21:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 25092 transitions. [2021-11-25 19:21:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:21:10,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:10,169 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-25 19:21:10,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-25 19:21:10,169 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-25 19:21:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:10,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1700971848, now seen corresponding path program 1 times [2021-11-25 19:21:10,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:10,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313900256] [2021-11-25 19:21:10,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:10,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:10,485 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-25 19:21:10,485 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:10,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313900256] [2021-11-25 19:21:10,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313900256] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:10,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:10,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:21:10,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882259808] [2021-11-25 19:21:10,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:10,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:21:10,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:21:10,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:21:10,487 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-25 19:21:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:11,455 INFO L93 Difference]: Finished difference Result 12164 states and 40772 transitions. [2021-11-25 19:21:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 19:21:11,455 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-25 19:21:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:11,485 INFO L225 Difference]: With dead ends: 12164 [2021-11-25 19:21:11,485 INFO L226 Difference]: Without dead ends: 12164 [2021-11-25 19:21:11,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-11-25 19:21:11,486 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 516 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:11,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 28 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 19:21:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12164 states. [2021-11-25 19:21:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12164 to 9302. [2021-11-25 19:21:11,672 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-25 19:21:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9302 states to 9302 states and 31370 transitions. [2021-11-25 19:21:11,699 INFO L78 Accepts]: Start accepts. Automaton has 9302 states and 31370 transitions. Word has length 30 [2021-11-25 19:21:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:11,699 INFO L470 AbstractCegarLoop]: Abstraction has 9302 states and 31370 transitions. [2021-11-25 19:21:11,699 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-25 19:21:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 9302 states and 31370 transitions. [2021-11-25 19:21:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:21:11,710 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:11,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-25 19:21:11,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-25 19:21:11,710 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-25 19:21:11,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash -981490814, now seen corresponding path program 2 times [2021-11-25 19:21:11,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:11,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433950097] [2021-11-25 19:21:11,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:11,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:12,008 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-25 19:21:12,009 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:12,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433950097] [2021-11-25 19:21:12,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433950097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:12,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:12,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 19:21:12,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350558296] [2021-11-25 19:21:12,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:12,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:21:12,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:12,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:21:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:21:12,010 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-25 19:21:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:13,412 INFO L93 Difference]: Finished difference Result 16084 states and 53591 transitions. [2021-11-25 19:21:13,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:21:13,413 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-25 19:21:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:13,456 INFO L225 Difference]: With dead ends: 16084 [2021-11-25 19:21:13,456 INFO L226 Difference]: Without dead ends: 16084 [2021-11-25 19:21:13,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-11-25 19:21:13,457 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 479 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:13,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [479 Valid, 45 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 19:21:13,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16084 states. [2021-11-25 19:21:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16084 to 9030. [2021-11-25 19:21:13,677 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-25 19:21:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9030 states to 9030 states and 30252 transitions. [2021-11-25 19:21:13,703 INFO L78 Accepts]: Start accepts. Automaton has 9030 states and 30252 transitions. Word has length 30 [2021-11-25 19:21:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:13,703 INFO L470 AbstractCegarLoop]: Abstraction has 9030 states and 30252 transitions. [2021-11-25 19:21:13,703 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-25 19:21:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 9030 states and 30252 transitions. [2021-11-25 19:21:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:21:13,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:13,714 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-25 19:21:13,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-25 19:21:13,714 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-25 19:21:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash -432366582, now seen corresponding path program 3 times [2021-11-25 19:21:13,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:13,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114836017] [2021-11-25 19:21:13,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:13,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:13,980 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-25 19:21:13,981 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:13,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114836017] [2021-11-25 19:21:13,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114836017] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:13,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:13,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 19:21:13,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710452642] [2021-11-25 19:21:13,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:13,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:21:13,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:13,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:21:13,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:21:13,982 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-25 19:21:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:15,716 INFO L93 Difference]: Finished difference Result 16030 states and 53672 transitions. [2021-11-25 19:21:15,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:21:15,717 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-25 19:21:15,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:15,756 INFO L225 Difference]: With dead ends: 16030 [2021-11-25 19:21:15,756 INFO L226 Difference]: Without dead ends: 16030 [2021-11-25 19:21:15,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:21:15,757 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 455 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:15,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 82 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:21:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16030 states. [2021-11-25 19:21:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16030 to 7370. [2021-11-25 19:21:15,945 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-25 19:21:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7370 states to 7370 states and 24567 transitions. [2021-11-25 19:21:15,967 INFO L78 Accepts]: Start accepts. Automaton has 7370 states and 24567 transitions. Word has length 30 [2021-11-25 19:21:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:15,967 INFO L470 AbstractCegarLoop]: Abstraction has 7370 states and 24567 transitions. [2021-11-25 19:21:15,967 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-25 19:21:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 7370 states and 24567 transitions. [2021-11-25 19:21:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:21:15,975 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:15,975 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-25 19:21:15,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-25 19:21:15,976 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:21:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1253284098, now seen corresponding path program 2 times [2021-11-25 19:21:15,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:15,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159838168] [2021-11-25 19:21:15,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:15,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:16,265 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-25 19:21:16,265 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:16,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159838168] [2021-11-25 19:21:16,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159838168] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:16,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:16,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 19:21:16,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646323028] [2021-11-25 19:21:16,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:16,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:21:16,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:16,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:21:16,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:21:16,267 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-25 19:21:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:17,679 INFO L93 Difference]: Finished difference Result 14448 states and 48158 transitions. [2021-11-25 19:21:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:21:17,679 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-25 19:21:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:17,715 INFO L225 Difference]: With dead ends: 14448 [2021-11-25 19:21:17,715 INFO L226 Difference]: Without dead ends: 14448 [2021-11-25 19:21:17,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2021-11-25 19:21:17,716 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 410 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:17,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 47 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 19:21:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14448 states. [2021-11-25 19:21:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14448 to 8808. [2021-11-25 19:21:18,056 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-25 19:21:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8808 states to 8808 states and 29855 transitions. [2021-11-25 19:21:18,090 INFO L78 Accepts]: Start accepts. Automaton has 8808 states and 29855 transitions. Word has length 30 [2021-11-25 19:21:18,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:18,090 INFO L470 AbstractCegarLoop]: Abstraction has 8808 states and 29855 transitions. [2021-11-25 19:21:18,091 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-25 19:21:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 8808 states and 29855 transitions. [2021-11-25 19:21:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:21:18,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:18,102 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-25 19:21:18,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-25 19:21:18,102 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:21:18,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash 793743864, now seen corresponding path program 3 times [2021-11-25 19:21:18,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:18,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310761869] [2021-11-25 19:21:18,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:18,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:18,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-25 19:21:18,410 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:18,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310761869] [2021-11-25 19:21:18,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310761869] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:18,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:18,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 19:21:18,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108245933] [2021-11-25 19:21:18,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:18,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:21:18,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:18,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:21:18,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:21:18,412 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-25 19:21:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:20,161 INFO L93 Difference]: Finished difference Result 15696 states and 52460 transitions. [2021-11-25 19:21:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 19:21:20,162 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-25 19:21:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:20,203 INFO L225 Difference]: With dead ends: 15696 [2021-11-25 19:21:20,203 INFO L226 Difference]: Without dead ends: 15696 [2021-11-25 19:21:20,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:21:20,204 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 457 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:20,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 78 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:21:20,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15696 states. [2021-11-25 19:21:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15696 to 8868. [2021-11-25 19:21:20,436 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-25 19:21:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8868 states to 8868 states and 30081 transitions. [2021-11-25 19:21:20,462 INFO L78 Accepts]: Start accepts. Automaton has 8868 states and 30081 transitions. Word has length 30 [2021-11-25 19:21:20,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:20,463 INFO L470 AbstractCegarLoop]: Abstraction has 8868 states and 30081 transitions. [2021-11-25 19:21:20,463 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-25 19:21:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 8868 states and 30081 transitions. [2021-11-25 19:21:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:21:20,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:20,474 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-25 19:21:20,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-25 19:21:20,474 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:21:20,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash 335133258, now seen corresponding path program 4 times [2021-11-25 19:21:20,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:20,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837487923] [2021-11-25 19:21:20,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:20,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:20,739 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-25 19:21:20,739 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:20,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837487923] [2021-11-25 19:21:20,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837487923] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:20,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:20,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 19:21:20,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982711673] [2021-11-25 19:21:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:20,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:21:20,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:20,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:21:20,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:21:20,741 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-25 19:21:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:22,953 INFO L93 Difference]: Finished difference Result 16296 states and 54962 transitions. [2021-11-25 19:21:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:21:22,954 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-25 19:21:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:22,997 INFO L225 Difference]: With dead ends: 16296 [2021-11-25 19:21:22,998 INFO L226 Difference]: Without dead ends: 16296 [2021-11-25 19:21:22,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2021-11-25 19:21:22,998 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 452 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:22,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 114 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:21:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16296 states. [2021-11-25 19:21:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16296 to 8016. [2021-11-25 19:21:23,203 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-25 19:21:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8016 states to 8016 states and 27358 transitions. [2021-11-25 19:21:23,228 INFO L78 Accepts]: Start accepts. Automaton has 8016 states and 27358 transitions. Word has length 30 [2021-11-25 19:21:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:23,228 INFO L470 AbstractCegarLoop]: Abstraction has 8016 states and 27358 transitions. [2021-11-25 19:21:23,229 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-25 19:21:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 8016 states and 27358 transitions. [2021-11-25 19:21:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:21:23,241 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:23,241 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-25 19:21:23,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-25 19:21:23,242 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:21:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 847172721, now seen corresponding path program 1 times [2021-11-25 19:21:23,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:23,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106682867] [2021-11-25 19:21:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:23,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:23,800 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-25 19:21:23,800 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:23,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106682867] [2021-11-25 19:21:23,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106682867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:23,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:23,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:21:23,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4494640] [2021-11-25 19:21:23,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:23,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:21:23,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:23,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:21:23,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:21:23,801 INFO L87 Difference]: Start difference. First operand 8016 states and 27358 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-25 19:21:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:33,398 INFO L93 Difference]: Finished difference Result 9330 states and 31396 transitions. [2021-11-25 19:21:33,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-11-25 19:21:33,399 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-25 19:21:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:33,420 INFO L225 Difference]: With dead ends: 9330 [2021-11-25 19:21:33,421 INFO L226 Difference]: Without dead ends: 9262 [2021-11-25 19:21:33,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2043, Invalid=7269, Unknown=0, NotChecked=0, Total=9312 [2021-11-25 19:21:33,424 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 312 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 3850 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:33,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 190 Invalid, 3956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3850 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-25 19:21:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9262 states. [2021-11-25 19:21:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9262 to 8656. [2021-11-25 19:21:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8656 states, 8652 states have (on average 3.388580674988442) internal successors, (29318), 8655 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-25 19:21:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8656 states to 8656 states and 29318 transitions. [2021-11-25 19:21:33,602 INFO L78 Accepts]: Start accepts. Automaton has 8656 states and 29318 transitions. Word has length 31 [2021-11-25 19:21:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:33,603 INFO L470 AbstractCegarLoop]: Abstraction has 8656 states and 29318 transitions. [2021-11-25 19:21:33,603 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-25 19:21:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 8656 states and 29318 transitions. [2021-11-25 19:21:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:21:33,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:33,613 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-25 19:21:33,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-25 19:21:33,613 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:21:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash 542321165, now seen corresponding path program 1 times [2021-11-25 19:21:33,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:33,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929962317] [2021-11-25 19:21:33,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:33,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:34,329 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-25 19:21:34,330 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:34,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929962317] [2021-11-25 19:21:34,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929962317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:34,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:34,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:21:34,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686362429] [2021-11-25 19:21:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:34,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:21:34,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:34,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:21:34,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:21:34,331 INFO L87 Difference]: Start difference. First operand 8656 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-25 19:21:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:36,709 INFO L93 Difference]: Finished difference Result 10144 states and 34147 transitions. [2021-11-25 19:21:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 19:21:36,709 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-25 19:21:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:36,732 INFO L225 Difference]: With dead ends: 10144 [2021-11-25 19:21:36,732 INFO L226 Difference]: Without dead ends: 10144 [2021-11-25 19:21:36,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 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-25 19:21:36,733 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 316 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 2826 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:36,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 69 Invalid, 2847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2826 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 19:21:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10144 states. [2021-11-25 19:21:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10144 to 10038. [2021-11-25 19:21:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10038 states, 10034 states have (on average 3.374925254135938) internal successors, (33864), 10037 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-25 19:21:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10038 states to 10038 states and 33864 transitions. [2021-11-25 19:21:36,942 INFO L78 Accepts]: Start accepts. Automaton has 10038 states and 33864 transitions. Word has length 31 [2021-11-25 19:21:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:36,943 INFO L470 AbstractCegarLoop]: Abstraction has 10038 states and 33864 transitions. [2021-11-25 19:21:36,943 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-25 19:21:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 10038 states and 33864 transitions. [2021-11-25 19:21:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:21:36,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:36,954 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-25 19:21:36,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-25 19:21:36,954 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:21:36,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:36,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1190522793, now seen corresponding path program 1 times [2021-11-25 19:21:36,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:36,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299972661] [2021-11-25 19:21:36,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:36,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:37,779 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-25 19:21:37,780 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:37,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299972661] [2021-11-25 19:21:37,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299972661] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:37,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:37,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 19:21:37,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830655474] [2021-11-25 19:21:37,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:37,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:21:37,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:21:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:21:37,782 INFO L87 Difference]: Start difference. First operand 10038 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-25 19:21:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:40,968 INFO L93 Difference]: Finished difference Result 11106 states and 37393 transitions. [2021-11-25 19:21:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:21:40,969 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-25 19:21:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:40,999 INFO L225 Difference]: With dead ends: 11106 [2021-11-25 19:21:40,999 INFO L226 Difference]: Without dead ends: 11106 [2021-11-25 19:21:41,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-11-25 19:21:41,000 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 368 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 3444 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:41,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 86 Invalid, 3475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3444 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 19:21:41,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11106 states. [2021-11-25 19:21:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11106 to 10756. [2021-11-25 19:21:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10756 states, 10752 states have (on average 3.374720982142857) internal successors, (36285), 10755 states have internal predecessors, (36285), 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-25 19:21:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10756 states to 10756 states and 36285 transitions. [2021-11-25 19:21:41,285 INFO L78 Accepts]: Start accepts. Automaton has 10756 states and 36285 transitions. Word has length 31 [2021-11-25 19:21:41,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:41,285 INFO L470 AbstractCegarLoop]: Abstraction has 10756 states and 36285 transitions. [2021-11-25 19:21:41,285 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-25 19:21:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 10756 states and 36285 transitions. [2021-11-25 19:21:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:21:41,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:41,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, 1, 1, 1, 1] [2021-11-25 19:21:41,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-25 19:21:41,302 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-25 19:21:41,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:41,302 INFO L85 PathProgramCache]: Analyzing trace with hash -955509683, now seen corresponding path program 2 times [2021-11-25 19:21:41,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:41,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703290633] [2021-11-25 19:21:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:41,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:41,915 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-25 19:21:41,915 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:41,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703290633] [2021-11-25 19:21:41,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703290633] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:41,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:41,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:21:41,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16233823] [2021-11-25 19:21:41,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:41,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:21:41,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:41,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:21:41,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:21:41,916 INFO L87 Difference]: Start difference. First operand 10756 states and 36285 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-25 19:21:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:52,059 INFO L93 Difference]: Finished difference Result 13231 states and 43871 transitions. [2021-11-25 19:21:52,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-25 19:21:52,060 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-25 19:21:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:52,093 INFO L225 Difference]: With dead ends: 13231 [2021-11-25 19:21:52,093 INFO L226 Difference]: Without dead ends: 13163 [2021-11-25 19:21:52,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1909 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2023, Invalid=6533, Unknown=0, NotChecked=0, Total=8556 [2021-11-25 19:21:52,097 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 346 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 5415 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 5500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 5415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:52,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 209 Invalid, 5500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 5415 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-25 19:21:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2021-11-25 19:21:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 11266. [2021-11-25 19:21:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11266 states, 11262 states have (on average 3.361303498490499) internal successors, (37855), 11265 states have internal predecessors, (37855), 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-25 19:21:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11266 states to 11266 states and 37855 transitions. [2021-11-25 19:21:52,443 INFO L78 Accepts]: Start accepts. Automaton has 11266 states and 37855 transitions. Word has length 31 [2021-11-25 19:21:52,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:52,443 INFO L470 AbstractCegarLoop]: Abstraction has 11266 states and 37855 transitions. [2021-11-25 19:21:52,443 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-25 19:21:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand 11266 states and 37855 transitions. [2021-11-25 19:21:52,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:21:52,456 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:52,456 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-25 19:21:52,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-25 19:21:52,456 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:21:52,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:52,457 INFO L85 PathProgramCache]: Analyzing trace with hash -361441105, now seen corresponding path program 2 times [2021-11-25 19:21:52,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:52,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429220097] [2021-11-25 19:21:52,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:52,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:53,283 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-25 19:21:53,283 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:53,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429220097] [2021-11-25 19:21:53,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429220097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:53,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:53,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:21:53,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361509702] [2021-11-25 19:21:53,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:53,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:21:53,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:53,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:21:53,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:21:53,286 INFO L87 Difference]: Start difference. First operand 11266 states and 37855 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-25 19:21:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:56,167 INFO L93 Difference]: Finished difference Result 12634 states and 42324 transitions. [2021-11-25 19:21:56,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 19:21:56,167 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-25 19:21:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:56,198 INFO L225 Difference]: With dead ends: 12634 [2021-11-25 19:21:56,199 INFO L226 Difference]: Without dead ends: 12634 [2021-11-25 19:21:56,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:21:56,200 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 319 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 3425 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:56,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 90 Invalid, 3448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3425 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 19:21:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12634 states. [2021-11-25 19:21:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12634 to 11096. [2021-11-25 19:21:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11096 states, 11092 states have (on average 3.3650378651280204) internal successors, (37325), 11095 states have internal predecessors, (37325), 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-25 19:21:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11096 states to 11096 states and 37325 transitions. [2021-11-25 19:21:56,443 INFO L78 Accepts]: Start accepts. Automaton has 11096 states and 37325 transitions. Word has length 31 [2021-11-25 19:21:56,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:56,443 INFO L470 AbstractCegarLoop]: Abstraction has 11096 states and 37325 transitions. [2021-11-25 19:21:56,443 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-25 19:21:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 11096 states and 37325 transitions. [2021-11-25 19:21:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:21:56,457 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:56,457 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-25 19:21:56,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-25 19:21:56,457 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:21:56,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1112527675, now seen corresponding path program 3 times [2021-11-25 19:21:56,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:21:56,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324950861] [2021-11-25 19:21:56,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:56,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:21:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:57,253 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-25 19:21:57,253 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:21:57,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324950861] [2021-11-25 19:21:57,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324950861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:21:57,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:21:57,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-25 19:21:57,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517496283] [2021-11-25 19:21:57,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:21:57,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:21:57,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:21:57,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:21:57,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:21:57,255 INFO L87 Difference]: Start difference. First operand 11096 states and 37325 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-25 19:22:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:22:08,297 INFO L93 Difference]: Finished difference Result 13077 states and 43409 transitions. [2021-11-25 19:22:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-11-25 19:22:08,298 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-25 19:22:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:22:08,330 INFO L225 Difference]: With dead ends: 13077 [2021-11-25 19:22:08,330 INFO L226 Difference]: Without dead ends: 13009 [2021-11-25 19:22:08,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1847, Invalid=5985, Unknown=0, NotChecked=0, Total=7832 [2021-11-25 19:22:08,333 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 365 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 6464 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 6571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 6464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:22:08,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 236 Invalid, 6571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 6464 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2021-11-25 19:22:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13009 states. [2021-11-25 19:22:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13009 to 11426. [2021-11-25 19:22:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11426 states, 11422 states have (on average 3.3562423393451235) internal successors, (38335), 11425 states have internal predecessors, (38335), 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-25 19:22:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11426 states to 11426 states and 38335 transitions. [2021-11-25 19:22:08,573 INFO L78 Accepts]: Start accepts. Automaton has 11426 states and 38335 transitions. Word has length 31 [2021-11-25 19:22:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:22:08,573 INFO L470 AbstractCegarLoop]: Abstraction has 11426 states and 38335 transitions. [2021-11-25 19:22:08,573 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-25 19:22:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 11426 states and 38335 transitions. [2021-11-25 19:22:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:22:08,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:22:08,586 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-25 19:22:08,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-25 19:22:08,587 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:22:08,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:22:08,587 INFO L85 PathProgramCache]: Analyzing trace with hash -518459097, now seen corresponding path program 3 times [2021-11-25 19:22:08,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:22:08,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85118227] [2021-11-25 19:22:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:22:08,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:22:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:22:09,378 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-25 19:22:09,378 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:22:09,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85118227] [2021-11-25 19:22:09,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85118227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:22:09,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:22:09,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 19:22:09,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229738641] [2021-11-25 19:22:09,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:22:09,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:22:09,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:22:09,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:22:09,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:22:09,379 INFO L87 Difference]: Start difference. First operand 11426 states and 38335 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-25 19:22:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:22:12,137 INFO L93 Difference]: Finished difference Result 12644 states and 42354 transitions. [2021-11-25 19:22:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 19:22:12,138 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-25 19:22:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:22:12,169 INFO L225 Difference]: With dead ends: 12644 [2021-11-25 19:22:12,169 INFO L226 Difference]: Without dead ends: 12644 [2021-11-25 19:22:12,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2021-11-25 19:22:12,170 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 308 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3392 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:22:12,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 93 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3392 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 19:22:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12644 states. [2021-11-25 19:22:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12644 to 10916. [2021-11-25 19:22:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10916 states, 10912 states have (on average 3.371059384164223) internal successors, (36785), 10915 states have internal predecessors, (36785), 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-25 19:22:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10916 states to 10916 states and 36785 transitions. [2021-11-25 19:22:12,425 INFO L78 Accepts]: Start accepts. Automaton has 10916 states and 36785 transitions. Word has length 31 [2021-11-25 19:22:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:22:12,426 INFO L470 AbstractCegarLoop]: Abstraction has 10916 states and 36785 transitions. [2021-11-25 19:22:12,426 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-25 19:22:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 10916 states and 36785 transitions. [2021-11-25 19:22:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:22:12,444 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:22:12,444 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-25 19:22:12,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-25 19:22:12,445 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:22:12,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:22:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2014749307, now seen corresponding path program 4 times [2021-11-25 19:22:12,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:22:12,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465535655] [2021-11-25 19:22:12,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:22:12,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:22:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:22:13,054 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-25 19:22:13,055 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:22:13,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465535655] [2021-11-25 19:22:13,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465535655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:22:13,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:22:13,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:22:13,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680100826] [2021-11-25 19:22:13,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:22:13,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:22:13,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:22:13,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:22:13,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:22:13,056 INFO L87 Difference]: Start difference. First operand 10916 states and 36785 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-25 19:22:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:22:21,161 INFO L93 Difference]: Finished difference Result 12399 states and 41353 transitions. [2021-11-25 19:22:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-11-25 19:22:21,162 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-25 19:22:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:22:21,203 INFO L225 Difference]: With dead ends: 12399 [2021-11-25 19:22:21,203 INFO L226 Difference]: Without dead ends: 12327 [2021-11-25 19:22:21,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1398, Invalid=5082, Unknown=0, NotChecked=0, Total=6480 [2021-11-25 19:22:21,205 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 373 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 4091 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 4091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:22:21,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 142 Invalid, 4192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 4091 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-25 19:22:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12327 states. [2021-11-25 19:22:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12327 to 11066. [2021-11-25 19:22:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11066 states, 11062 states have (on average 3.367835834387995) internal successors, (37255), 11065 states have internal predecessors, (37255), 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-25 19:22:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 37255 transitions. [2021-11-25 19:22:21,447 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 37255 transitions. Word has length 31 [2021-11-25 19:22:21,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:22:21,447 INFO L470 AbstractCegarLoop]: Abstraction has 11066 states and 37255 transitions. [2021-11-25 19:22:21,447 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-25 19:22:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 37255 transitions. [2021-11-25 19:22:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:22:21,460 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:22:21,460 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-25 19:22:21,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-25 19:22:21,460 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:22:21,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:22:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1686149411, now seen corresponding path program 4 times [2021-11-25 19:22:21,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:22:21,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96167576] [2021-11-25 19:22:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:22:21,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:22:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:22:22,092 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-25 19:22:22,093 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:22:22,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96167576] [2021-11-25 19:22:22,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96167576] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:22:22,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:22:22,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:22:22,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473519581] [2021-11-25 19:22:22,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:22:22,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:22:22,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:22:22,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:22:22,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:22:22,094 INFO L87 Difference]: Start difference. First operand 11066 states and 37255 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-25 19:22:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:22:24,457 INFO L93 Difference]: Finished difference Result 12134 states and 40784 transitions. [2021-11-25 19:22:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 19:22:24,458 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-25 19:22:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:22:24,576 INFO L225 Difference]: With dead ends: 12134 [2021-11-25 19:22:24,576 INFO L226 Difference]: Without dead ends: 12134 [2021-11-25 19:22:24,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 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-25 19:22:24,577 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 322 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:22:24,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 80 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 19:22:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12134 states. [2021-11-25 19:22:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12134 to 10746. [2021-11-25 19:22:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10746 states, 10742 states have (on average 3.3732079687209087) internal successors, (36235), 10745 states have internal predecessors, (36235), 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-25 19:22:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 36235 transitions. [2021-11-25 19:22:24,798 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 36235 transitions. Word has length 31 [2021-11-25 19:22:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:22:24,798 INFO L470 AbstractCegarLoop]: Abstraction has 10746 states and 36235 transitions. [2021-11-25 19:22:24,798 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-25 19:22:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 36235 transitions. [2021-11-25 19:22:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:22:24,811 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:22:24,811 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-25 19:22:24,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-25 19:22:24,812 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:22:24,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:22:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash 900882487, now seen corresponding path program 5 times [2021-11-25 19:22:24,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:22:24,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538942315] [2021-11-25 19:22:24,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:22:24,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:22:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:22:25,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-25 19:22:25,495 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:22:25,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538942315] [2021-11-25 19:22:25,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538942315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:22:25,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:22:25,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:22:25,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427588476] [2021-11-25 19:22:25,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:22:25,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:22:25,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:22:25,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:22:25,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:22:25,497 INFO L87 Difference]: Start difference. First operand 10746 states and 36235 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-25 19:22:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:22:41,982 INFO L93 Difference]: Finished difference Result 12965 states and 42993 transitions. [2021-11-25 19:22:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-11-25 19:22:41,982 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-25 19:22:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:22:42,013 INFO L225 Difference]: With dead ends: 12965 [2021-11-25 19:22:42,013 INFO L226 Difference]: Without dead ends: 12877 [2021-11-25 19:22:42,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4055 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=3100, Invalid=11906, Unknown=0, NotChecked=0, Total=15006 [2021-11-25 19:22:42,015 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 403 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 5708 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 5812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 5708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:22:42,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 259 Invalid, 5812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 5708 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2021-11-25 19:22:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2021-11-25 19:22:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 10876. [2021-11-25 19:22:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10876 states, 10872 states have (on average 3.3705849889624724) internal successors, (36645), 10875 states have internal predecessors, (36645), 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-25 19:22:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10876 states to 10876 states and 36645 transitions. [2021-11-25 19:22:42,255 INFO L78 Accepts]: Start accepts. Automaton has 10876 states and 36645 transitions. Word has length 31 [2021-11-25 19:22:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:22:42,255 INFO L470 AbstractCegarLoop]: Abstraction has 10876 states and 36645 transitions. [2021-11-25 19:22:42,256 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-25 19:22:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 10876 states and 36645 transitions. [2021-11-25 19:22:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:22:42,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:22:42,269 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-25 19:22:42,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-25 19:22:42,269 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-25 19:22:42,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:22:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -44988815, now seen corresponding path program 6 times [2021-11-25 19:22:42,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:22:42,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678723343] [2021-11-25 19:22:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:22:42,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:22:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:22:42,843 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-25 19:22:42,843 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:22:42,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678723343] [2021-11-25 19:22:42,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678723343] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:22:42,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:22:42,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:22:42,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979217364] [2021-11-25 19:22:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:22:42,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:22:42,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:22:42,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:22:42,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:22:42,844 INFO L87 Difference]: Start difference. First operand 10876 states and 36645 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-25 19:22:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:22:50,429 INFO L93 Difference]: Finished difference Result 12657 states and 42127 transitions. [2021-11-25 19:22:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-11-25 19:22:50,430 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-25 19:22:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:22:50,460 INFO L225 Difference]: With dead ends: 12657 [2021-11-25 19:22:50,460 INFO L226 Difference]: Without dead ends: 12585 [2021-11-25 19:22:50,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1453, Invalid=5353, Unknown=0, NotChecked=0, Total=6806 [2021-11-25 19:22:50,461 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 451 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 3799 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 3916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:22:50,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 139 Invalid, 3916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3799 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-25 19:22:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12585 states. [2021-11-25 19:22:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12585 to 10877. [2021-11-25 19:22:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10877 states, 10873 states have (on average 3.3705509059137313) internal successors, (36648), 10876 states have internal predecessors, (36648), 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-25 19:22:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10877 states to 10877 states and 36648 transitions. [2021-11-25 19:22:50,699 INFO L78 Accepts]: Start accepts. Automaton has 10877 states and 36648 transitions. Word has length 31 [2021-11-25 19:22:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:22:50,699 INFO L470 AbstractCegarLoop]: Abstraction has 10877 states and 36648 transitions. [2021-11-25 19:22:50,700 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-25 19:22:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 10877 states and 36648 transitions. [2021-11-25 19:22:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:22:50,712 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:22:50,712 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-25 19:22:50,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-25 19:22:50,712 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:22:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:22:50,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1605977919, now seen corresponding path program 7 times [2021-11-25 19:22:50,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:22:50,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755690280] [2021-11-25 19:22:50,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:22:50,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:22:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:22:51,245 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-25 19:22:51,245 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:22:51,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755690280] [2021-11-25 19:22:51,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755690280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:22:51,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:22:51,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:22:51,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393884474] [2021-11-25 19:22:51,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:22:51,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:22:51,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:22:51,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:22:51,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:22:51,246 INFO L87 Difference]: Start difference. First operand 10877 states and 36648 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-25 19:23:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:23:06,942 INFO L93 Difference]: Finished difference Result 13032 states and 43194 transitions. [2021-11-25 19:23:06,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2021-11-25 19:23:06,943 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-25 19:23:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:23:06,974 INFO L225 Difference]: With dead ends: 13032 [2021-11-25 19:23:06,974 INFO L226 Difference]: Without dead ends: 12944 [2021-11-25 19:23:06,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3553, Invalid=14003, Unknown=0, NotChecked=0, Total=17556 [2021-11-25 19:23:06,977 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 366 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 8107 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 8198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 8107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:23:06,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 356 Invalid, 8198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 8107 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2021-11-25 19:23:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2021-11-25 19:23:07,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 10776. [2021-11-25 19:23:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10776 states, 10772 states have (on average 3.3703119197920537) internal successors, (36305), 10775 states have internal predecessors, (36305), 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-25 19:23:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10776 states to 10776 states and 36305 transitions. [2021-11-25 19:23:07,211 INFO L78 Accepts]: Start accepts. Automaton has 10776 states and 36305 transitions. Word has length 31 [2021-11-25 19:23:07,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:23:07,212 INFO L470 AbstractCegarLoop]: Abstraction has 10776 states and 36305 transitions. [2021-11-25 19:23:07,212 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-25 19:23:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 10776 states and 36305 transitions. [2021-11-25 19:23:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:23:07,225 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:23:07,225 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-25 19:23:07,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-25 19:23:07,225 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-25 19:23:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:23:07,226 INFO L85 PathProgramCache]: Analyzing trace with hash 259335471, now seen corresponding path program 8 times [2021-11-25 19:23:07,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:23:07,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450084680] [2021-11-25 19:23:07,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:23:07,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:23:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:23:07,882 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-25 19:23:07,883 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:23:07,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450084680] [2021-11-25 19:23:07,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450084680] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:23:07,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:23:07,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:23:07,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546986473] [2021-11-25 19:23:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:23:07,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:23:07,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:23:07,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:23:07,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:23:07,884 INFO L87 Difference]: Start difference. First operand 10776 states and 36305 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-25 19:23:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:23:25,598 INFO L93 Difference]: Finished difference Result 12536 states and 41684 transitions. [2021-11-25 19:23:25,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2021-11-25 19:23:25,599 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-25 19:23:25,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:23:25,632 INFO L225 Difference]: With dead ends: 12536 [2021-11-25 19:23:25,632 INFO L226 Difference]: Without dead ends: 12448 [2021-11-25 19:23:25,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5380 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=4002, Invalid=16304, Unknown=0, NotChecked=0, Total=20306 [2021-11-25 19:23:25,635 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 380 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 7729 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 7825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 7729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:23:25,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 368 Invalid, 7825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 7729 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2021-11-25 19:23:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12448 states. [2021-11-25 19:23:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12448 to 10576. [2021-11-25 19:23:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10576 states, 10572 states have (on average 3.377317442300416) internal successors, (35705), 10575 states have internal predecessors, (35705), 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-25 19:23:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10576 states to 10576 states and 35705 transitions. [2021-11-25 19:23:25,878 INFO L78 Accepts]: Start accepts. Automaton has 10576 states and 35705 transitions. Word has length 31 [2021-11-25 19:23:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:23:25,878 INFO L470 AbstractCegarLoop]: Abstraction has 10576 states and 35705 transitions. [2021-11-25 19:23:25,878 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-25 19:23:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 10576 states and 35705 transitions. [2021-11-25 19:23:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:23:25,892 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:23:25,892 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-25 19:23:25,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-25 19:23:25,892 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-25 19:23:25,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:23:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2035111155, now seen corresponding path program 9 times [2021-11-25 19:23:25,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:23:25,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945505173] [2021-11-25 19:23:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:23:25,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:23:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:23:26,522 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-25 19:23:26,522 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:23:26,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945505173] [2021-11-25 19:23:26,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945505173] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:23:26,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:23:26,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:23:26,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403762024] [2021-11-25 19:23:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:23:26,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:23:26,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:23:26,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:23:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:23:26,524 INFO L87 Difference]: Start difference. First operand 10576 states and 35705 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-25 19:23:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:23:43,445 INFO L93 Difference]: Finished difference Result 12006 states and 40002 transitions. [2021-11-25 19:23:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-11-25 19:23:43,445 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-25 19:23:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:23:43,476 INFO L225 Difference]: With dead ends: 12006 [2021-11-25 19:23:43,476 INFO L226 Difference]: Without dead ends: 11906 [2021-11-25 19:23:43,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6168 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=3985, Invalid=17771, Unknown=0, NotChecked=0, Total=21756 [2021-11-25 19:23:43,478 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 432 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 8189 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 8293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 8189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:23:43,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 442 Invalid, 8293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 8189 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2021-11-25 19:23:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11906 states. [2021-11-25 19:23:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11906 to 10520. [2021-11-25 19:23:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10520 states, 10516 states have (on average 3.3713389121338913) internal successors, (35453), 10519 states have internal predecessors, (35453), 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-25 19:23:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10520 states to 10520 states and 35453 transitions. [2021-11-25 19:23:43,717 INFO L78 Accepts]: Start accepts. Automaton has 10520 states and 35453 transitions. Word has length 31 [2021-11-25 19:23:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:23:43,718 INFO L470 AbstractCegarLoop]: Abstraction has 10520 states and 35453 transitions. [2021-11-25 19:23:43,718 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-25 19:23:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 10520 states and 35453 transitions. [2021-11-25 19:23:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:23:43,732 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:23:43,732 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-25 19:23:43,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-25 19:23:43,732 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-25 19:23:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:23:43,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1799717511, now seen corresponding path program 10 times [2021-11-25 19:23:43,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:23:43,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758718394] [2021-11-25 19:23:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:23:43,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:23:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:23:44,443 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-25 19:23:44,443 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:23:44,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758718394] [2021-11-25 19:23:44,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758718394] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:23:44,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:23:44,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:23:44,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697255413] [2021-11-25 19:23:44,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:23:44,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:23:44,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:23:44,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:23:44,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:23:44,445 INFO L87 Difference]: Start difference. First operand 10520 states and 35453 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-25 19:23:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:23:52,362 INFO L93 Difference]: Finished difference Result 14308 states and 48064 transitions. [2021-11-25 19:23:52,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-25 19:23:52,363 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-25 19:23:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:23:52,405 INFO L225 Difference]: With dead ends: 14308 [2021-11-25 19:23:52,405 INFO L226 Difference]: Without dead ends: 14308 [2021-11-25 19:23:52,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1018, Invalid=3404, Unknown=0, NotChecked=0, Total=4422 [2021-11-25 19:23:52,406 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 501 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 5535 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 5631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 5535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:23:52,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 305 Invalid, 5631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 5535 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-25 19:23:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14308 states. [2021-11-25 19:23:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14308 to 11386. [2021-11-25 19:23:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11386 states, 11382 states have (on average 3.3613600421718504) internal successors, (38259), 11385 states have internal predecessors, (38259), 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-25 19:23:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 38259 transitions. [2021-11-25 19:23:52,711 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 38259 transitions. Word has length 31 [2021-11-25 19:23:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:23:52,712 INFO L470 AbstractCegarLoop]: Abstraction has 11386 states and 38259 transitions. [2021-11-25 19:23:52,712 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-25 19:23:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 38259 transitions. [2021-11-25 19:23:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:23:52,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:23:52,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, 1, 1, 1, 1, 1, 1] [2021-11-25 19:23:52,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-25 19:23:52,733 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-25 19:23:52,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:23:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash -20372899, now seen corresponding path program 11 times [2021-11-25 19:23:52,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:23:52,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821633816] [2021-11-25 19:23:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:23:52,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:23:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:23:53,760 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-25 19:23:53,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:23:53,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821633816] [2021-11-25 19:23:53,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821633816] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:23:53,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:23:53,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:23:53,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996436450] [2021-11-25 19:23:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:23:53,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:23:53,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:23:53,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:23:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:23:53,762 INFO L87 Difference]: Start difference. First operand 11386 states and 38259 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-25 19:24:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:24:04,062 INFO L93 Difference]: Finished difference Result 13367 states and 44316 transitions. [2021-11-25 19:24:04,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-11-25 19:24:04,063 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-25 19:24:04,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:24:04,097 INFO L225 Difference]: With dead ends: 13367 [2021-11-25 19:24:04,097 INFO L226 Difference]: Without dead ends: 13283 [2021-11-25 19:24:04,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1625, Invalid=5181, Unknown=0, NotChecked=0, Total=6806 [2021-11-25 19:24:04,098 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 326 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 4886 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 4945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:24:04,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 188 Invalid, 4945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4886 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-11-25 19:24:04,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13283 states. [2021-11-25 19:24:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13283 to 11453. [2021-11-25 19:24:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11453 states, 11449 states have (on average 3.359245348938772) internal successors, (38460), 11452 states have internal predecessors, (38460), 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-25 19:24:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11453 states to 11453 states and 38460 transitions. [2021-11-25 19:24:04,352 INFO L78 Accepts]: Start accepts. Automaton has 11453 states and 38460 transitions. Word has length 31 [2021-11-25 19:24:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:24:04,352 INFO L470 AbstractCegarLoop]: Abstraction has 11453 states and 38460 transitions. [2021-11-25 19:24:04,352 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-25 19:24:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 11453 states and 38460 transitions. [2021-11-25 19:24:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:24:04,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:24:04,366 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-25 19:24:04,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-25 19:24:04,366 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-25 19:24:04,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:24:04,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1399768541, now seen corresponding path program 12 times [2021-11-25 19:24:04,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:24:04,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662202167] [2021-11-25 19:24:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:24:04,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:24:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:24:05,270 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-25 19:24:05,270 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:24:05,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662202167] [2021-11-25 19:24:05,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662202167] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:24:05,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:24:05,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:24:05,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191477367] [2021-11-25 19:24:05,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:24:05,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:24:05,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:24:05,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:24:05,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:24:05,271 INFO L87 Difference]: Start difference. First operand 11453 states and 38460 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-25 19:24:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:24:15,704 INFO L93 Difference]: Finished difference Result 13401 states and 44420 transitions. [2021-11-25 19:24:15,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-11-25 19:24:15,705 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-25 19:24:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:24:15,742 INFO L225 Difference]: With dead ends: 13401 [2021-11-25 19:24:15,742 INFO L226 Difference]: Without dead ends: 13333 [2021-11-25 19:24:15,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1585, Invalid=5221, Unknown=0, NotChecked=0, Total=6806 [2021-11-25 19:24:15,743 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 283 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 5389 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 5444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 5389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:24:15,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 211 Invalid, 5444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 5389 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-11-25 19:24:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13333 states. [2021-11-25 19:24:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13333 to 11463. [2021-11-25 19:24:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11463 states, 11459 states have (on average 3.358931843965442) internal successors, (38490), 11462 states have internal predecessors, (38490), 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-25 19:24:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11463 states to 11463 states and 38490 transitions. [2021-11-25 19:24:16,045 INFO L78 Accepts]: Start accepts. Automaton has 11463 states and 38490 transitions. Word has length 31 [2021-11-25 19:24:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:24:16,045 INFO L470 AbstractCegarLoop]: Abstraction has 11463 states and 38490 transitions. [2021-11-25 19:24:16,046 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-25 19:24:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 11463 states and 38490 transitions. [2021-11-25 19:24:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:24:16,061 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:24:16,061 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-25 19:24:16,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-25 19:24:16,062 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-25 19:24:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:24:16,062 INFO L85 PathProgramCache]: Analyzing trace with hash 195862715, now seen corresponding path program 5 times [2021-11-25 19:24:16,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:24:16,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177127309] [2021-11-25 19:24:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:24:16,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:24:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:24:16,796 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-25 19:24:16,796 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:24:16,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177127309] [2021-11-25 19:24:16,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177127309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:24:16,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:24:16,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:24:16,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290853181] [2021-11-25 19:24:16,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:24:16,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:24:16,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:24:16,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:24:16,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:24:16,799 INFO L87 Difference]: Start difference. First operand 11463 states and 38490 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-25 19:24:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:24:19,400 INFO L93 Difference]: Finished difference Result 12079 states and 40431 transitions. [2021-11-25 19:24:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 19:24:19,401 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-25 19:24:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:24:19,429 INFO L225 Difference]: With dead ends: 12079 [2021-11-25 19:24:19,430 INFO L226 Difference]: Without dead ends: 12079 [2021-11-25 19:24:19,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 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-25 19:24:19,430 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 253 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 3604 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 3626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:24:19,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 92 Invalid, 3626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3604 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 19:24:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12079 states. [2021-11-25 19:24:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12079 to 10965. [2021-11-25 19:24:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10965 states, 10961 states have (on average 3.3506979290210746) internal successors, (36727), 10964 states have internal predecessors, (36727), 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-25 19:24:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10965 states to 10965 states and 36727 transitions. [2021-11-25 19:24:19,739 INFO L78 Accepts]: Start accepts. Automaton has 10965 states and 36727 transitions. Word has length 31 [2021-11-25 19:24:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:24:19,739 INFO L470 AbstractCegarLoop]: Abstraction has 10965 states and 36727 transitions. [2021-11-25 19:24:19,739 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-25 19:24:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 10965 states and 36727 transitions. [2021-11-25 19:24:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:24:19,752 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:24:19,753 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-25 19:24:19,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-25 19:24:19,753 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-25 19:24:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:24:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1049571059, now seen corresponding path program 6 times [2021-11-25 19:24:19,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:24:19,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792229175] [2021-11-25 19:24:19,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:24:19,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:24:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:24:20,425 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-25 19:24:20,426 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:24:20,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792229175] [2021-11-25 19:24:20,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792229175] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:24:20,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:24:20,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:24:20,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998131120] [2021-11-25 19:24:20,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:24:20,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:24:20,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:24:20,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:24:20,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:24:20,427 INFO L87 Difference]: Start difference. First operand 10965 states and 36727 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-25 19:24:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:24:23,329 INFO L93 Difference]: Finished difference Result 12038 states and 40274 transitions. [2021-11-25 19:24:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 19:24:23,336 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-25 19:24:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:24:23,369 INFO L225 Difference]: With dead ends: 12038 [2021-11-25 19:24:23,369 INFO L226 Difference]: Without dead ends: 12038 [2021-11-25 19:24:23,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2021-11-25 19:24:23,370 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 293 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 3565 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:24:23,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 93 Invalid, 3592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3565 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 19:24:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12038 states. [2021-11-25 19:24:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12038 to 11413. [2021-11-25 19:24:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11413 states, 11409 states have (on average 3.36839337365238) internal successors, (38430), 11412 states have internal predecessors, (38430), 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-25 19:24:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11413 states to 11413 states and 38430 transitions. [2021-11-25 19:24:23,632 INFO L78 Accepts]: Start accepts. Automaton has 11413 states and 38430 transitions. Word has length 31 [2021-11-25 19:24:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:24:23,632 INFO L470 AbstractCegarLoop]: Abstraction has 11413 states and 38430 transitions. [2021-11-25 19:24:23,632 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-25 19:24:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 11413 states and 38430 transitions. [2021-11-25 19:24:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:24:23,647 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:24:23,647 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-25 19:24:23,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-25 19:24:23,647 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:24:23,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:24:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash 472389485, now seen corresponding path program 13 times [2021-11-25 19:24:23,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:24:23,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029483108] [2021-11-25 19:24:23,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:24:23,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:24:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:24:24,543 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-25 19:24:24,543 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:24:24,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029483108] [2021-11-25 19:24:24,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029483108] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:24:24,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:24:24,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:24:24,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268666059] [2021-11-25 19:24:24,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:24:24,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:24:24,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:24:24,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:24:24,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:24:24,545 INFO L87 Difference]: Start difference. First operand 11413 states and 38430 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-25 19:24:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:24:45,165 INFO L93 Difference]: Finished difference Result 14799 states and 48703 transitions. [2021-11-25 19:24:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2021-11-25 19:24:45,166 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-25 19:24:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:24:45,206 INFO L225 Difference]: With dead ends: 14799 [2021-11-25 19:24:45,206 INFO L226 Difference]: Without dead ends: 14715 [2021-11-25 19:24:45,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=3275, Invalid=12225, Unknown=0, NotChecked=0, Total=15500 [2021-11-25 19:24:45,207 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 309 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 6432 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 6489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 6432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:24:45,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 297 Invalid, 6489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 6432 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2021-11-25 19:24:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14715 states. [2021-11-25 19:24:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14715 to 11421. [2021-11-25 19:24:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11421 states, 11417 states have (on average 3.368135236927389) internal successors, (38454), 11420 states have internal predecessors, (38454), 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-25 19:24:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11421 states to 11421 states and 38454 transitions. [2021-11-25 19:24:45,487 INFO L78 Accepts]: Start accepts. Automaton has 11421 states and 38454 transitions. Word has length 31 [2021-11-25 19:24:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:24:45,488 INFO L470 AbstractCegarLoop]: Abstraction has 11421 states and 38454 transitions. [2021-11-25 19:24:45,488 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-25 19:24:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 11421 states and 38454 transitions. [2021-11-25 19:24:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:24:45,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:24:45,502 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-25 19:24:45,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-25 19:24:45,502 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:24:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:24:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash -907006157, now seen corresponding path program 14 times [2021-11-25 19:24:45,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:24:45,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546964300] [2021-11-25 19:24:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:24:45,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:24:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:24:46,391 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-25 19:24:46,392 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:24:46,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546964300] [2021-11-25 19:24:46,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546964300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:24:46,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:24:46,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:24:46,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320359257] [2021-11-25 19:24:46,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:24:46,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:24:46,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:24:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:24:46,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:24:46,393 INFO L87 Difference]: Start difference. First operand 11421 states and 38454 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-25 19:24:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:24:58,170 INFO L93 Difference]: Finished difference Result 14437 states and 47619 transitions. [2021-11-25 19:24:58,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-11-25 19:24:58,171 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-25 19:24:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:24:58,209 INFO L225 Difference]: With dead ends: 14437 [2021-11-25 19:24:58,209 INFO L226 Difference]: Without dead ends: 14369 [2021-11-25 19:24:58,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1603 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1746, Invalid=5910, Unknown=0, NotChecked=0, Total=7656 [2021-11-25 19:24:58,210 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 302 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 4933 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 4996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:24:58,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 203 Invalid, 4996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4933 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-11-25 19:24:58,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14369 states. [2021-11-25 19:24:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14369 to 11416. [2021-11-25 19:24:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11416 states, 11412 states have (on average 3.3682965299684544) internal successors, (38439), 11415 states have internal predecessors, (38439), 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-25 19:24:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 38439 transitions. [2021-11-25 19:24:58,538 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 38439 transitions. Word has length 31 [2021-11-25 19:24:58,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:24:58,538 INFO L470 AbstractCegarLoop]: Abstraction has 11416 states and 38439 transitions. [2021-11-25 19:24:58,538 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-25 19:24:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 38439 transitions. [2021-11-25 19:24:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:24:58,554 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:24:58,554 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-25 19:24:58,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-25 19:24:58,554 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:24:58,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:24:58,555 INFO L85 PathProgramCache]: Analyzing trace with hash 78873297, now seen corresponding path program 15 times [2021-11-25 19:24:58,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:24:58,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901900568] [2021-11-25 19:24:58,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:24:58,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:24:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:25:00,064 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-25 19:25:00,064 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:25:00,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901900568] [2021-11-25 19:25:00,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901900568] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:25:00,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:25:00,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:25:00,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7933496] [2021-11-25 19:25:00,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:25:00,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:25:00,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:25:00,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:25:00,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:25:00,065 INFO L87 Difference]: Start difference. First operand 11416 states and 38439 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-25 19:25:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:25:14,998 INFO L93 Difference]: Finished difference Result 14478 states and 47740 transitions. [2021-11-25 19:25:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-11-25 19:25:14,998 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-25 19:25:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:25:15,037 INFO L225 Difference]: With dead ends: 14478 [2021-11-25 19:25:15,038 INFO L226 Difference]: Without dead ends: 14394 [2021-11-25 19:25:15,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2466 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=2263, Invalid=8243, Unknown=0, NotChecked=0, Total=10506 [2021-11-25 19:25:15,039 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 350 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 5519 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 5585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 5519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:25:15,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 240 Invalid, 5585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 5519 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2021-11-25 19:25:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14394 states. [2021-11-25 19:25:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14394 to 11429. [2021-11-25 19:25:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11429 states, 11425 states have (on average 3.3678774617067835) internal successors, (38478), 11428 states have internal predecessors, (38478), 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-25 19:25:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11429 states to 11429 states and 38478 transitions. [2021-11-25 19:25:15,316 INFO L78 Accepts]: Start accepts. Automaton has 11429 states and 38478 transitions. Word has length 31 [2021-11-25 19:25:15,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:25:15,316 INFO L470 AbstractCegarLoop]: Abstraction has 11429 states and 38478 transitions. [2021-11-25 19:25:15,316 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-25 19:25:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 11429 states and 38478 transitions. [2021-11-25 19:25:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:25:15,332 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:25:15,332 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-25 19:25:15,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-25 19:25:15,332 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:25:15,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:25:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1300522345, now seen corresponding path program 16 times [2021-11-25 19:25:15,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:25:15,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262266754] [2021-11-25 19:25:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:25:15,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:25:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:25:16,404 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-25 19:25:16,405 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:25:16,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262266754] [2021-11-25 19:25:16,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262266754] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:25:16,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:25:16,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-25 19:25:16,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700428697] [2021-11-25 19:25:16,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:25:16,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:25:16,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:25:16,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:25:16,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:25:16,406 INFO L87 Difference]: Start difference. First operand 11429 states and 38478 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-25 19:25:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:25:31,728 INFO L93 Difference]: Finished difference Result 14268 states and 47112 transitions. [2021-11-25 19:25:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-11-25 19:25:31,729 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-25 19:25:31,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:25:31,764 INFO L225 Difference]: With dead ends: 14268 [2021-11-25 19:25:31,764 INFO L226 Difference]: Without dead ends: 14200 [2021-11-25 19:25:31,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1854, Invalid=6336, Unknown=0, NotChecked=0, Total=8190 [2021-11-25 19:25:31,765 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 295 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 5700 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 5766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 5700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:25:31,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 236 Invalid, 5766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 5700 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2021-11-25 19:25:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14200 states. [2021-11-25 19:25:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14200 to 11425. [2021-11-25 19:25:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11425 states, 11421 states have (on average 3.368006304176517) internal successors, (38466), 11424 states have internal predecessors, (38466), 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-25 19:25:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11425 states to 11425 states and 38466 transitions. [2021-11-25 19:25:32,024 INFO L78 Accepts]: Start accepts. Automaton has 11425 states and 38466 transitions. Word has length 31 [2021-11-25 19:25:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:25:32,024 INFO L470 AbstractCegarLoop]: Abstraction has 11425 states and 38466 transitions. [2021-11-25 19:25:32,025 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-25 19:25:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 11425 states and 38466 transitions. [2021-11-25 19:25:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:25:32,038 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:25:32,038 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-25 19:25:32,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-25 19:25:32,039 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:25:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:25:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1118029101, now seen corresponding path program 17 times [2021-11-25 19:25:32,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:25:32,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498420772] [2021-11-25 19:25:32,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:25:32,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:25:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:25:32,746 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-25 19:25:32,747 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:25:32,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498420772] [2021-11-25 19:25:32,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498420772] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:25:32,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:25:32,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:25:32,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399781240] [2021-11-25 19:25:32,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:25:32,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:25:32,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:25:32,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:25:32,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:25:32,748 INFO L87 Difference]: Start difference. First operand 11425 states and 38466 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-25 19:25:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:25:49,653 INFO L93 Difference]: Finished difference Result 14992 states and 49302 transitions. [2021-11-25 19:25:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-11-25 19:25:49,654 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-25 19:25:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:25:49,691 INFO L225 Difference]: With dead ends: 14992 [2021-11-25 19:25:49,691 INFO L226 Difference]: Without dead ends: 14904 [2021-11-25 19:25:49,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3907 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=3019, Invalid=11987, Unknown=0, NotChecked=0, Total=15006 [2021-11-25 19:25:49,693 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 374 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 6562 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 6633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 6562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:25:49,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 293 Invalid, 6633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 6562 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2021-11-25 19:25:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14904 states. [2021-11-25 19:25:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14904 to 11434. [2021-11-25 19:25:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11434 states, 11430 states have (on average 3.367716535433071) internal successors, (38493), 11433 states have internal predecessors, (38493), 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-25 19:25:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11434 states to 11434 states and 38493 transitions. [2021-11-25 19:25:50,089 INFO L78 Accepts]: Start accepts. Automaton has 11434 states and 38493 transitions. Word has length 31 [2021-11-25 19:25:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:25:50,089 INFO L470 AbstractCegarLoop]: Abstraction has 11434 states and 38493 transitions. [2021-11-25 19:25:50,089 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-25 19:25:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 11434 states and 38493 transitions. [2021-11-25 19:25:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:25:50,102 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:25:50,103 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-25 19:25:50,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-25 19:25:50,103 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:25:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:25:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash -551272039, now seen corresponding path program 18 times [2021-11-25 19:25:50,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:25:50,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960709103] [2021-11-25 19:25:50,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:25:50,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:25:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:25:50,955 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-25 19:25:50,955 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:25:50,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960709103] [2021-11-25 19:25:50,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960709103] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:25:50,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:25:50,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-25 19:25:50,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601352587] [2021-11-25 19:25:50,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:25:50,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:25:50,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:25:50,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:25:50,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:25:50,957 INFO L87 Difference]: Start difference. First operand 11434 states and 38493 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-25 19:26:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:26:09,446 INFO L93 Difference]: Finished difference Result 14972 states and 49190 transitions. [2021-11-25 19:26:09,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2021-11-25 19:26:09,446 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-25 19:26:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:26:09,483 INFO L225 Difference]: With dead ends: 14972 [2021-11-25 19:26:09,484 INFO L226 Difference]: Without dead ends: 14856 [2021-11-25 19:26:09,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4139 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=3477, Invalid=13035, Unknown=0, NotChecked=0, Total=16512 [2021-11-25 19:26:09,485 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 366 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 6894 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 6999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 6894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:26:09,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 300 Invalid, 6999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 6894 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2021-11-25 19:26:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14856 states. [2021-11-25 19:26:09,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14856 to 11594. [2021-11-25 19:26:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11594 states, 11590 states have (on average 3.3626402070750645) internal successors, (38973), 11593 states have internal predecessors, (38973), 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-25 19:26:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11594 states to 11594 states and 38973 transitions. [2021-11-25 19:26:09,752 INFO L78 Accepts]: Start accepts. Automaton has 11594 states and 38973 transitions. Word has length 31 [2021-11-25 19:26:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:26:09,753 INFO L470 AbstractCegarLoop]: Abstraction has 11594 states and 38973 transitions. [2021-11-25 19:26:09,753 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-25 19:26:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 11594 states and 38973 transitions. [2021-11-25 19:26:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:26:09,767 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:26:09,767 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-25 19:26:09,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-25 19:26:09,768 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-25 19:26:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:26:09,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1766590801, now seen corresponding path program 19 times [2021-11-25 19:26:09,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:26:09,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9970086] [2021-11-25 19:26:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:26:09,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:26:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:26:10,746 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-25 19:26:10,747 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:26:10,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9970086] [2021-11-25 19:26:10,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9970086] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:26:10,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:26:10,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-25 19:26:10,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465457426] [2021-11-25 19:26:10,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:26:10,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:26:10,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:26:10,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:26:10,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:26:10,749 INFO L87 Difference]: Start difference. First operand 11594 states and 38973 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-25 19:26:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:26:21,815 INFO L93 Difference]: Finished difference Result 15342 states and 50332 transitions. [2021-11-25 19:26:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-25 19:26:21,816 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-25 19:26:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:26:21,855 INFO L225 Difference]: With dead ends: 15342 [2021-11-25 19:26:21,856 INFO L226 Difference]: Without dead ends: 15258 [2021-11-25 19:26:21,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1579, Invalid=4901, Unknown=0, NotChecked=0, Total=6480 [2021-11-25 19:26:21,857 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 320 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 5073 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 5127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 5073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:26:21,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 189 Invalid, 5127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 5073 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2021-11-25 19:26:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15258 states. [2021-11-25 19:26:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15258 to 11603. [2021-11-25 19:26:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11603 states, 11599 states have (on average 3.362358824036555) internal successors, (39000), 11602 states have internal predecessors, (39000), 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-25 19:26:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11603 states to 11603 states and 39000 transitions. [2021-11-25 19:26:22,294 INFO L78 Accepts]: Start accepts. Automaton has 11603 states and 39000 transitions. Word has length 31 [2021-11-25 19:26:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:26:22,294 INFO L470 AbstractCegarLoop]: Abstraction has 11603 states and 39000 transitions. [2021-11-25 19:26:22,295 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-25 19:26:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 11603 states and 39000 transitions. [2021-11-25 19:26:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:26:22,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:26:22,310 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-25 19:26:22,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-25 19:26:22,310 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:26:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:26:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1148980853, now seen corresponding path program 20 times [2021-11-25 19:26:22,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:26:22,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565465401] [2021-11-25 19:26:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:26:22,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:26:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:26:23,166 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-25 19:26:23,166 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:26:23,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565465401] [2021-11-25 19:26:23,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565465401] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:26:23,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:26:23,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 19:26:23,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511863135] [2021-11-25 19:26:23,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:26:23,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:26:23,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:26:23,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:26:23,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:26:23,168 INFO L87 Difference]: Start difference. First operand 11603 states and 39000 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-25 19:26:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:26:27,470 INFO L93 Difference]: Finished difference Result 15444 states and 51390 transitions. [2021-11-25 19:26:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 19:26:27,471 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-25 19:26:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:26:27,514 INFO L225 Difference]: With dead ends: 15444 [2021-11-25 19:26:27,514 INFO L226 Difference]: Without dead ends: 15444 [2021-11-25 19:26:27,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 19:26:27,515 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 353 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 4005 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 4035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:26:27,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 192 Invalid, 4035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4005 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-25 19:26:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15444 states. [2021-11-25 19:26:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15444 to 11809. [2021-11-25 19:26:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11809 states, 11805 states have (on average 3.3645065650148243) internal successors, (39718), 11808 states have internal predecessors, (39718), 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-25 19:26:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11809 states to 11809 states and 39718 transitions. [2021-11-25 19:26:27,821 INFO L78 Accepts]: Start accepts. Automaton has 11809 states and 39718 transitions. Word has length 31 [2021-11-25 19:26:27,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:26:27,821 INFO L470 AbstractCegarLoop]: Abstraction has 11809 states and 39718 transitions. [2021-11-25 19:26:27,821 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-25 19:26:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 11809 states and 39718 transitions. [2021-11-25 19:26:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:26:27,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:26:27,837 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-25 19:26:27,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-25 19:26:27,837 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:26:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:26:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1148980844, now seen corresponding path program 1 times [2021-11-25 19:26:27,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:26:27,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063418621] [2021-11-25 19:26:27,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:26:27,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:26:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:26:28,980 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-25 19:26:28,980 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:26:28,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063418621] [2021-11-25 19:26:28,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063418621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:26:28,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:26:28,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 19:26:28,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456309850] [2021-11-25 19:26:28,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:26:28,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:26:28,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:26:28,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:26:28,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:26:28,981 INFO L87 Difference]: Start difference. First operand 11809 states and 39718 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-25 19:26:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:26:39,431 INFO L93 Difference]: Finished difference Result 15376 states and 50436 transitions. [2021-11-25 19:26:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-25 19:26:39,432 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-25 19:26:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:26:39,470 INFO L225 Difference]: With dead ends: 15376 [2021-11-25 19:26:39,470 INFO L226 Difference]: Without dead ends: 15308 [2021-11-25 19:26:39,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1382, Invalid=4020, Unknown=0, NotChecked=0, Total=5402 [2021-11-25 19:26:39,471 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 310 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 4778 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 4831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:26:39,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 175 Invalid, 4831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4778 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-11-25 19:26:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15308 states. [2021-11-25 19:26:39,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15308 to 11598. [2021-11-25 19:26:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11598 states, 11594 states have (on average 3.362515094014145) internal successors, (38985), 11597 states have internal predecessors, (38985), 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-25 19:26:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11598 states to 11598 states and 38985 transitions. [2021-11-25 19:26:39,754 INFO L78 Accepts]: Start accepts. Automaton has 11598 states and 38985 transitions. Word has length 31 [2021-11-25 19:26:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:26:39,754 INFO L470 AbstractCegarLoop]: Abstraction has 11598 states and 38985 transitions. [2021-11-25 19:26:39,754 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-25 19:26:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 11598 states and 38985 transitions. [2021-11-25 19:26:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:26:39,769 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:26:39,769 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-25 19:26:39,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-25 19:26:39,770 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:26:39,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:26:39,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2134860307, now seen corresponding path program 21 times [2021-11-25 19:26:39,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:26:39,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007701847] [2021-11-25 19:26:39,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:26:39,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:26:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:26:40,566 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-25 19:26:40,567 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:26:40,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007701847] [2021-11-25 19:26:40,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007701847] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:26:40,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:26:40,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:26:40,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393464255] [2021-11-25 19:26:40,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:26:40,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:26:40,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:26:40,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:26:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:26:40,568 INFO L87 Difference]: Start difference. First operand 11598 states and 38985 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-25 19:26:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:26:54,003 INFO L93 Difference]: Finished difference Result 16512 states and 53830 transitions. [2021-11-25 19:26:54,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-11-25 19:26:54,004 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-25 19:26:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:26:54,051 INFO L225 Difference]: With dead ends: 16512 [2021-11-25 19:26:54,051 INFO L226 Difference]: Without dead ends: 16424 [2021-11-25 19:26:54,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2076 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2196, Invalid=7310, Unknown=0, NotChecked=0, Total=9506 [2021-11-25 19:26:54,053 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 357 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 5179 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 5243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 5179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:26:54,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 215 Invalid, 5243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 5179 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2021-11-25 19:26:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16424 states. [2021-11-25 19:26:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16424 to 11607. [2021-11-25 19:26:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11607 states, 11603 states have (on average 3.3622339050245627) internal successors, (39012), 11606 states have internal predecessors, (39012), 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-25 19:26:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 39012 transitions. [2021-11-25 19:26:54,359 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 39012 transitions. Word has length 31 [2021-11-25 19:26:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:26:54,359 INFO L470 AbstractCegarLoop]: Abstraction has 11607 states and 39012 transitions. [2021-11-25 19:26:54,359 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-25 19:26:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 39012 transitions. [2021-11-25 19:26:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:26:54,375 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:26:54,375 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-25 19:26:54,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-25 19:26:54,376 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:26:54,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:26:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash 937957909, now seen corresponding path program 22 times [2021-11-25 19:26:54,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:26:54,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902663387] [2021-11-25 19:26:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:26:54,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:26:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:26:55,651 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-25 19:26:55,651 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:26:55,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902663387] [2021-11-25 19:26:55,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902663387] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:26:55,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:26:55,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:26:55,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537624921] [2021-11-25 19:26:55,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:26:55,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:26:55,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:26:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:26:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:26:55,652 INFO L87 Difference]: Start difference. First operand 11607 states and 39012 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-25 19:27:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:27:14,485 INFO L93 Difference]: Finished difference Result 16915 states and 55071 transitions. [2021-11-25 19:27:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-11-25 19:27:14,486 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-25 19:27:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:27:14,533 INFO L225 Difference]: With dead ends: 16915 [2021-11-25 19:27:14,533 INFO L226 Difference]: Without dead ends: 16827 [2021-11-25 19:27:14,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3752 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=3114, Invalid=11892, Unknown=0, NotChecked=0, Total=15006 [2021-11-25 19:27:14,535 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 436 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 6736 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 6800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 6736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:27:14,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 285 Invalid, 6800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 6736 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2021-11-25 19:27:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16827 states. [2021-11-25 19:27:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16827 to 11616. [2021-11-25 19:27:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11616 states, 11612 states have (on average 3.3619531519118153) internal successors, (39039), 11615 states have internal predecessors, (39039), 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-25 19:27:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11616 states to 11616 states and 39039 transitions. [2021-11-25 19:27:14,834 INFO L78 Accepts]: Start accepts. Automaton has 11616 states and 39039 transitions. Word has length 31 [2021-11-25 19:27:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:27:14,834 INFO L470 AbstractCegarLoop]: Abstraction has 11616 states and 39039 transitions. [2021-11-25 19:27:14,834 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-25 19:27:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 11616 states and 39039 transitions. [2021-11-25 19:27:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:27:14,849 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:27:14,849 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-25 19:27:14,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-25 19:27:14,849 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:27:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:27:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1504714971, now seen corresponding path program 23 times [2021-11-25 19:27:14,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:27:14,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328741355] [2021-11-25 19:27:14,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:27:14,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:27:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:27:15,795 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-25 19:27:15,795 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:27:15,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328741355] [2021-11-25 19:27:15,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328741355] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:27:15,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:27:15,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:27:15,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841435171] [2021-11-25 19:27:15,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:27:15,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:27:15,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:27:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:27:15,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:27:15,797 INFO L87 Difference]: Start difference. First operand 11616 states and 39039 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-25 19:27:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:27:31,895 INFO L93 Difference]: Finished difference Result 17041 states and 55397 transitions. [2021-11-25 19:27:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2021-11-25 19:27:31,896 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-25 19:27:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:27:31,941 INFO L225 Difference]: With dead ends: 17041 [2021-11-25 19:27:31,941 INFO L226 Difference]: Without dead ends: 16925 [2021-11-25 19:27:31,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3808 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=3369, Invalid=12131, Unknown=0, NotChecked=0, Total=15500 [2021-11-25 19:27:31,943 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 365 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 6158 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 6241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 6158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:27:31,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 249 Invalid, 6241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 6158 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2021-11-25 19:27:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16925 states. [2021-11-25 19:27:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16925 to 11595. [2021-11-25 19:27:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11595 states, 11591 states have (on average 3.3626089207143472) internal successors, (38976), 11594 states have internal predecessors, (38976), 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-25 19:27:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11595 states to 11595 states and 38976 transitions. [2021-11-25 19:27:32,265 INFO L78 Accepts]: Start accepts. Automaton has 11595 states and 38976 transitions. Word has length 31 [2021-11-25 19:27:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:27:32,265 INFO L470 AbstractCegarLoop]: Abstraction has 11595 states and 38976 transitions. [2021-11-25 19:27:32,265 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-25 19:27:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 11595 states and 38976 transitions. [2021-11-25 19:27:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:27:32,280 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:27:32,280 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-25 19:27:32,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-25 19:27:32,280 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:27:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:27:32,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1129008413, now seen corresponding path program 24 times [2021-11-25 19:27:32,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:27:32,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895877709] [2021-11-25 19:27:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:27:32,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:27:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:27:33,116 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-25 19:27:33,117 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:27:33,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895877709] [2021-11-25 19:27:33,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895877709] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:27:33,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:27:33,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:27:33,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666522781] [2021-11-25 19:27:33,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:27:33,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:27:33,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:27:33,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:27:33,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:27:33,118 INFO L87 Difference]: Start difference. First operand 11595 states and 38976 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-25 19:27:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:27:41,526 INFO L93 Difference]: Finished difference Result 15125 states and 49669 transitions. [2021-11-25 19:27:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-25 19:27:41,527 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-25 19:27:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:27:41,565 INFO L225 Difference]: With dead ends: 15125 [2021-11-25 19:27:41,565 INFO L226 Difference]: Without dead ends: 15037 [2021-11-25 19:27:41,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1437, Invalid=4415, Unknown=0, NotChecked=0, Total=5852 [2021-11-25 19:27:41,566 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 318 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 4741 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 4798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 4741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:27:41,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 174 Invalid, 4798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 4741 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-11-25 19:27:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15037 states. [2021-11-25 19:27:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15037 to 11607. [2021-11-25 19:27:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11607 states, 11603 states have (on average 3.3622339050245627) internal successors, (39012), 11606 states have internal predecessors, (39012), 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-25 19:27:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 39012 transitions. [2021-11-25 19:27:41,842 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 39012 transitions. Word has length 31 [2021-11-25 19:27:41,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:27:41,842 INFO L470 AbstractCegarLoop]: Abstraction has 11607 states and 39012 transitions. [2021-11-25 19:27:41,842 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-25 19:27:41,842 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 39012 transitions. [2021-11-25 19:27:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:27:41,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:27:41,858 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-25 19:27:41,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-25 19:27:41,858 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:27:41,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:27:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash -67893985, now seen corresponding path program 25 times [2021-11-25 19:27:41,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:27:41,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143777987] [2021-11-25 19:27:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:27:41,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:27:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:27:42,651 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-25 19:27:42,652 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:27:42,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143777987] [2021-11-25 19:27:42,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143777987] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:27:42,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:27:42,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:27:42,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347848296] [2021-11-25 19:27:42,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:27:42,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:27:42,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:27:42,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:27:42,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:27:42,653 INFO L87 Difference]: Start difference. First operand 11607 states and 39012 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-25 19:28:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:28:00,289 INFO L93 Difference]: Finished difference Result 16574 states and 54048 transitions. [2021-11-25 19:28:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-11-25 19:28:00,290 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-25 19:28:00,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:28:00,331 INFO L225 Difference]: With dead ends: 16574 [2021-11-25 19:28:00,331 INFO L226 Difference]: Without dead ends: 16486 [2021-11-25 19:28:00,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3689 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=3165, Invalid=11841, Unknown=0, NotChecked=0, Total=15006 [2021-11-25 19:28:00,333 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 353 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 7834 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 7888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 7834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:28:00,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 332 Invalid, 7888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 7834 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2021-11-25 19:28:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16486 states. [2021-11-25 19:28:00,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16486 to 11616. [2021-11-25 19:28:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11616 states, 11612 states have (on average 3.3619531519118153) internal successors, (39039), 11615 states have internal predecessors, (39039), 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-25 19:28:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11616 states to 11616 states and 39039 transitions. [2021-11-25 19:28:00,716 INFO L78 Accepts]: Start accepts. Automaton has 11616 states and 39039 transitions. Word has length 31 [2021-11-25 19:28:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:28:00,717 INFO L470 AbstractCegarLoop]: Abstraction has 11616 states and 39039 transitions. [2021-11-25 19:28:00,717 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-25 19:28:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 11616 states and 39039 transitions. [2021-11-25 19:28:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:28:00,731 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:28:00,731 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-25 19:28:00,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-11-25 19:28:00,732 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:28:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:28:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash 498863077, now seen corresponding path program 26 times [2021-11-25 19:28:00,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:28:00,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603930828] [2021-11-25 19:28:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:28:00,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:28:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:28:01,615 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-25 19:28:01,615 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:28:01,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603930828] [2021-11-25 19:28:01,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603930828] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:28:01,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:28:01,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:28:01,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821700571] [2021-11-25 19:28:01,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:28:01,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:28:01,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:28:01,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:28:01,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:28:01,617 INFO L87 Difference]: Start difference. First operand 11616 states and 39039 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-25 19:28:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:28:20,290 INFO L93 Difference]: Finished difference Result 16658 states and 54248 transitions. [2021-11-25 19:28:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-11-25 19:28:20,291 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-25 19:28:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:28:20,336 INFO L225 Difference]: With dead ends: 16658 [2021-11-25 19:28:20,336 INFO L226 Difference]: Without dead ends: 16542 [2021-11-25 19:28:20,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3472 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3284, Invalid=11478, Unknown=0, NotChecked=0, Total=14762 [2021-11-25 19:28:20,337 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 333 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 8111 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 8185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 8111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:28:20,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 318 Invalid, 8185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 8111 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2021-11-25 19:28:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16542 states. [2021-11-25 19:28:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16542 to 11598. [2021-11-25 19:28:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11598 states, 11594 states have (on average 3.362515094014145) internal successors, (38985), 11597 states have internal predecessors, (38985), 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-25 19:28:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11598 states to 11598 states and 38985 transitions. [2021-11-25 19:28:20,704 INFO L78 Accepts]: Start accepts. Automaton has 11598 states and 38985 transitions. Word has length 31 [2021-11-25 19:28:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:28:20,705 INFO L470 AbstractCegarLoop]: Abstraction has 11598 states and 38985 transitions. [2021-11-25 19:28:20,705 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-25 19:28:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 11598 states and 38985 transitions. [2021-11-25 19:28:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:28:20,742 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:28:20,742 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-25 19:28:20,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-11-25 19:28:20,742 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:28:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:28:20,743 INFO L85 PathProgramCache]: Analyzing trace with hash 826974319, now seen corresponding path program 27 times [2021-11-25 19:28:20,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:28:20,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752538470] [2021-11-25 19:28:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:28:20,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:28:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:28:21,395 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-25 19:28:21,395 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:28:21,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752538470] [2021-11-25 19:28:21,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752538470] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:28:21,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:28:21,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:28:21,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120268369] [2021-11-25 19:28:21,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:28:21,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:28:21,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:28:21,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:28:21,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:28:21,397 INFO L87 Difference]: Start difference. First operand 11598 states and 38985 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-25 19:28:34,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:28:34,357 INFO L93 Difference]: Finished difference Result 16335 states and 53323 transitions. [2021-11-25 19:28:34,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2021-11-25 19:28:34,357 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-25 19:28:34,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:28:34,407 INFO L225 Difference]: With dead ends: 16335 [2021-11-25 19:28:34,408 INFO L226 Difference]: Without dead ends: 16219 [2021-11-25 19:28:34,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3272 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2840, Invalid=9816, Unknown=0, NotChecked=0, Total=12656 [2021-11-25 19:28:34,409 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 369 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 4862 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 4946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 4862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:28:34,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 198 Invalid, 4946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 4862 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-11-25 19:28:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16219 states. [2021-11-25 19:28:34,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16219 to 11631. [2021-11-25 19:28:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11631 states, 11627 states have (on average 3.363378343510794) internal successors, (39106), 11630 states have internal predecessors, (39106), 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-25 19:28:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11631 states to 11631 states and 39106 transitions. [2021-11-25 19:28:34,726 INFO L78 Accepts]: Start accepts. Automaton has 11631 states and 39106 transitions. Word has length 31 [2021-11-25 19:28:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:28:34,726 INFO L470 AbstractCegarLoop]: Abstraction has 11631 states and 39106 transitions. [2021-11-25 19:28:34,726 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-25 19:28:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 11631 states and 39106 transitions. [2021-11-25 19:28:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:28:34,755 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:28:34,755 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-25 19:28:34,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-11-25 19:28:34,756 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:28:34,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:28:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1725402393, now seen corresponding path program 28 times [2021-11-25 19:28:34,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:28:34,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014160973] [2021-11-25 19:28:34,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:28:34,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:28:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:28:35,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-25 19:28:35,272 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:28:35,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014160973] [2021-11-25 19:28:35,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014160973] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:28:35,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:28:35,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-25 19:28:35,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252986023] [2021-11-25 19:28:35,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:28:35,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:28:35,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:28:35,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:28:35,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:28:35,274 INFO L87 Difference]: Start difference. First operand 11631 states and 39106 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-25 19:28:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:28:54,870 INFO L93 Difference]: Finished difference Result 15796 states and 51662 transitions. [2021-11-25 19:28:54,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-11-25 19:28:54,871 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-25 19:28:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:28:54,917 INFO L225 Difference]: With dead ends: 15796 [2021-11-25 19:28:54,917 INFO L226 Difference]: Without dead ends: 15680 [2021-11-25 19:28:54,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5907 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=4313, Invalid=17739, Unknown=0, NotChecked=0, Total=22052 [2021-11-25 19:28:54,920 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 306 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 7112 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 7201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 7112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:28:54,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 314 Invalid, 7201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 7112 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2021-11-25 19:28:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15680 states. [2021-11-25 19:28:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15680 to 11640. [2021-11-25 19:28:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11640 states, 11636 states have (on average 3.363097284290134) internal successors, (39133), 11639 states have internal predecessors, (39133), 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-25 19:28:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11640 states to 11640 states and 39133 transitions. [2021-11-25 19:28:55,234 INFO L78 Accepts]: Start accepts. Automaton has 11640 states and 39133 transitions. Word has length 31 [2021-11-25 19:28:55,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:28:55,234 INFO L470 AbstractCegarLoop]: Abstraction has 11640 states and 39133 transitions. [2021-11-25 19:28:55,234 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-25 19:28:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 11640 states and 39133 transitions. [2021-11-25 19:28:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:28:55,251 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:28:55,252 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-25 19:28:55,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-11-25 19:28:55,252 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:28:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:28:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash -399578851, now seen corresponding path program 29 times [2021-11-25 19:28:55,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:28:55,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049297597] [2021-11-25 19:28:55,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:28:55,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:28:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:28:55,717 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-25 19:28:55,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:28:55,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049297597] [2021-11-25 19:28:55,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049297597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:28:55,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:28:55,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:28:55,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413048225] [2021-11-25 19:28:55,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:28:55,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:28:55,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:28:55,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:28:55,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:28:55,720 INFO L87 Difference]: Start difference. First operand 11640 states and 39133 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-25 19:29:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:29:13,558 INFO L93 Difference]: Finished difference Result 15198 states and 49896 transitions. [2021-11-25 19:29:13,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2021-11-25 19:29:13,559 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-25 19:29:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:29:13,590 INFO L225 Difference]: With dead ends: 15198 [2021-11-25 19:29:13,590 INFO L226 Difference]: Without dead ends: 15110 [2021-11-25 19:29:13,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5605 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=3869, Invalid=16437, Unknown=0, NotChecked=0, Total=20306 [2021-11-25 19:29:13,592 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 417 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 7994 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 8069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 7994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:29:13,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 376 Invalid, 8069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 7994 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2021-11-25 19:29:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15110 states. [2021-11-25 19:29:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15110 to 11631. [2021-11-25 19:29:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11631 states, 11627 states have (on average 3.363378343510794) internal successors, (39106), 11630 states have internal predecessors, (39106), 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-25 19:29:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11631 states to 11631 states and 39106 transitions. [2021-11-25 19:29:13,854 INFO L78 Accepts]: Start accepts. Automaton has 11631 states and 39106 transitions. Word has length 31 [2021-11-25 19:29:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:29:13,855 INFO L470 AbstractCegarLoop]: Abstraction has 11631 states and 39106 transitions. [2021-11-25 19:29:13,855 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-25 19:29:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 11631 states and 39106 transitions. [2021-11-25 19:29:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:29:13,869 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:29:13,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, 1, 1, 1, 1] [2021-11-25 19:29:13,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-11-25 19:29:13,870 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:29:13,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:29:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash 197104431, now seen corresponding path program 2 times [2021-11-25 19:29:13,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:29:13,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340243203] [2021-11-25 19:29:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:29:13,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:29:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:29:15,080 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-25 19:29:15,080 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:29:15,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340243203] [2021-11-25 19:29:15,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340243203] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:29:15,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:29:15,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 19:29:15,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451250019] [2021-11-25 19:29:15,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:29:15,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:29:15,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:29:15,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:29:15,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:29:15,082 INFO L87 Difference]: Start difference. First operand 11631 states and 39106 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-25 19:29:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:29:18,648 INFO L93 Difference]: Finished difference Result 13119 states and 43915 transitions. [2021-11-25 19:29:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:29:18,648 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-25 19:29:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:29:18,677 INFO L225 Difference]: With dead ends: 13119 [2021-11-25 19:29:18,677 INFO L226 Difference]: Without dead ends: 13119 [2021-11-25 19:29:18,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-11-25 19:29:18,678 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 376 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 3536 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:29:18,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 99 Invalid, 3570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3536 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 19:29:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13119 states. [2021-11-25 19:29:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13119 to 11571. [2021-11-25 19:29:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11571 states, 11567 states have (on average 3.365263248897726) internal successors, (38926), 11570 states have internal predecessors, (38926), 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-25 19:29:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11571 states to 11571 states and 38926 transitions. [2021-11-25 19:29:18,927 INFO L78 Accepts]: Start accepts. Automaton has 11571 states and 38926 transitions. Word has length 31 [2021-11-25 19:29:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:29:18,928 INFO L470 AbstractCegarLoop]: Abstraction has 11571 states and 38926 transitions. [2021-11-25 19:29:18,928 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-25 19:29:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 11571 states and 38926 transitions. [2021-11-25 19:29:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:29:18,943 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:29:18,943 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-25 19:29:18,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-11-25 19:29:18,944 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:29:18,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:29:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1911085605, now seen corresponding path program 30 times [2021-11-25 19:29:18,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:29:18,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071371345] [2021-11-25 19:29:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:29:18,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:29:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:29:19,619 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-25 19:29:19,619 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:29:19,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071371345] [2021-11-25 19:29:19,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071371345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:29:19,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:29:19,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:29:19,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374212770] [2021-11-25 19:29:19,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:29:19,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:29:19,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:29:19,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:29:19,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:29:19,620 INFO L87 Difference]: Start difference. First operand 11571 states and 38926 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-25 19:29:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:29:29,288 INFO L93 Difference]: Finished difference Result 14576 states and 48058 transitions. [2021-11-25 19:29:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-25 19:29:29,289 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-25 19:29:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:29:29,323 INFO L225 Difference]: With dead ends: 14576 [2021-11-25 19:29:29,323 INFO L226 Difference]: Without dead ends: 14492 [2021-11-25 19:29:29,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1534, Invalid=4786, Unknown=0, NotChecked=0, Total=6320 [2021-11-25 19:29:29,324 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 336 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 5286 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 5340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 5286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:29:29,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 193 Invalid, 5340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 5286 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-11-25 19:29:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14492 states. [2021-11-25 19:29:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14492 to 11575. [2021-11-25 19:29:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11575 states, 11571 states have (on average 3.3651369803819895) internal successors, (38938), 11574 states have internal predecessors, (38938), 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-25 19:29:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11575 states to 11575 states and 38938 transitions. [2021-11-25 19:29:29,675 INFO L78 Accepts]: Start accepts. Automaton has 11575 states and 38938 transitions. Word has length 31 [2021-11-25 19:29:29,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:29:29,675 INFO L470 AbstractCegarLoop]: Abstraction has 11575 states and 38938 transitions. [2021-11-25 19:29:29,675 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-25 19:29:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 11575 states and 38938 transitions. [2021-11-25 19:29:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:29:29,689 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:29:29,689 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-25 19:29:29,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-11-25 19:29:29,689 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:29:29,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:29:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1004486049, now seen corresponding path program 31 times [2021-11-25 19:29:29,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:29:29,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553350539] [2021-11-25 19:29:29,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:29:29,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:29:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:29:30,545 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-25 19:29:30,546 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:29:30,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553350539] [2021-11-25 19:29:30,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553350539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:29:30,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:29:30,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 19:29:30,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499246463] [2021-11-25 19:29:30,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:29:30,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:29:30,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:29:30,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:29:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:29:30,547 INFO L87 Difference]: Start difference. First operand 11575 states and 38938 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-25 19:29:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:29:34,259 INFO L93 Difference]: Finished difference Result 14882 states and 49774 transitions. [2021-11-25 19:29:34,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 19:29:34,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-25 19:29:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:29:34,299 INFO L225 Difference]: With dead ends: 14882 [2021-11-25 19:29:34,299 INFO L226 Difference]: Without dead ends: 14882 [2021-11-25 19:29:34,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=273, Invalid=1059, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 19:29:34,300 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 333 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 3977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:29:34,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 185 Invalid, 3977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 19:29:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14882 states. [2021-11-25 19:29:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14882 to 11781. [2021-11-25 19:29:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11781 states, 11777 states have (on average 3.3672412329116073) internal successors, (39656), 11780 states have internal predecessors, (39656), 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-25 19:29:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11781 states to 11781 states and 39656 transitions. [2021-11-25 19:29:34,583 INFO L78 Accepts]: Start accepts. Automaton has 11781 states and 39656 transitions. Word has length 31 [2021-11-25 19:29:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:29:34,583 INFO L470 AbstractCegarLoop]: Abstraction has 11781 states and 39656 transitions. [2021-11-25 19:29:34,583 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-25 19:29:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 11781 states and 39656 transitions. [2021-11-25 19:29:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:29:34,605 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:29:34,605 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-25 19:29:34,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-11-25 19:29:34,605 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:29:34,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:29:34,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1004486040, now seen corresponding path program 2 times [2021-11-25 19:29:34,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:29:34,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803708692] [2021-11-25 19:29:34,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:29:34,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:29:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:29:35,747 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-25 19:29:35,747 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:29:35,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803708692] [2021-11-25 19:29:35,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803708692] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:29:35,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:29:35,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 19:29:35,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339552141] [2021-11-25 19:29:35,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:29:35,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:29:35,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:29:35,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:29:35,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:29:35,748 INFO L87 Difference]: Start difference. First operand 11781 states and 39656 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-25 19:29:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:29:39,503 INFO L93 Difference]: Finished difference Result 14882 states and 49706 transitions. [2021-11-25 19:29:39,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 19:29:39,503 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-25 19:29:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:29:39,545 INFO L225 Difference]: With dead ends: 14882 [2021-11-25 19:29:39,545 INFO L226 Difference]: Without dead ends: 14882 [2021-11-25 19:29:39,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=274, Invalid=1058, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 19:29:39,546 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 347 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 3294 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:29:39,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 166 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3294 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 19:29:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14882 states. [2021-11-25 19:29:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14882 to 11653. [2021-11-25 19:29:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11653 states, 11649 states have (on average 3.363035453687012) internal successors, (39176), 11652 states have internal predecessors, (39176), 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-25 19:29:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11653 states to 11653 states and 39176 transitions. [2021-11-25 19:29:39,833 INFO L78 Accepts]: Start accepts. Automaton has 11653 states and 39176 transitions. Word has length 31 [2021-11-25 19:29:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:29:39,833 INFO L470 AbstractCegarLoop]: Abstraction has 11653 states and 39176 transitions. [2021-11-25 19:29:39,833 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-25 19:29:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 11653 states and 39176 transitions. [2021-11-25 19:29:39,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:29:39,856 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:29:39,856 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-25 19:29:39,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-11-25 19:29:39,856 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:29:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:29:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1990365503, now seen corresponding path program 32 times [2021-11-25 19:29:39,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:29:39,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648148565] [2021-11-25 19:29:39,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:29:39,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:29:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:29:40,794 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-25 19:29:40,794 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:29:40,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648148565] [2021-11-25 19:29:40,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648148565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:29:40,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:29:40,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:29:40,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017831443] [2021-11-25 19:29:40,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:29:40,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:29:40,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:29:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:29:40,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:29:40,796 INFO L87 Difference]: Start difference. First operand 11653 states and 39176 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-25 19:29:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:29:51,321 INFO L93 Difference]: Finished difference Result 15686 states and 51376 transitions. [2021-11-25 19:29:51,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-11-25 19:29:51,322 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-25 19:29:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:29:51,362 INFO L225 Difference]: With dead ends: 15686 [2021-11-25 19:29:51,362 INFO L226 Difference]: Without dead ends: 15594 [2021-11-25 19:29:51,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1715 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1855, Invalid=6155, Unknown=0, NotChecked=0, Total=8010 [2021-11-25 19:29:51,363 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 341 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 5098 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 5163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 5098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:29:51,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 197 Invalid, 5163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 5098 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-11-25 19:29:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15594 states. [2021-11-25 19:29:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15594 to 11579. [2021-11-25 19:29:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11579 states, 11575 states have (on average 3.365010799136069) internal successors, (38950), 11578 states have internal predecessors, (38950), 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-25 19:29:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11579 states to 11579 states and 38950 transitions. [2021-11-25 19:29:51,730 INFO L78 Accepts]: Start accepts. Automaton has 11579 states and 38950 transitions. Word has length 31 [2021-11-25 19:29:51,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:29:51,730 INFO L470 AbstractCegarLoop]: Abstraction has 11579 states and 38950 transitions. [2021-11-25 19:29:51,730 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-25 19:29:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 11579 states and 38950 transitions. [2021-11-25 19:29:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:29:51,746 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:29:51,746 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-25 19:29:51,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-11-25 19:29:51,746 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:29:51,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:29:51,747 INFO L85 PathProgramCache]: Analyzing trace with hash 793463105, now seen corresponding path program 33 times [2021-11-25 19:29:51,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:29:51,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485833230] [2021-11-25 19:29:51,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:29:51,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:29:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:29:52,648 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-25 19:29:52,648 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:29:52,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485833230] [2021-11-25 19:29:52,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485833230] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:29:52,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:29:52,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:29:52,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952321970] [2021-11-25 19:29:52,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:29:52,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:29:52,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:29:52,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:29:52,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:29:52,650 INFO L87 Difference]: Start difference. First operand 11579 states and 38950 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-25 19:30:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:30:00,274 INFO L93 Difference]: Finished difference Result 18214 states and 60445 transitions. [2021-11-25 19:30:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-25 19:30:00,274 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-25 19:30:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:30:00,316 INFO L225 Difference]: With dead ends: 18214 [2021-11-25 19:30:00,316 INFO L226 Difference]: Without dead ends: 18214 [2021-11-25 19:30:00,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=807, Invalid=3749, Unknown=0, NotChecked=0, Total=4556 [2021-11-25 19:30:00,317 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 418 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 5282 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 5354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 5282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:30:00,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 257 Invalid, 5354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 5282 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-11-25 19:30:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18214 states. [2021-11-25 19:30:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18214 to 12508. [2021-11-25 19:30:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12508 states, 12504 states have (on average 3.347408829174664) internal successors, (41856), 12507 states have internal predecessors, (41856), 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-25 19:30:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12508 states to 12508 states and 41856 transitions. [2021-11-25 19:30:00,621 INFO L78 Accepts]: Start accepts. Automaton has 12508 states and 41856 transitions. Word has length 31 [2021-11-25 19:30:00,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:30:00,621 INFO L470 AbstractCegarLoop]: Abstraction has 12508 states and 41856 transitions. [2021-11-25 19:30:00,621 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-25 19:30:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 12508 states and 41856 transitions. [2021-11-25 19:30:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:30:00,635 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:30:00,635 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-25 19:30:00,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-11-25 19:30:00,636 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:30:00,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:30:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1548628225, now seen corresponding path program 34 times [2021-11-25 19:30:00,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:30:00,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492863996] [2021-11-25 19:30:00,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:30:00,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:30:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:30:01,525 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-25 19:30:01,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:30:01,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492863996] [2021-11-25 19:30:01,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492863996] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:30:01,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:30:01,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:30:01,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519801115] [2021-11-25 19:30:01,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:30:01,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:30:01,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:30:01,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:30:01,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:30:01,526 INFO L87 Difference]: Start difference. First operand 12508 states and 41856 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-25 19:30:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:30:16,001 INFO L93 Difference]: Finished difference Result 16546 states and 54051 transitions. [2021-11-25 19:30:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2021-11-25 19:30:16,002 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-25 19:30:16,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:30:16,038 INFO L225 Difference]: With dead ends: 16546 [2021-11-25 19:30:16,038 INFO L226 Difference]: Without dead ends: 16418 [2021-11-25 19:30:16,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3069 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2790, Invalid=10092, Unknown=0, NotChecked=0, Total=12882 [2021-11-25 19:30:16,039 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 276 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 6616 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 6616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:30:16,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 267 Invalid, 6692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 6616 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2021-11-25 19:30:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16418 states. [2021-11-25 19:30:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16418 to 12508. [2021-11-25 19:30:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12508 states, 12504 states have (on average 3.347408829174664) internal successors, (41856), 12507 states have internal predecessors, (41856), 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-25 19:30:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12508 states to 12508 states and 41856 transitions. [2021-11-25 19:30:16,317 INFO L78 Accepts]: Start accepts. Automaton has 12508 states and 41856 transitions. Word has length 31 [2021-11-25 19:30:16,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:30:16,317 INFO L470 AbstractCegarLoop]: Abstraction has 12508 states and 41856 transitions. [2021-11-25 19:30:16,317 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-25 19:30:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 12508 states and 41856 transitions. [2021-11-25 19:30:16,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:30:16,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:30:16,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-25 19:30:16,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-11-25 19:30:16,331 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:30:16,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:30:16,332 INFO L85 PathProgramCache]: Analyzing trace with hash 984513609, now seen corresponding path program 35 times [2021-11-25 19:30:16,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:30:16,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434688347] [2021-11-25 19:30:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:30:16,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:30:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:30:17,102 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-25 19:30:17,103 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:30:17,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434688347] [2021-11-25 19:30:17,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434688347] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:30:17,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:30:17,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:30:17,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822803883] [2021-11-25 19:30:17,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:30:17,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:30:17,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:30:17,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:30:17,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:30:17,104 INFO L87 Difference]: Start difference. First operand 12508 states and 41856 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-25 19:30:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:30:25,431 INFO L93 Difference]: Finished difference Result 16818 states and 54897 transitions. [2021-11-25 19:30:25,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-25 19:30:25,431 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-25 19:30:25,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:30:25,470 INFO L225 Difference]: With dead ends: 16818 [2021-11-25 19:30:25,470 INFO L226 Difference]: Without dead ends: 16730 [2021-11-25 19:30:25,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1436, Invalid=4416, Unknown=0, NotChecked=0, Total=5852 [2021-11-25 19:30:25,475 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 311 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 4601 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 4658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 4601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:30:25,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 170 Invalid, 4658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 4601 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-25 19:30:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16730 states. [2021-11-25 19:30:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16730 to 12520. [2021-11-25 19:30:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12520 states, 12516 states have (on average 3.3470757430488973) internal successors, (41892), 12519 states have internal predecessors, (41892), 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-25 19:30:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12520 states to 12520 states and 41892 transitions. [2021-11-25 19:30:25,845 INFO L78 Accepts]: Start accepts. Automaton has 12520 states and 41892 transitions. Word has length 31 [2021-11-25 19:30:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:30:25,845 INFO L470 AbstractCegarLoop]: Abstraction has 12520 states and 41892 transitions. [2021-11-25 19:30:25,846 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-25 19:30:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 12520 states and 41892 transitions. [2021-11-25 19:30:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:30:25,860 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:30:25,860 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-25 19:30:25,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-11-25 19:30:25,860 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:30:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:30:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash -212388789, now seen corresponding path program 36 times [2021-11-25 19:30:25,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:30:25,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199400991] [2021-11-25 19:30:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:30:25,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:30:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:30:26,434 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-25 19:30:26,434 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:30:26,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199400991] [2021-11-25 19:30:26,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199400991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:30:26,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:30:26,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:30:26,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926830387] [2021-11-25 19:30:26,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:30:26,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:30:26,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:30:26,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:30:26,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:30:26,436 INFO L87 Difference]: Start difference. First operand 12520 states and 41892 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-25 19:30:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:30:38,530 INFO L93 Difference]: Finished difference Result 18523 states and 59950 transitions. [2021-11-25 19:30:38,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-11-25 19:30:38,530 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-25 19:30:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:30:38,577 INFO L225 Difference]: With dead ends: 18523 [2021-11-25 19:30:38,577 INFO L226 Difference]: Without dead ends: 18355 [2021-11-25 19:30:38,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2848 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2631, Invalid=9359, Unknown=0, NotChecked=0, Total=11990 [2021-11-25 19:30:38,578 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 324 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 7608 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 7681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 7608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:30:38,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 294 Invalid, 7681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 7608 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-11-25 19:30:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18355 states. [2021-11-25 19:30:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18355 to 12448. [2021-11-25 19:30:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12448 states, 12444 states have (on average 3.3484410157505624) internal successors, (41668), 12447 states have internal predecessors, (41668), 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-25 19:30:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12448 states to 12448 states and 41668 transitions. [2021-11-25 19:30:38,972 INFO L78 Accepts]: Start accepts. Automaton has 12448 states and 41668 transitions. Word has length 31 [2021-11-25 19:30:38,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:30:38,972 INFO L470 AbstractCegarLoop]: Abstraction has 12448 states and 41668 transitions. [2021-11-25 19:30:38,972 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-25 19:30:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 12448 states and 41668 transitions. [2021-11-25 19:30:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:30:38,988 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:30:38,988 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-25 19:30:38,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-11-25 19:30:38,989 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:30:38,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:30:38,990 INFO L85 PathProgramCache]: Analyzing trace with hash 682479515, now seen corresponding path program 37 times [2021-11-25 19:30:38,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:30:38,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181239320] [2021-11-25 19:30:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:30:38,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:30:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:30:39,708 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-25 19:30:39,708 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:30:39,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181239320] [2021-11-25 19:30:39,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181239320] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:30:39,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:30:39,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:30:39,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619924261] [2021-11-25 19:30:39,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:30:39,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:30:39,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:30:39,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:30:39,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:30:39,709 INFO L87 Difference]: Start difference. First operand 12448 states and 41668 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)