./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 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37b8edad74269e9ff0decb0295cb9343b2467e698f16054f344bf342aab69b21 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-12 23:23:40,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-12 23:23:40,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-12 23:23:40,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-12 23:23:40,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-12 23:23:40,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-12 23:23:40,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-12 23:23:40,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-12 23:23:40,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-12 23:23:40,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-12 23:23:40,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-12 23:23:40,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-12 23:23:40,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-12 23:23:40,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-12 23:23:40,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-12 23:23:40,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-12 23:23:40,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-12 23:23:40,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-12 23:23:40,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-12 23:23:40,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-12 23:23:40,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-12 23:23:40,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-12 23:23:40,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-12 23:23:40,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-12 23:23:40,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-12 23:23:40,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-12 23:23:40,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-12 23:23:40,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-12 23:23:40,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-12 23:23:40,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-12 23:23:40,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-12 23:23:40,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-12 23:23:40,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-12 23:23:40,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-12 23:23:40,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-12 23:23:40,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-12 23:23:40,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-12 23:23:40,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-12 23:23:40,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-12 23:23:40,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-12 23:23:40,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-12 23:23:40,554 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-12 23:23:40,611 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-12 23:23:40,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-12 23:23:40,613 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-12 23:23:40,614 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-12 23:23:40,614 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-12 23:23:40,615 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-12 23:23:40,615 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-12 23:23:40,615 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-12 23:23:40,623 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-12 23:23:40,624 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-12 23:23:40,626 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-12 23:23:40,626 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-12 23:23:40,626 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-12 23:23:40,627 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-12 23:23:40,627 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-12 23:23:40,628 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-12 23:23:40,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-12 23:23:40,629 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-12 23:23:40,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-12 23:23:40,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-12 23:23:40,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-12 23:23:40,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-12 23:23:40,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-12 23:23:40,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-12 23:23:40,631 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-12 23:23:40,632 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-12 23:23:40,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-12 23:23:40,632 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-12 23:23:40,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-12 23:23:40,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-12 23:23:40,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-12 23:23:40,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:23:40,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-12 23:23:40,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-12 23:23:40,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-12 23:23:40,637 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-12 23:23:40,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-12 23:23:40,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-12 23:23:40,638 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-12 23:23:40,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-12 23:23:40,638 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_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/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_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF 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-12 23:23:40,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-12 23:23:41,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-12 23:23:41,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-12 23:23:41,045 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-12 23:23:41,046 INFO L275 PluginConnector]: CDTParser initialized [2021-11-12 23:23:41,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2021-11-12 23:23:41,144 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/data/a90ac0554/418907d2c07c4d69bcbc7bd8380f2b7d/FLAG2ff0290fa [2021-11-12 23:23:41,928 INFO L306 CDTParser]: Found 1 translation units. [2021-11-12 23:23:41,928 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2021-11-12 23:23:41,973 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/data/a90ac0554/418907d2c07c4d69bcbc7bd8380f2b7d/FLAG2ff0290fa [2021-11-12 23:23:42,131 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/data/a90ac0554/418907d2c07c4d69bcbc7bd8380f2b7d [2021-11-12 23:23:42,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-12 23:23:42,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-12 23:23:42,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-12 23:23:42,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-12 23:23:42,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-12 23:23:42,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:23:42" (1/1) ... [2021-11-12 23:23:42,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3c8351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:42, skipping insertion in model container [2021-11-12 23:23:42,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:23:42" (1/1) ... [2021-11-12 23:23:42,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-12 23:23:42,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-12 23:23:42,479 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-12 23:23:42,853 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39095,39108] [2021-11-12 23:23:42,860 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39180,39193] [2021-11-12 23:23:42,861 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39232,39245] [2021-11-12 23:23:42,988 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49285,49298] [2021-11-12 23:23:42,990 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49334,49347] [2021-11-12 23:23:42,994 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49462,49475] [2021-11-12 23:23:42,995 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49520,49533] [2021-11-12 23:23:43,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:23:43,018 INFO L203 MainTranslator]: Completed pre-run [2021-11-12 23:23:43,046 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-12 23:23:43,086 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39095,39108] [2021-11-12 23:23:43,087 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39180,39193] [2021-11-12 23:23:43,088 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39232,39245] [2021-11-12 23:23:43,105 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49285,49298] [2021-11-12 23:23:43,105 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49334,49347] [2021-11-12 23:23:43,110 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49462,49475] [2021-11-12 23:23:43,117 WARN L228 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_4c28a658-ee94-44d7-8d40-86ab73110521/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49520,49533] [2021-11-12 23:23:43,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:23:43,221 INFO L208 MainTranslator]: Completed translation [2021-11-12 23:23:43,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43 WrapperNode [2021-11-12 23:23:43,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-12 23:23:43,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-12 23:23:43,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-12 23:23:43,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-12 23:23:43,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43" (1/1) ... [2021-11-12 23:23:43,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43" (1/1) ... [2021-11-12 23:23:43,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-12 23:23:43,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-12 23:23:43,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-12 23:23:43,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-12 23:23:43,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43" (1/1) ... [2021-11-12 23:23:43,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43" (1/1) ... [2021-11-12 23:23:43,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43" (1/1) ... [2021-11-12 23:23:43,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43" (1/1) ... [2021-11-12 23:23:43,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43" (1/1) ... [2021-11-12 23:23:43,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43" (1/1) ... [2021-11-12 23:23:43,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43" (1/1) ... [2021-11-12 23:23:43,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-12 23:23:43,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-12 23:23:43,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-12 23:23:43,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-12 23:23:43,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43" (1/1) ... [2021-11-12 23:23:43,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:23:43,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:23:43,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-12 23:23:43,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-12 23:23:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2021-11-12 23:23:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2021-11-12 23:23:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2021-11-12 23:23:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2021-11-12 23:23:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-12 23:23:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-12 23:23:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-12 23:23:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-12 23:23:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-12 23:23:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-12 23:23:43,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-12 23:23:43,559 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-12 23:23:44,241 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-12 23:23:44,241 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-12 23:23:44,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:23:44 BoogieIcfgContainer [2021-11-12 23:23:44,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-12 23:23:44,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-12 23:23:44,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-12 23:23:44,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-12 23:23:44,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:23:42" (1/3) ... [2021-11-12 23:23:44,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171d7dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:23:44, skipping insertion in model container [2021-11-12 23:23:44,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:23:43" (2/3) ... [2021-11-12 23:23:44,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171d7dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:23:44, skipping insertion in model container [2021-11-12 23:23:44,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:23:44" (3/3) ... [2021-11-12 23:23:44,255 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2021-11-12 23:23:44,261 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-12 23:23:44,262 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-12 23:23:44,262 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-12 23:23:44,262 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-12 23:23:44,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,335 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,335 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,356 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,357 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,365 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-12 23:23:44,365 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-12 23:23:44,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,366 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-12 23:23:44,367 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-12 23:23:44,368 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,369 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,369 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,374 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,374 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,374 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,374 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,375 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,376 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-12 23:23:44,376 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-12 23:23:44,376 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,377 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-12 23:23:44,377 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-12 23:23:44,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,377 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,378 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,379 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,380 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,381 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,382 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,383 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,383 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,383 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,383 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,384 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,385 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-12 23:23:44,387 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-12 23:23:44,387 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,387 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,387 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-12 23:23:44,387 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-12 23:23:44,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,388 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,389 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,390 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,391 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,392 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,392 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,392 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,392 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,392 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,393 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-12 23:23:44,393 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-12 23:23:44,393 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,393 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,393 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-12 23:23:44,393 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-12 23:23:44,394 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,394 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,394 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,395 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,396 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,397 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,398 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,398 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,398 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,398 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,398 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,399 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,400 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,400 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,400 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,400 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,400 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,401 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,401 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,402 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,407 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,408 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,408 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,408 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,408 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,409 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,411 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,411 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,411 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,412 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,413 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,414 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,415 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,416 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,417 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,418 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,419 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,428 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,428 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,429 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,429 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,429 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,429 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,429 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,430 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,430 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,430 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,430 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,430 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,431 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,431 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,431 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,432 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,432 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,432 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,432 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,432 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,432 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,433 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,433 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,433 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,433 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,433 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,433 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,434 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,434 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,434 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,434 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,434 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,435 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,435 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,435 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,435 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,435 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,435 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,436 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,436 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,436 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,436 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,436 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,436 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,437 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,437 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,437 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,437 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,437 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,438 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,438 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,438 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,438 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,438 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,438 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,439 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,439 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,439 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,439 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,440 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,440 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,440 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,440 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,440 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,441 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,441 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,441 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,441 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,441 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,441 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,442 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,442 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,442 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,442 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,442 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,442 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,443 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,444 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,445 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,446 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-12 23:23:44,446 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-12 23:23:44,446 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,446 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,447 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,447 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,447 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-12 23:23:44,447 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-12 23:23:44,447 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,447 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,448 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,448 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,448 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,448 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,448 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,448 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,448 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,449 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,449 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,449 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,449 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,449 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,449 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-12 23:23:44,450 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-12 23:23:44,450 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,450 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,450 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-12 23:23:44,450 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-12 23:23:44,450 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,451 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,451 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,451 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,451 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,451 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,451 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,452 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,452 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,452 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,452 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,452 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,452 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,453 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,454 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,454 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,454 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,455 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,456 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,456 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,456 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,456 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,456 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,457 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,457 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,457 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,457 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,457 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,458 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,458 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,458 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,458 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,458 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,458 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,459 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,459 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,459 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,459 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,459 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,460 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,461 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,461 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,461 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,461 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,461 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,462 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,462 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,462 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,462 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,463 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,463 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,463 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,463 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,463 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,464 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,464 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,464 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,464 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,465 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,465 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,465 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,465 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,465 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,466 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,466 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,466 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,466 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,466 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,467 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,473 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,473 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-12 23:23:44,473 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,473 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,474 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-12 23:23:44,478 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,479 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,479 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,479 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,480 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,480 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,480 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,480 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,481 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,481 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,481 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,481 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,482 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,482 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,482 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,482 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,482 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,483 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,483 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,483 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,483 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,484 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,484 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,484 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,484 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-12 23:23:44,485 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-12 23:23:44,485 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,485 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,485 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,485 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,491 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,492 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,492 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,492 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,492 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,493 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,493 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,493 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,493 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,493 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,494 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,494 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,494 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,494 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-12 23:23:44,495 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,495 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,495 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-12 23:23:44,495 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-12 23:23:44,500 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-12 23:23:44,575 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-12 23:23:44,617 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-12 23:23:44,618 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-11-12 23:23:44,642 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-12 23:23:44,662 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 220 transitions, 456 flow [2021-11-12 23:23:44,667 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 220 transitions, 456 flow [2021-11-12 23:23:44,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 210 places, 220 transitions, 456 flow [2021-11-12 23:23:44,868 INFO L129 PetriNetUnfolder]: 17/218 cut-off events. [2021-11-12 23:23:44,868 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-12 23:23:44,881 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-12 23:23:44,900 INFO L116 LiptonReduction]: Number of co-enabled transitions 17440 [2021-11-12 23:23:53,098 INFO L131 LiptonReduction]: Checked pairs total: 29990 [2021-11-12 23:23:53,098 INFO L133 LiptonReduction]: Total number of compositions: 198 [2021-11-12 23:23:53,119 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 60 transitions, 136 flow [2021-11-12 23:23:53,263 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-12 23:23:53,275 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-12 23:23:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-12 23:23:53,298 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:53,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:23:53,300 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-12 23:23:53,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:53,306 INFO L85 PathProgramCache]: Analyzing trace with hash 858118945, now seen corresponding path program 1 times [2021-11-12 23:23:53,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:53,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732248954] [2021-11-12 23:23:53,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:53,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:53,998 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-12 23:23:53,999 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:53,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732248954] [2021-11-12 23:23:54,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732248954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:54,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:54,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-12 23:23:54,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88880091] [2021-11-12 23:23:54,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:54,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-12 23:23:54,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:54,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-12 23:23:54,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-12 23:23:54,054 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-12 23:23:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:54,729 INFO L93 Difference]: Finished difference Result 2069 states and 6691 transitions. [2021-11-12 23:23:54,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 23:23:54,732 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-12 23:23:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:54,782 INFO L225 Difference]: With dead ends: 2069 [2021-11-12 23:23:54,782 INFO L226 Difference]: Without dead ends: 1982 [2021-11-12 23:23:54,783 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-12 23:23:54,788 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 355.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.66ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 462.99ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:54,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 21 Invalid, 417 Unknown, 0 Unchecked, 11.66ms Time], IncrementalHoareTripleChecker [9 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 462.99ms Time] [2021-11-12 23:23:54,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-11-12 23:23:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1899. [2021-11-12 23:23:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1895 states have (on average 3.2912928759894458) internal successors, (6237), 1898 states have internal predecessors, (6237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 6237 transitions. [2021-11-12 23:23:55,006 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 6237 transitions. Word has length 17 [2021-11-12 23:23:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:55,007 INFO L470 AbstractCegarLoop]: Abstraction has 1899 states and 6237 transitions. [2021-11-12 23:23:55,007 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-12 23:23:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 6237 transitions. [2021-11-12 23:23:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-12 23:23:55,014 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:55,014 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-12 23:23:55,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-12 23:23:55,015 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-12 23:23:55,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:55,020 INFO L85 PathProgramCache]: Analyzing trace with hash 551663106, now seen corresponding path program 1 times [2021-11-12 23:23:55,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:55,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830158206] [2021-11-12 23:23:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:55,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:55,289 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-12 23:23:55,290 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:55,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830158206] [2021-11-12 23:23:55,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830158206] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:55,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:55,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-12 23:23:55,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269251580] [2021-11-12 23:23:55,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:55,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-12 23:23:55,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:55,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-12 23:23:55,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-12 23:23:55,295 INFO L87 Difference]: Start difference. First operand 1899 states and 6237 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:23:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:55,956 INFO L93 Difference]: Finished difference Result 2946 states and 9724 transitions. [2021-11-12 23:23:55,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 23:23:55,957 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-12 23:23:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:55,993 INFO L225 Difference]: With dead ends: 2946 [2021-11-12 23:23:55,993 INFO L226 Difference]: Without dead ends: 2804 [2021-11-12 23:23:55,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-11-12 23:23:55,995 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 162 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 417.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.13ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 509.38ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:55,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 9 Invalid, 515 Unknown, 0 Unchecked, 5.13ms Time], IncrementalHoareTripleChecker [18 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 509.38ms Time] [2021-11-12 23:23:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2021-11-12 23:23:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2472. [2021-11-12 23:23:56,128 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-12 23:23:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 8169 transitions. [2021-11-12 23:23:56,151 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 8169 transitions. Word has length 18 [2021-11-12 23:23:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:56,152 INFO L470 AbstractCegarLoop]: Abstraction has 2472 states and 8169 transitions. [2021-11-12 23:23:56,152 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-12 23:23:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 8169 transitions. [2021-11-12 23:23:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-12 23:23:56,157 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:56,157 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-12 23:23:56,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-12 23:23:56,161 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-12 23:23:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:56,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1943633856, now seen corresponding path program 2 times [2021-11-12 23:23:56,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:56,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553294964] [2021-11-12 23:23:56,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:56,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:56,487 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-12 23:23:56,488 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:56,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553294964] [2021-11-12 23:23:56,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553294964] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:56,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:56,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-12 23:23:56,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220529315] [2021-11-12 23:23:56,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:56,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-12 23:23:56,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-12 23:23:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-12 23:23:56,494 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-12 23:23:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:57,208 INFO L93 Difference]: Finished difference Result 2702 states and 8801 transitions. [2021-11-12 23:23:57,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 23:23:57,209 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-12 23:23:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:57,241 INFO L225 Difference]: With dead ends: 2702 [2021-11-12 23:23:57,242 INFO L226 Difference]: Without dead ends: 2571 [2021-11-12 23:23:57,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-12 23:23:57,246 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 117 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 466.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.01ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 568.07ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:57,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 10 Invalid, 598 Unknown, 0 Unchecked, 5.01ms Time], IncrementalHoareTripleChecker [16 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 568.07ms Time] [2021-11-12 23:23:57,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2021-11-12 23:23:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2392. [2021-11-12 23:23:57,364 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-12 23:23:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 7878 transitions. [2021-11-12 23:23:57,383 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 7878 transitions. Word has length 18 [2021-11-12 23:23:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:57,384 INFO L470 AbstractCegarLoop]: Abstraction has 2392 states and 7878 transitions. [2021-11-12 23:23:57,384 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-12 23:23:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 7878 transitions. [2021-11-12 23:23:57,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:23:57,391 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:57,391 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-12 23:23:57,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-12 23:23:57,391 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-12 23:23:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:57,404 INFO L85 PathProgramCache]: Analyzing trace with hash 612061240, now seen corresponding path program 1 times [2021-11-12 23:23:57,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:57,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846602117] [2021-11-12 23:23:57,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:57,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:57,939 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-12 23:23:57,939 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:57,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846602117] [2021-11-12 23:23:57,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846602117] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:23:57,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:23:57,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:23:57,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39636268] [2021-11-12 23:23:57,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:23:57,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:23:57,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:57,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:23:57,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:23:57,942 INFO L87 Difference]: Start difference. First operand 2392 states and 7878 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-12 23:24:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:00,913 INFO L93 Difference]: Finished difference Result 3213 states and 10406 transitions. [2021-11-12 23:24:00,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:24:00,914 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-12 23:24:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:00,953 INFO L225 Difference]: With dead ends: 3213 [2021-11-12 23:24:00,953 INFO L226 Difference]: Without dead ends: 3127 [2021-11-12 23:24:00,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2021-11-12 23:24:00,958 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 188 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1466.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.09ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1723.69ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:00,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 33 Invalid, 1790 Unknown, 0 Unchecked, 17.09ms Time], IncrementalHoareTripleChecker [32 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 1723.69ms Time] [2021-11-12 23:24:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2021-11-12 23:24:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 2882. [2021-11-12 23:24:01,102 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-12 23:24:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 9478 transitions. [2021-11-12 23:24:01,128 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 9478 transitions. Word has length 25 [2021-11-12 23:24:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:01,133 INFO L470 AbstractCegarLoop]: Abstraction has 2882 states and 9478 transitions. [2021-11-12 23:24:01,134 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-12 23:24:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 9478 transitions. [2021-11-12 23:24:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:24:01,148 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:01,148 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-12 23:24:01,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-12 23:24:01,149 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-12 23:24:01,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:01,150 INFO L85 PathProgramCache]: Analyzing trace with hash 673642219, now seen corresponding path program 1 times [2021-11-12 23:24:01,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:01,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325801373] [2021-11-12 23:24:01,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:01,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:01,638 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-12 23:24:01,638 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:01,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325801373] [2021-11-12 23:24:01,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325801373] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:01,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:01,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:24:01,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960728908] [2021-11-12 23:24:01,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:01,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:24:01,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:01,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:24:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:24:01,640 INFO L87 Difference]: Start difference. First operand 2882 states and 9478 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-12 23:24:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:04,050 INFO L93 Difference]: Finished difference Result 3829 states and 12408 transitions. [2021-11-12 23:24:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:24:04,051 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-12 23:24:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:04,120 INFO L225 Difference]: With dead ends: 3829 [2021-11-12 23:24:04,122 INFO L226 Difference]: Without dead ends: 3743 [2021-11-12 23:24:04,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2021-11-12 23:24:04,124 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 253 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1083.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.06ms SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1300.93ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:04,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 32 Invalid, 1346 Unknown, 0 Unchecked, 10.06ms Time], IncrementalHoareTripleChecker [48 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1300.93ms Time] [2021-11-12 23:24:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2021-11-12 23:24:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3442. [2021-11-12 23:24:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 3438 states have (on average 3.2891215823152997) internal successors, (11308), 3441 states have internal predecessors, (11308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 11308 transitions. [2021-11-12 23:24:04,288 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 11308 transitions. Word has length 25 [2021-11-12 23:24:04,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:04,289 INFO L470 AbstractCegarLoop]: Abstraction has 3442 states and 11308 transitions. [2021-11-12 23:24:04,289 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-12 23:24:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 11308 transitions. [2021-11-12 23:24:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:24:04,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:04,301 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-12 23:24:04,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-12 23:24:04,302 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-12 23:24:04,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:04,303 INFO L85 PathProgramCache]: Analyzing trace with hash -626712486, now seen corresponding path program 2 times [2021-11-12 23:24:04,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:04,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506018646] [2021-11-12 23:24:04,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:04,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:04,691 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-12 23:24:04,691 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:04,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506018646] [2021-11-12 23:24:04,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506018646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:04,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:04,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-12 23:24:04,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501161577] [2021-11-12 23:24:04,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:04,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-12 23:24:04,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:04,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-12 23:24:04,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-12 23:24:04,694 INFO L87 Difference]: Start difference. First operand 3442 states and 11308 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:07,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:07,087 INFO L93 Difference]: Finished difference Result 4830 states and 15631 transitions. [2021-11-12 23:24:07,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-12 23:24:07,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-12 23:24:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:07,121 INFO L225 Difference]: With dead ends: 4830 [2021-11-12 23:24:07,121 INFO L226 Difference]: Without dead ends: 4744 [2021-11-12 23:24:07,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=259, Invalid=611, Unknown=0, NotChecked=0, Total=870 [2021-11-12 23:24:07,123 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 211 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1067.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.96ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1330.29ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:07,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 31 Invalid, 1464 Unknown, 0 Unchecked, 6.96ms Time], IncrementalHoareTripleChecker [24 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 1330.29ms Time] [2021-11-12 23:24:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2021-11-12 23:24:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 3582. [2021-11-12 23:24:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 3578 states have (on average 3.3029625489100054) internal successors, (11818), 3581 states have internal predecessors, (11818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 11818 transitions. [2021-11-12 23:24:07,308 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 11818 transitions. Word has length 25 [2021-11-12 23:24:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:07,309 INFO L470 AbstractCegarLoop]: Abstraction has 3582 states and 11818 transitions. [2021-11-12 23:24:07,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 11818 transitions. [2021-11-12 23:24:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:24:07,320 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:07,321 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-12 23:24:07,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-12 23:24:07,321 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-12 23:24:07,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:07,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1115878098, now seen corresponding path program 3 times [2021-11-12 23:24:07,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:07,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982094910] [2021-11-12 23:24:07,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:07,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:07,904 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-12 23:24:07,904 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:07,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982094910] [2021-11-12 23:24:07,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982094910] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:07,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:07,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:24:07,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393761857] [2021-11-12 23:24:07,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:07,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:24:07,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:07,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:24:07,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:24:07,906 INFO L87 Difference]: Start difference. First operand 3582 states and 11818 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-12 23:24:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:11,958 INFO L93 Difference]: Finished difference Result 4687 states and 15085 transitions. [2021-11-12 23:24:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-12 23:24:11,959 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-12 23:24:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:11,985 INFO L225 Difference]: With dead ends: 4687 [2021-11-12 23:24:11,986 INFO L226 Difference]: Without dead ends: 4601 [2021-11-12 23:24:11,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=455, Invalid=1267, Unknown=0, NotChecked=0, Total=1722 [2021-11-12 23:24:11,988 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 208 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 3134 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1953.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.88ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2315.02ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:11,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 73 Invalid, 3167 Unknown, 0 Unchecked, 9.88ms Time], IncrementalHoareTripleChecker [33 Valid, 3134 Invalid, 0 Unknown, 0 Unchecked, 2315.02ms Time] [2021-11-12 23:24:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2021-11-12 23:24:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 3162. [2021-11-12 23:24:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3162 states, 3158 states have (on average 3.2587080430652313) internal successors, (10291), 3161 states have internal predecessors, (10291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 10291 transitions. [2021-11-12 23:24:12,174 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 10291 transitions. Word has length 25 [2021-11-12 23:24:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:12,175 INFO L470 AbstractCegarLoop]: Abstraction has 3162 states and 10291 transitions. [2021-11-12 23:24:12,176 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-12 23:24:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 10291 transitions. [2021-11-12 23:24:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:24:12,187 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:12,187 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-12 23:24:12,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-12 23:24:12,188 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-12 23:24:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1853265656, now seen corresponding path program 4 times [2021-11-12 23:24:12,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:12,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648597197] [2021-11-12 23:24:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:12,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:12,603 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-12 23:24:12,603 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:12,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648597197] [2021-11-12 23:24:12,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648597197] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:12,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:12,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:24:12,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394964287] [2021-11-12 23:24:12,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:12,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:24:12,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:12,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:24:12,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:24:12,605 INFO L87 Difference]: Start difference. First operand 3162 states and 10291 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-12 23:24:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:16,180 INFO L93 Difference]: Finished difference Result 4162 states and 13369 transitions. [2021-11-12 23:24:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-12 23:24:16,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-12 23:24:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:16,197 INFO L225 Difference]: With dead ends: 4162 [2021-11-12 23:24:16,197 INFO L226 Difference]: Without dead ends: 4076 [2021-11-12 23:24:16,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=408, Invalid=1152, Unknown=0, NotChecked=0, Total=1560 [2021-11-12 23:24:16,199 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 261 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 2784 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1708.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.98ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2034.46ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:16,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 65 Invalid, 2820 Unknown, 0 Unchecked, 8.98ms Time], IncrementalHoareTripleChecker [36 Valid, 2784 Invalid, 0 Unknown, 0 Unchecked, 2034.46ms Time] [2021-11-12 23:24:16,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2021-11-12 23:24:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3106. [2021-11-12 23:24:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 3102 states have (on average 3.2607994842037393) internal successors, (10115), 3105 states have internal predecessors, (10115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 10115 transitions. [2021-11-12 23:24:16,370 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 10115 transitions. Word has length 25 [2021-11-12 23:24:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:16,371 INFO L470 AbstractCegarLoop]: Abstraction has 3106 states and 10115 transitions. [2021-11-12 23:24:16,371 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-12 23:24:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 10115 transitions. [2021-11-12 23:24:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:24:16,381 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:16,382 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-12 23:24:16,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-12 23:24:16,382 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-12 23:24:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash 532362993, now seen corresponding path program 2 times [2021-11-12 23:24:16,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:16,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697262499] [2021-11-12 23:24:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:16,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:16,810 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-12 23:24:16,810 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:16,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697262499] [2021-11-12 23:24:16,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697262499] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:16,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:16,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:24:16,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041970518] [2021-11-12 23:24:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:16,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:24:16,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:16,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:24:16,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:24:16,813 INFO L87 Difference]: Start difference. First operand 3106 states and 10115 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-12 23:24:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:19,188 INFO L93 Difference]: Finished difference Result 4602 states and 14689 transitions. [2021-11-12 23:24:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-12 23:24:19,189 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-12 23:24:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:19,209 INFO L225 Difference]: With dead ends: 4602 [2021-11-12 23:24:19,209 INFO L226 Difference]: Without dead ends: 4516 [2021-11-12 23:24:19,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=329, Invalid=793, Unknown=0, NotChecked=0, Total=1122 [2021-11-12 23:24:19,211 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 307 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1006.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.21ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1190.84ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:19,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 40 Invalid, 1642 Unknown, 0 Unchecked, 5.21ms Time], IncrementalHoareTripleChecker [50 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 1190.84ms Time] [2021-11-12 23:24:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2021-11-12 23:24:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 3036. [2021-11-12 23:24:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3032 states have (on average 3.266820580474934) internal successors, (9905), 3035 states have internal predecessors, (9905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 9905 transitions. [2021-11-12 23:24:19,412 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 9905 transitions. Word has length 25 [2021-11-12 23:24:19,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:19,413 INFO L470 AbstractCegarLoop]: Abstraction has 3036 states and 9905 transitions. [2021-11-12 23:24:19,413 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-12 23:24:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 9905 transitions. [2021-11-12 23:24:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:24:19,422 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:19,422 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-12 23:24:19,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-12 23:24:19,423 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-12 23:24:19,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash -365364165, now seen corresponding path program 3 times [2021-11-12 23:24:19,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:19,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805413812] [2021-11-12 23:24:19,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:19,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:19,830 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-12 23:24:19,830 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:19,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805413812] [2021-11-12 23:24:19,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805413812] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:19,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:19,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:24:19,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940446686] [2021-11-12 23:24:19,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:19,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:24:19,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:19,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:24:19,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:24:19,833 INFO L87 Difference]: Start difference. First operand 3036 states and 9905 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-12 23:24:22,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:22,495 INFO L93 Difference]: Finished difference Result 4382 states and 14029 transitions. [2021-11-12 23:24:22,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-12 23:24:22,497 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-12 23:24:22,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:22,511 INFO L225 Difference]: With dead ends: 4382 [2021-11-12 23:24:22,511 INFO L226 Difference]: Without dead ends: 4296 [2021-11-12 23:24:22,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=364, Invalid=896, Unknown=0, NotChecked=0, Total=1260 [2021-11-12 23:24:22,513 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 289 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1072.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.59ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1279.00ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:22,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 48 Invalid, 1819 Unknown, 0 Unchecked, 5.59ms Time], IncrementalHoareTripleChecker [52 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 1279.00ms Time] [2021-11-12 23:24:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2021-11-12 23:24:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 2966. [2021-11-12 23:24:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 2962 states have (on average 3.2528696826468604) internal successors, (9635), 2965 states have internal predecessors, (9635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 9635 transitions. [2021-11-12 23:24:22,633 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 9635 transitions. Word has length 25 [2021-11-12 23:24:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:22,634 INFO L470 AbstractCegarLoop]: Abstraction has 2966 states and 9635 transitions. [2021-11-12 23:24:22,634 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-12 23:24:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 9635 transitions. [2021-11-12 23:24:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:24:22,642 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:22,642 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-12 23:24:22,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-12 23:24:22,642 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-12 23:24:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:22,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1499949225, now seen corresponding path program 4 times [2021-11-12 23:24:22,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:22,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730146521] [2021-11-12 23:24:22,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:22,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:23,052 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-12 23:24:23,053 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:23,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730146521] [2021-11-12 23:24:23,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730146521] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:23,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:23,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:24:23,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469228402] [2021-11-12 23:24:23,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:23,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:24:23,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:23,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:24:23,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:24:23,056 INFO L87 Difference]: Start difference. First operand 2966 states and 9635 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-12 23:24:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:26,029 INFO L93 Difference]: Finished difference Result 4008 states and 12830 transitions. [2021-11-12 23:24:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-12 23:24:26,030 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-12 23:24:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:26,040 INFO L225 Difference]: With dead ends: 4008 [2021-11-12 23:24:26,040 INFO L226 Difference]: Without dead ends: 3922 [2021-11-12 23:24:26,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=400, Invalid=1006, Unknown=0, NotChecked=0, Total=1406 [2021-11-12 23:24:26,042 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 283 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 2081 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1246.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.51ms SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1479.63ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:26,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 57 Invalid, 2129 Unknown, 0 Unchecked, 6.51ms Time], IncrementalHoareTripleChecker [48 Valid, 2081 Invalid, 0 Unknown, 0 Unchecked, 1479.63ms Time] [2021-11-12 23:24:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2021-11-12 23:24:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 2756. [2021-11-12 23:24:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2752 states have (on average 3.2467296511627906) internal successors, (8935), 2755 states have internal predecessors, (8935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 8935 transitions. [2021-11-12 23:24:26,153 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 8935 transitions. Word has length 25 [2021-11-12 23:24:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:26,153 INFO L470 AbstractCegarLoop]: Abstraction has 2756 states and 8935 transitions. [2021-11-12 23:24:26,153 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-12 23:24:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 8935 transitions. [2021-11-12 23:24:26,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:24:26,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:26,161 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-12 23:24:26,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-12 23:24:26,162 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-12 23:24:26,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash -794497401, now seen corresponding path program 5 times [2021-11-12 23:24:26,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:26,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627996037] [2021-11-12 23:24:26,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:26,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:26,589 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-12 23:24:26,589 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:26,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627996037] [2021-11-12 23:24:26,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627996037] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:26,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:26,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:24:26,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89693284] [2021-11-12 23:24:26,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:26,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:24:26,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:26,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:24:26,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:24:26,593 INFO L87 Difference]: Start difference. First operand 2756 states and 8935 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-12 23:24:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:30,446 INFO L93 Difference]: Finished difference Result 3924 states and 12414 transitions. [2021-11-12 23:24:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-12 23:24:30,446 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-12 23:24:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:30,458 INFO L225 Difference]: With dead ends: 3924 [2021-11-12 23:24:30,459 INFO L226 Difference]: Without dead ends: 3838 [2021-11-12 23:24:30,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=497, Invalid=1309, Unknown=0, NotChecked=0, Total=1806 [2021-11-12 23:24:30,461 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 320 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 2366 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1490.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.72ms SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1765.48ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:30,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 72 Invalid, 2422 Unknown, 0 Unchecked, 7.72ms Time], IncrementalHoareTripleChecker [56 Valid, 2366 Invalid, 0 Unknown, 0 Unchecked, 1765.48ms Time] [2021-11-12 23:24:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2021-11-12 23:24:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 2770. [2021-11-12 23:24:30,556 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-12 23:24:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 8902 transitions. [2021-11-12 23:24:30,567 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 8902 transitions. Word has length 25 [2021-11-12 23:24:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:30,568 INFO L470 AbstractCegarLoop]: Abstraction has 2770 states and 8902 transitions. [2021-11-12 23:24:30,568 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-12 23:24:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 8902 transitions. [2021-11-12 23:24:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:24:30,576 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:30,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:24:30,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-12 23:24:30,577 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-12 23:24:30,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1254636031, now seen corresponding path program 6 times [2021-11-12 23:24:30,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:30,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160981307] [2021-11-12 23:24:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:30,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:30,985 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-12 23:24:30,986 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:30,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160981307] [2021-11-12 23:24:30,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160981307] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:30,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:30,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:24:30,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999360020] [2021-11-12 23:24:30,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:30,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:24:30,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:30,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:24:30,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:24:30,988 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-12 23:24:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:35,455 INFO L93 Difference]: Finished difference Result 3868 states and 12196 transitions. [2021-11-12 23:24:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-12 23:24:35,455 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-12 23:24:35,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:35,464 INFO L225 Difference]: With dead ends: 3868 [2021-11-12 23:24:35,464 INFO L226 Difference]: Without dead ends: 3782 [2021-11-12 23:24:35,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=540, Invalid=1530, Unknown=0, NotChecked=0, Total=2070 [2021-11-12 23:24:35,466 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 216 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 2823 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1745.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.43ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2055.30ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:35,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 82 Invalid, 2869 Unknown, 0 Unchecked, 8.43ms Time], IncrementalHoareTripleChecker [46 Valid, 2823 Invalid, 0 Unknown, 0 Unchecked, 2055.30ms Time] [2021-11-12 23:24:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2021-11-12 23:24:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 2700. [2021-11-12 23:24:35,591 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-12 23:24:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 8692 transitions. [2021-11-12 23:24:35,603 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 8692 transitions. Word has length 25 [2021-11-12 23:24:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:35,603 INFO L470 AbstractCegarLoop]: Abstraction has 2700 states and 8692 transitions. [2021-11-12 23:24:35,603 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-12 23:24:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 8692 transitions. [2021-11-12 23:24:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:24:35,610 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:35,611 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-12 23:24:35,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-12 23:24:35,612 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-12 23:24:35,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1791762257, now seen corresponding path program 1 times [2021-11-12 23:24:35,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:35,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314537627] [2021-11-12 23:24:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:35,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:36,293 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-12 23:24:36,293 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:36,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314537627] [2021-11-12 23:24:36,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314537627] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:36,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:36,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:24:36,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638058670] [2021-11-12 23:24:36,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:36,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:24:36,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:36,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:24:36,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:24:36,297 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-12 23:24:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:37,824 INFO L93 Difference]: Finished difference Result 4642 states and 15110 transitions. [2021-11-12 23:24:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-12 23:24:37,825 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-12 23:24:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:37,835 INFO L225 Difference]: With dead ends: 4642 [2021-11-12 23:24:37,835 INFO L226 Difference]: Without dead ends: 4642 [2021-11-12 23:24:37,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2021-11-12 23:24:37,836 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 247 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 936.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.09ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1109.53ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:37,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 58 Invalid, 1731 Unknown, 0 Unchecked, 5.09ms Time], IncrementalHoareTripleChecker [20 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 1109.53ms Time] [2021-11-12 23:24:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4642 states. [2021-11-12 23:24:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4642 to 3838. [2021-11-12 23:24:37,973 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-12 23:24:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 12358 transitions. [2021-11-12 23:24:37,989 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 12358 transitions. Word has length 27 [2021-11-12 23:24:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:37,989 INFO L470 AbstractCegarLoop]: Abstraction has 3838 states and 12358 transitions. [2021-11-12 23:24:37,989 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-12 23:24:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 12358 transitions. [2021-11-12 23:24:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:24:37,999 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:37,999 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-12 23:24:37,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-12 23:24:38,000 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:24:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1183722421, now seen corresponding path program 1 times [2021-11-12 23:24:38,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:38,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931458294] [2021-11-12 23:24:38,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:38,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:38,736 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-12 23:24:38,736 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:38,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931458294] [2021-11-12 23:24:38,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931458294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:38,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:38,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:24:38,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413133594] [2021-11-12 23:24:38,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:38,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:24:38,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:38,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:24:38,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:24:38,738 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-12 23:24:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:40,953 INFO L93 Difference]: Finished difference Result 5790 states and 18806 transitions. [2021-11-12 23:24:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:24:40,954 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-12 23:24:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:40,969 INFO L225 Difference]: With dead ends: 5790 [2021-11-12 23:24:40,969 INFO L226 Difference]: Without dead ends: 5790 [2021-11-12 23:24:40,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2021-11-12 23:24:40,971 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 283 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1226.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.25ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1450.30ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:40,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 75 Invalid, 2195 Unknown, 0 Unchecked, 6.25ms Time], IncrementalHoareTripleChecker [29 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 1450.30ms Time] [2021-11-12 23:24:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5790 states. [2021-11-12 23:24:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5790 to 4426. [2021-11-12 23:24:41,139 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-12 23:24:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 14162 transitions. [2021-11-12 23:24:41,163 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 14162 transitions. Word has length 27 [2021-11-12 23:24:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:41,164 INFO L470 AbstractCegarLoop]: Abstraction has 4426 states and 14162 transitions. [2021-11-12 23:24:41,164 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-12 23:24:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 14162 transitions. [2021-11-12 23:24:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:24:41,178 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:41,178 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-12 23:24:41,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-12 23:24:41,179 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-12 23:24:41,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1747595345, now seen corresponding path program 2 times [2021-11-12 23:24:41,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:41,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823376702] [2021-11-12 23:24:41,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:41,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:41,851 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-12 23:24:41,851 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:41,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823376702] [2021-11-12 23:24:41,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823376702] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:41,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:41,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:24:41,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741096615] [2021-11-12 23:24:41,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:41,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:24:41,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:41,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:24:41,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:24:41,854 INFO L87 Difference]: Start difference. First operand 4426 states and 14162 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-12 23:24:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:43,661 INFO L93 Difference]: Finished difference Result 6232 states and 20286 transitions. [2021-11-12 23:24:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-12 23:24:43,661 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-12 23:24:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:43,681 INFO L225 Difference]: With dead ends: 6232 [2021-11-12 23:24:43,681 INFO L226 Difference]: Without dead ends: 6232 [2021-11-12 23:24:43,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:24:43,682 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 309 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1127.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.95ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1328.99ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:43,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 69 Invalid, 1922 Unknown, 0 Unchecked, 5.95ms Time], IncrementalHoareTripleChecker [22 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 1328.99ms Time] [2021-11-12 23:24:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2021-11-12 23:24:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 5428. [2021-11-12 23:24:43,939 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-12 23:24:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 17492 transitions. [2021-11-12 23:24:43,962 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 17492 transitions. Word has length 27 [2021-11-12 23:24:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:43,963 INFO L470 AbstractCegarLoop]: Abstraction has 5428 states and 17492 transitions. [2021-11-12 23:24:43,963 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-12 23:24:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 17492 transitions. [2021-11-12 23:24:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:24:43,978 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:43,978 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-12 23:24:43,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-12 23:24:43,979 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:24:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1747595336, now seen corresponding path program 1 times [2021-11-12 23:24:43,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:43,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374483944] [2021-11-12 23:24:43,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:43,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:44,579 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-12 23:24:44,579 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:44,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374483944] [2021-11-12 23:24:44,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374483944] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:44,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:44,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:24:44,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433119797] [2021-11-12 23:24:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:44,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:24:44,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:24:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:24:44,584 INFO L87 Difference]: Start difference. First operand 5428 states and 17492 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-12 23:24:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:46,332 INFO L93 Difference]: Finished difference Result 6232 states and 20172 transitions. [2021-11-12 23:24:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-12 23:24:46,332 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-12 23:24:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:46,347 INFO L225 Difference]: With dead ends: 6232 [2021-11-12 23:24:46,347 INFO L226 Difference]: Without dead ends: 6232 [2021-11-12 23:24:46,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:24:46,348 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 273 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1105.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.79ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1300.55ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:46,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 73 Invalid, 2066 Unknown, 0 Unchecked, 5.79ms Time], IncrementalHoareTripleChecker [19 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1300.55ms Time] [2021-11-12 23:24:46,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2021-11-12 23:24:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 4290. [2021-11-12 23:24:46,535 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-12 23:24:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 13754 transitions. [2021-11-12 23:24:46,552 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 13754 transitions. Word has length 27 [2021-11-12 23:24:46,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:46,553 INFO L470 AbstractCegarLoop]: Abstraction has 4290 states and 13754 transitions. [2021-11-12 23:24:46,553 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-12 23:24:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 13754 transitions. [2021-11-12 23:24:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:24:46,564 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:46,564 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-12 23:24:46,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-12 23:24:46,564 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:24:46,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:46,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1339901129, now seen corresponding path program 3 times [2021-11-12 23:24:46,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:46,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454740897] [2021-11-12 23:24:46,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:46,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:24:47,143 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:47,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454740897] [2021-11-12 23:24:47,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454740897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:47,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:47,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:24:47,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286999008] [2021-11-12 23:24:47,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:47,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:24:47,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:47,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:24:47,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:24:47,144 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-12 23:24:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:49,037 INFO L93 Difference]: Finished difference Result 5952 states and 19446 transitions. [2021-11-12 23:24:49,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-12 23:24:49,038 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-12 23:24:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:49,051 INFO L225 Difference]: With dead ends: 5952 [2021-11-12 23:24:49,051 INFO L226 Difference]: Without dead ends: 5952 [2021-11-12 23:24:49,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2021-11-12 23:24:49,052 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 268 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 2087 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1089.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.81ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1285.35ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:49,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 80 Invalid, 2111 Unknown, 0 Unchecked, 5.81ms Time], IncrementalHoareTripleChecker [24 Valid, 2087 Invalid, 0 Unknown, 0 Unchecked, 1285.35ms Time] [2021-11-12 23:24:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2021-11-12 23:24:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 5148. [2021-11-12 23:24:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 5144 states have (on average 3.2371695178849142) internal successors, (16652), 5147 states have internal predecessors, (16652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 16652 transitions. [2021-11-12 23:24:49,275 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 16652 transitions. Word has length 27 [2021-11-12 23:24:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:49,275 INFO L470 AbstractCegarLoop]: Abstraction has 5148 states and 16652 transitions. [2021-11-12 23:24:49,276 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-12 23:24:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 16652 transitions. [2021-11-12 23:24:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:24:49,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:49,288 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-12 23:24:49,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-12 23:24:49,289 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:24:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1339901120, now seen corresponding path program 2 times [2021-11-12 23:24:49,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:49,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887640264] [2021-11-12 23:24:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:49,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:49,861 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-12 23:24:49,862 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:49,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887640264] [2021-11-12 23:24:49,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887640264] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:49,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:49,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:24:49,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189517268] [2021-11-12 23:24:49,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:49,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:24:49,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:24:49,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:24:49,864 INFO L87 Difference]: Start difference. First operand 5148 states and 16652 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-12 23:24:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:51,668 INFO L93 Difference]: Finished difference Result 5952 states and 19332 transitions. [2021-11-12 23:24:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-12 23:24:51,669 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-12 23:24:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:51,681 INFO L225 Difference]: With dead ends: 5952 [2021-11-12 23:24:51,682 INFO L226 Difference]: Without dead ends: 5952 [2021-11-12 23:24:51,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2021-11-12 23:24:51,683 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 243 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1107.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.79ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1315.73ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:51,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 86 Invalid, 2362 Unknown, 0 Unchecked, 5.79ms Time], IncrementalHoareTripleChecker [20 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 1315.73ms Time] [2021-11-12 23:24:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2021-11-12 23:24:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 4080. [2021-11-12 23:24:51,838 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-12 23:24:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 13124 transitions. [2021-11-12 23:24:51,861 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 13124 transitions. Word has length 27 [2021-11-12 23:24:51,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:51,862 INFO L470 AbstractCegarLoop]: Abstraction has 4080 states and 13124 transitions. [2021-11-12 23:24:51,862 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-12 23:24:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 13124 transitions. [2021-11-12 23:24:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:24:51,874 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:51,874 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-12 23:24:51,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-12 23:24:51,875 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-12 23:24:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -148961921, now seen corresponding path program 4 times [2021-11-12 23:24:51,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:51,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796238711] [2021-11-12 23:24:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:51,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:52,665 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-12 23:24:52,665 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:52,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796238711] [2021-11-12 23:24:52,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796238711] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:52,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:52,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:24:52,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861384043] [2021-11-12 23:24:52,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:52,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:24:52,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:52,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:24:52,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:24:52,668 INFO L87 Difference]: Start difference. First operand 4080 states and 13124 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-12 23:24:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:54,404 INFO L93 Difference]: Finished difference Result 5672 states and 18492 transitions. [2021-11-12 23:24:54,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-12 23:24:54,405 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-12 23:24:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:54,416 INFO L225 Difference]: With dead ends: 5672 [2021-11-12 23:24:54,416 INFO L226 Difference]: Without dead ends: 5672 [2021-11-12 23:24:54,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:24:54,417 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 299 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1091.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.40ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1283.26ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:54,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 72 Invalid, 2062 Unknown, 0 Unchecked, 5.40ms Time], IncrementalHoareTripleChecker [23 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 1283.26ms Time] [2021-11-12 23:24:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5672 states. [2021-11-12 23:24:54,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5672 to 4010. [2021-11-12 23:24:54,501 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-12 23:24:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 12914 transitions. [2021-11-12 23:24:54,516 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 12914 transitions. Word has length 27 [2021-11-12 23:24:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:54,517 INFO L470 AbstractCegarLoop]: Abstraction has 4010 states and 12914 transitions. [2021-11-12 23:24:54,517 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-12 23:24:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 12914 transitions. [2021-11-12 23:24:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:24:54,527 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:54,527 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-12 23:24:54,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-12 23:24:54,528 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:24:54,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2025857443, now seen corresponding path program 5 times [2021-11-12 23:24:54,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:54,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984628348] [2021-11-12 23:24:54,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:54,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:55,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-12 23:24:55,142 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:55,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984628348] [2021-11-12 23:24:55,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984628348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:55,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:55,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:24:55,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289501551] [2021-11-12 23:24:55,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:55,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:24:55,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:55,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:24:55,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:24:55,145 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-12 23:24:56,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:56,746 INFO L93 Difference]: Finished difference Result 5462 states and 17956 transitions. [2021-11-12 23:24:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-12 23:24:56,747 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-12 23:24:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:56,758 INFO L225 Difference]: With dead ends: 5462 [2021-11-12 23:24:56,759 INFO L226 Difference]: Without dead ends: 5462 [2021-11-12 23:24:56,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2021-11-12 23:24:56,760 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 257 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1909 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 941.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.64ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1111.66ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:56,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 66 Invalid, 1931 Unknown, 0 Unchecked, 4.64ms Time], IncrementalHoareTripleChecker [22 Valid, 1909 Invalid, 0 Unknown, 0 Unchecked, 1111.66ms Time] [2021-11-12 23:24:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states. [2021-11-12 23:24:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 4658. [2021-11-12 23:24:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4658 states, 4654 states have (on average 3.2578427159432746) internal successors, (15162), 4657 states have internal predecessors, (15162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:24:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 15162 transitions. [2021-11-12 23:24:56,844 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 15162 transitions. Word has length 27 [2021-11-12 23:24:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:56,845 INFO L470 AbstractCegarLoop]: Abstraction has 4658 states and 15162 transitions. [2021-11-12 23:24:56,845 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-12 23:24:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 15162 transitions. [2021-11-12 23:24:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:24:56,855 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:56,855 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-12 23:24:56,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-12 23:24:56,855 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:24:56,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2025857452, now seen corresponding path program 3 times [2021-11-12 23:24:56,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:56,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777433296] [2021-11-12 23:24:56,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:56,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:57,412 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-12 23:24:57,412 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:57,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777433296] [2021-11-12 23:24:57,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777433296] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:57,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:57,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:24:57,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267092364] [2021-11-12 23:24:57,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:57,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:24:57,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:57,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:24:57,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:24:57,414 INFO L87 Difference]: Start difference. First operand 4658 states and 15162 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-12 23:24:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:59,033 INFO L93 Difference]: Finished difference Result 5462 states and 17842 transitions. [2021-11-12 23:24:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-12 23:24:59,033 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-12 23:24:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:59,099 INFO L225 Difference]: With dead ends: 5462 [2021-11-12 23:24:59,099 INFO L226 Difference]: Without dead ends: 5462 [2021-11-12 23:24:59,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2021-11-12 23:24:59,100 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 248 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 998.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.21ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1181.79ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:59,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 70 Invalid, 1958 Unknown, 0 Unchecked, 7.21ms Time], IncrementalHoareTripleChecker [19 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 1181.79ms Time] [2021-11-12 23:24:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states. [2021-11-12 23:24:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 3870. [2021-11-12 23:24:59,183 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-12 23:24:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 12474 transitions. [2021-11-12 23:24:59,199 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 12474 transitions. Word has length 27 [2021-11-12 23:24:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:59,199 INFO L470 AbstractCegarLoop]: Abstraction has 3870 states and 12474 transitions. [2021-11-12 23:24:59,199 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-12 23:24:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 12474 transitions. [2021-11-12 23:24:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:24:59,208 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:59,208 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-12 23:24:59,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-12 23:24:59,209 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-12 23:24:59,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:59,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1027409839, now seen corresponding path program 6 times [2021-11-12 23:24:59,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:59,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018279927] [2021-11-12 23:24:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:59,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:24:59,774 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:59,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018279927] [2021-11-12 23:24:59,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018279927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:24:59,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:24:59,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:24:59,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602783964] [2021-11-12 23:24:59,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:24:59,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:24:59,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:59,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:24:59,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:24:59,775 INFO L87 Difference]: Start difference. First operand 3870 states and 12474 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-12 23:25:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:01,747 INFO L93 Difference]: Finished difference Result 6752 states and 22303 transitions. [2021-11-12 23:25:01,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-12 23:25:01,748 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-12 23:25:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:01,762 INFO L225 Difference]: With dead ends: 6752 [2021-11-12 23:25:01,762 INFO L226 Difference]: Without dead ends: 6752 [2021-11-12 23:25:01,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2021-11-12 23:25:01,763 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 246 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1246.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.12ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1465.95ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:01,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 85 Invalid, 2424 Unknown, 0 Unchecked, 6.12ms Time], IncrementalHoareTripleChecker [19 Valid, 2405 Invalid, 0 Unknown, 0 Unchecked, 1465.95ms Time] [2021-11-12 23:25:01,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2021-11-12 23:25:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 4560. [2021-11-12 23:25:01,858 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-12 23:25:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4560 states to 4560 states and 14861 transitions. [2021-11-12 23:25:01,870 INFO L78 Accepts]: Start accepts. Automaton has 4560 states and 14861 transitions. Word has length 27 [2021-11-12 23:25:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:01,870 INFO L470 AbstractCegarLoop]: Abstraction has 4560 states and 14861 transitions. [2021-11-12 23:25:01,870 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-12 23:25:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4560 states and 14861 transitions. [2021-11-12 23:25:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:25:01,877 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:01,877 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-12 23:25:01,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-12 23:25:01,878 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-12 23:25:01,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:01,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1027409830, now seen corresponding path program 4 times [2021-11-12 23:25:01,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:01,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364953678] [2021-11-12 23:25:01,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:01,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:02,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-12 23:25:02,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:02,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364953678] [2021-11-12 23:25:02,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364953678] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:02,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:02,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:25:02,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361902107] [2021-11-12 23:25:02,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:02,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:25:02,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:02,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:25:02,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:25:02,527 INFO L87 Difference]: Start difference. First operand 4560 states and 14861 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-12 23:25:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:04,256 INFO L93 Difference]: Finished difference Result 6752 states and 22189 transitions. [2021-11-12 23:25:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-12 23:25:04,257 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-12 23:25:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:04,271 INFO L225 Difference]: With dead ends: 6752 [2021-11-12 23:25:04,271 INFO L226 Difference]: Without dead ends: 6752 [2021-11-12 23:25:04,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2021-11-12 23:25:04,272 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 330 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1048.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.41ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1235.44ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:04,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 73 Invalid, 2062 Unknown, 0 Unchecked, 5.41ms Time], IncrementalHoareTripleChecker [23 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 1235.44ms Time] [2021-11-12 23:25:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2021-11-12 23:25:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 3912. [2021-11-12 23:25:04,349 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-12 23:25:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 12613 transitions. [2021-11-12 23:25:04,358 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 12613 transitions. Word has length 27 [2021-11-12 23:25:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:04,359 INFO L470 AbstractCegarLoop]: Abstraction has 3912 states and 12613 transitions. [2021-11-12 23:25:04,359 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-12 23:25:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 12613 transitions. [2021-11-12 23:25:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:25:04,364 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:04,364 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-12 23:25:04,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-12 23:25:04,364 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-12 23:25:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash 485894865, now seen corresponding path program 2 times [2021-11-12 23:25:04,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:04,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555074464] [2021-11-12 23:25:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:04,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:05,027 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-12 23:25:05,027 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:05,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555074464] [2021-11-12 23:25:05,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555074464] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:05,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:05,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:25:05,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181387179] [2021-11-12 23:25:05,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:05,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:25:05,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:05,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:25:05,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:25:05,029 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-12 23:25:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:07,404 INFO L93 Difference]: Finished difference Result 5804 states and 18881 transitions. [2021-11-12 23:25:07,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:25:07,405 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-12 23:25:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:07,419 INFO L225 Difference]: With dead ends: 5804 [2021-11-12 23:25:07,420 INFO L226 Difference]: Without dead ends: 5804 [2021-11-12 23:25:07,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-12 23:25:07,421 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 278 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1341.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.50ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1567.31ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:07,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 84 Invalid, 2240 Unknown, 0 Unchecked, 6.50ms Time], IncrementalHoareTripleChecker [27 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1567.31ms Time] [2021-11-12 23:25:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2021-11-12 23:25:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 3852. [2021-11-12 23:25:07,515 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-12 23:25:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 12433 transitions. [2021-11-12 23:25:07,525 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 12433 transitions. Word has length 27 [2021-11-12 23:25:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:07,525 INFO L470 AbstractCegarLoop]: Abstraction has 3852 states and 12433 transitions. [2021-11-12 23:25:07,525 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-12 23:25:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 12433 transitions. [2021-11-12 23:25:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:25:07,531 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:07,531 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-12 23:25:07,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-12 23:25:07,532 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-12 23:25:07,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:07,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1058522523, now seen corresponding path program 3 times [2021-11-12 23:25:07,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:07,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719166717] [2021-11-12 23:25:07,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:07,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:08,182 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-12 23:25:08,182 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:08,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719166717] [2021-11-12 23:25:08,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719166717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:08,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:08,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:25:08,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724858979] [2021-11-12 23:25:08,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:08,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:25:08,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:08,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:25:08,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:25:08,183 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-12 23:25:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:10,117 INFO L93 Difference]: Finished difference Result 5618 states and 18323 transitions. [2021-11-12 23:25:10,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:25:10,118 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-12 23:25:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:10,131 INFO L225 Difference]: With dead ends: 5618 [2021-11-12 23:25:10,131 INFO L226 Difference]: Without dead ends: 5618 [2021-11-12 23:25:10,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-12 23:25:10,132 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 275 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1123.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.69ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1327.51ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:10,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 89 Invalid, 2380 Unknown, 0 Unchecked, 5.69ms Time], IncrementalHoareTripleChecker [26 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 1327.51ms Time] [2021-11-12 23:25:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5618 states. [2021-11-12 23:25:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5618 to 3726. [2021-11-12 23:25:10,208 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-12 23:25:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 12055 transitions. [2021-11-12 23:25:10,217 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 12055 transitions. Word has length 27 [2021-11-12 23:25:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:10,217 INFO L470 AbstractCegarLoop]: Abstraction has 3726 states and 12055 transitions. [2021-11-12 23:25:10,217 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-12 23:25:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 12055 transitions. [2021-11-12 23:25:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:25:10,223 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:10,223 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-12 23:25:10,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-12 23:25:10,224 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-12 23:25:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1671639415, now seen corresponding path program 4 times [2021-11-12 23:25:10,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:10,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837213700] [2021-11-12 23:25:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:10,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:10,932 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-12 23:25:10,932 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:10,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837213700] [2021-11-12 23:25:10,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837213700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:10,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:10,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-12 23:25:10,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982941659] [2021-11-12 23:25:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:10,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-12 23:25:10,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:10,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-12 23:25:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-12 23:25:10,934 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-12 23:25:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:12,965 INFO L93 Difference]: Finished difference Result 5498 states and 17963 transitions. [2021-11-12 23:25:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:25:12,966 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-12 23:25:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:12,979 INFO L225 Difference]: With dead ends: 5498 [2021-11-12 23:25:12,979 INFO L226 Difference]: Without dead ends: 5498 [2021-11-12 23:25:12,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-12 23:25:12,980 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 353 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1138.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.60ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1341.02ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:12,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 78 Invalid, 2093 Unknown, 0 Unchecked, 5.60ms Time], IncrementalHoareTripleChecker [30 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 1341.02ms Time] [2021-11-12 23:25:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5498 states. [2021-11-12 23:25:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5498 to 3546. [2021-11-12 23:25:13,060 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-12 23:25:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 11515 transitions. [2021-11-12 23:25:13,070 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 11515 transitions. Word has length 27 [2021-11-12 23:25:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:13,070 INFO L470 AbstractCegarLoop]: Abstraction has 3546 states and 11515 transitions. [2021-11-12 23:25:13,071 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-12 23:25:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 11515 transitions. [2021-11-12 23:25:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:25:13,075 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:13,075 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-12 23:25:13,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-12 23:25:13,075 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-12 23:25:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash 978343143, now seen corresponding path program 5 times [2021-11-12 23:25:13,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:13,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033527363] [2021-11-12 23:25:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:13,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:13,977 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-12 23:25:13,978 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:13,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033527363] [2021-11-12 23:25:13,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033527363] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:13,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:13,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:25:13,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364416377] [2021-11-12 23:25:13,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:13,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-12 23:25:13,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-12 23:25:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-12 23:25:13,979 INFO L87 Difference]: Start difference. First operand 3546 states and 11515 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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-12 23:25:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:16,640 INFO L93 Difference]: Finished difference Result 5138 states and 16883 transitions. [2021-11-12 23:25:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-12 23:25:16,640 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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-12 23:25:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:16,653 INFO L225 Difference]: With dead ends: 5138 [2021-11-12 23:25:16,653 INFO L226 Difference]: Without dead ends: 5138 [2021-11-12 23:25:16,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2021-11-12 23:25:16,655 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 341 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1502.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.57ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1761.47ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:16,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 91 Invalid, 2397 Unknown, 0 Unchecked, 7.57ms Time], IncrementalHoareTripleChecker [30 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 1761.47ms Time] [2021-11-12 23:25:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2021-11-12 23:25:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 3546. [2021-11-12 23:25:16,740 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-12 23:25:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 11515 transitions. [2021-11-12 23:25:16,751 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 11515 transitions. Word has length 27 [2021-11-12 23:25:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:16,751 INFO L470 AbstractCegarLoop]: Abstraction has 3546 states and 11515 transitions. [2021-11-12 23:25:16,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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-12 23:25:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 11515 transitions. [2021-11-12 23:25:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:25:16,756 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:16,756 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-12 23:25:16,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-12 23:25:16,757 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-12 23:25:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:16,757 INFO L85 PathProgramCache]: Analyzing trace with hash -772704601, now seen corresponding path program 6 times [2021-11-12 23:25:16,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:16,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755603732] [2021-11-12 23:25:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:16,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:17,489 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-12 23:25:17,489 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:17,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755603732] [2021-11-12 23:25:17,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755603732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:17,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:17,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:25:17,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962823970] [2021-11-12 23:25:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:17,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-12 23:25:17,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-12 23:25:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-12 23:25:17,491 INFO L87 Difference]: Start difference. First operand 3546 states and 11515 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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-12 23:25:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:20,043 INFO L93 Difference]: Finished difference Result 7016 states and 23302 transitions. [2021-11-12 23:25:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:25:20,043 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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-12 23:25:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:20,058 INFO L225 Difference]: With dead ends: 7016 [2021-11-12 23:25:20,058 INFO L226 Difference]: Without dead ends: 7016 [2021-11-12 23:25:20,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:25:20,060 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 296 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 2814 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1497.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.12ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1762.06ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:20,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 105 Invalid, 2842 Unknown, 0 Unchecked, 7.12ms Time], IncrementalHoareTripleChecker [28 Valid, 2814 Invalid, 0 Unknown, 0 Unchecked, 1762.06ms Time] [2021-11-12 23:25:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2021-11-12 23:25:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 3552. [2021-11-12 23:25:20,156 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-12 23:25:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 11534 transitions. [2021-11-12 23:25:20,165 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 11534 transitions. Word has length 27 [2021-11-12 23:25:20,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:20,165 INFO L470 AbstractCegarLoop]: Abstraction has 3552 states and 11534 transitions. [2021-11-12 23:25:20,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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-12 23:25:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 11534 transitions. [2021-11-12 23:25:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-12 23:25:20,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:20,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-12 23:25:20,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-12 23:25:20,169 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-12 23:25:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1166751201, now seen corresponding path program 7 times [2021-11-12 23:25:20,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:20,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917888174] [2021-11-12 23:25:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:20,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:20,874 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-12 23:25:20,874 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:20,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917888174] [2021-11-12 23:25:20,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917888174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:20,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:20,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-12 23:25:20,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924081315] [2021-11-12 23:25:20,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:20,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-12 23:25:20,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:20,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-12 23:25:20,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-12 23:25:20,875 INFO L87 Difference]: Start difference. First operand 3552 states and 11534 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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-12 23:25:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:22,871 INFO L93 Difference]: Finished difference Result 5074 states and 16682 transitions. [2021-11-12 23:25:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:25:22,872 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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-12 23:25:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:22,883 INFO L225 Difference]: With dead ends: 5074 [2021-11-12 23:25:22,883 INFO L226 Difference]: Without dead ends: 5074 [2021-11-12 23:25:22,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2021-11-12 23:25:22,886 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 347 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1139.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.12ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1335.60ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:22,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 87 Invalid, 2280 Unknown, 0 Unchecked, 5.12ms Time], IncrementalHoareTripleChecker [32 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 1335.60ms Time] [2021-11-12 23:25:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2021-11-12 23:25:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 3352. [2021-11-12 23:25:22,959 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-12 23:25:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 10914 transitions. [2021-11-12 23:25:22,968 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 10914 transitions. Word has length 27 [2021-11-12 23:25:22,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:22,968 INFO L470 AbstractCegarLoop]: Abstraction has 3352 states and 10914 transitions. [2021-11-12 23:25:22,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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-12 23:25:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 10914 transitions. [2021-11-12 23:25:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:25:22,972 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:22,972 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-12 23:25:22,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-12 23:25:22,972 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:25:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:22,972 INFO L85 PathProgramCache]: Analyzing trace with hash -536695196, now seen corresponding path program 1 times [2021-11-12 23:25:22,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:22,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748561746] [2021-11-12 23:25:22,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:22,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:23,325 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-12 23:25:23,325 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:23,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748561746] [2021-11-12 23:25:23,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748561746] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:23,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:23,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-12 23:25:23,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102257812] [2021-11-12 23:25:23,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:23,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:25:23,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:23,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:25:23,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:25:23,327 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-12 23:25:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:24,254 INFO L93 Difference]: Finished difference Result 9472 states and 31200 transitions. [2021-11-12 23:25:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-12 23:25:24,255 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-12 23:25:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:24,275 INFO L225 Difference]: With dead ends: 9472 [2021-11-12 23:25:24,275 INFO L226 Difference]: Without dead ends: 9472 [2021-11-12 23:25:24,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2021-11-12 23:25:24,277 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 478 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 460.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.63ms SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 546.25ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:24,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 22 Invalid, 844 Unknown, 0 Unchecked, 2.63ms Time], IncrementalHoareTripleChecker [79 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 546.25ms Time] [2021-11-12 23:25:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9472 states. [2021-11-12 23:25:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9472 to 7470. [2021-11-12 23:25:24,476 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-12 23:25:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 25092 transitions. [2021-11-12 23:25:24,496 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 25092 transitions. Word has length 30 [2021-11-12 23:25:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:24,496 INFO L470 AbstractCegarLoop]: Abstraction has 7470 states and 25092 transitions. [2021-11-12 23:25:24,496 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-12 23:25:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 25092 transitions. [2021-11-12 23:25:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:25:24,504 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:24,504 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-12 23:25:24,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-12 23:25:24,505 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-12 23:25:24,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1700971848, now seen corresponding path program 1 times [2021-11-12 23:25:24,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:24,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87406048] [2021-11-12 23:25:24,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:24,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:24,879 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-12 23:25:24,879 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:24,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87406048] [2021-11-12 23:25:24,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87406048] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:24,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:24,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-12 23:25:24,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89901262] [2021-11-12 23:25:24,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:24,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:25:24,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:25:24,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:25:24,881 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-12 23:25:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:26,200 INFO L93 Difference]: Finished difference Result 12164 states and 40772 transitions. [2021-11-12 23:25:26,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-12 23:25:26,201 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-12 23:25:26,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:26,225 INFO L225 Difference]: With dead ends: 12164 [2021-11-12 23:25:26,225 INFO L226 Difference]: Without dead ends: 12164 [2021-11-12 23:25:26,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-11-12 23:25:26,225 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 381 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 747.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.97ms SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 882.52ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:26,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 34 Invalid, 1388 Unknown, 0 Unchecked, 3.97ms Time], IncrementalHoareTripleChecker [48 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 882.52ms Time] [2021-11-12 23:25:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12164 states. [2021-11-12 23:25:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12164 to 9302. [2021-11-12 23:25:26,370 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-12 23:25:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9302 states to 9302 states and 31370 transitions. [2021-11-12 23:25:26,391 INFO L78 Accepts]: Start accepts. Automaton has 9302 states and 31370 transitions. Word has length 30 [2021-11-12 23:25:26,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:26,391 INFO L470 AbstractCegarLoop]: Abstraction has 9302 states and 31370 transitions. [2021-11-12 23:25:26,391 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-12 23:25:26,391 INFO L276 IsEmpty]: Start isEmpty. Operand 9302 states and 31370 transitions. [2021-11-12 23:25:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:25:26,400 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:26,401 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-12 23:25:26,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-12 23:25:26,401 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-12 23:25:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -981490814, now seen corresponding path program 2 times [2021-11-12 23:25:26,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:26,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410156572] [2021-11-12 23:25:26,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:26,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:26,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-12 23:25:26,666 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:26,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410156572] [2021-11-12 23:25:26,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410156572] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:26,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:26,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-12 23:25:26,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372945373] [2021-11-12 23:25:26,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:26,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-12 23:25:26,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:26,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-12 23:25:26,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-12 23:25:26,668 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-12 23:25:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:27,943 INFO L93 Difference]: Finished difference Result 16084 states and 53591 transitions. [2021-11-12 23:25:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:25:27,943 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-12 23:25:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:27,988 INFO L225 Difference]: With dead ends: 16084 [2021-11-12 23:25:27,988 INFO L226 Difference]: Without dead ends: 16084 [2021-11-12 23:25:27,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-11-12 23:25:27,989 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 454 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 623.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.44ms SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 739.42ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:27,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 42 Invalid, 1071 Unknown, 0 Unchecked, 3.44ms Time], IncrementalHoareTripleChecker [64 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 739.42ms Time] [2021-11-12 23:25:28,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16084 states. [2021-11-12 23:25:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16084 to 9030. [2021-11-12 23:25:28,218 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-12 23:25:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9030 states to 9030 states and 30252 transitions. [2021-11-12 23:25:28,245 INFO L78 Accepts]: Start accepts. Automaton has 9030 states and 30252 transitions. Word has length 30 [2021-11-12 23:25:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:28,245 INFO L470 AbstractCegarLoop]: Abstraction has 9030 states and 30252 transitions. [2021-11-12 23:25:28,245 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-12 23:25:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 9030 states and 30252 transitions. [2021-11-12 23:25:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:25:28,258 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:28,258 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-12 23:25:28,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-12 23:25:28,258 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-12 23:25:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash -432366582, now seen corresponding path program 3 times [2021-11-12 23:25:28,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:28,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003233002] [2021-11-12 23:25:28,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:28,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:28,603 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-12 23:25:28,604 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:28,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003233002] [2021-11-12 23:25:28,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003233002] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:28,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:28,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-12 23:25:28,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065710189] [2021-11-12 23:25:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:28,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-12 23:25:28,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-12 23:25:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-12 23:25:28,606 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-12 23:25:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:30,150 INFO L93 Difference]: Finished difference Result 16030 states and 53672 transitions. [2021-11-12 23:25:30,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:25:30,151 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-12 23:25:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:30,192 INFO L225 Difference]: With dead ends: 16030 [2021-11-12 23:25:30,192 INFO L226 Difference]: Without dead ends: 16030 [2021-11-12 23:25:30,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2021-11-12 23:25:30,193 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 423 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 765.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.44ms SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 909.79ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:30,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 74 Invalid, 1335 Unknown, 0 Unchecked, 4.44ms Time], IncrementalHoareTripleChecker [55 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 909.79ms Time] [2021-11-12 23:25:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16030 states. [2021-11-12 23:25:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16030 to 7370. [2021-11-12 23:25:30,451 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-12 23:25:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7370 states to 7370 states and 24567 transitions. [2021-11-12 23:25:30,471 INFO L78 Accepts]: Start accepts. Automaton has 7370 states and 24567 transitions. Word has length 30 [2021-11-12 23:25:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:30,472 INFO L470 AbstractCegarLoop]: Abstraction has 7370 states and 24567 transitions. [2021-11-12 23:25:30,472 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-12 23:25:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 7370 states and 24567 transitions. [2021-11-12 23:25:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:25:30,482 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:30,482 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-12 23:25:30,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-12 23:25:30,482 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-12 23:25:30,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1253284098, now seen corresponding path program 2 times [2021-11-12 23:25:30,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:30,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493318681] [2021-11-12 23:25:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:30,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:30,793 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-12 23:25:30,793 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:30,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493318681] [2021-11-12 23:25:30,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493318681] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:30,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:30,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-12 23:25:30,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855617265] [2021-11-12 23:25:30,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:30,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:25:30,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:30,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:25:30,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:25:30,795 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-12 23:25:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:32,201 INFO L93 Difference]: Finished difference Result 14448 states and 48158 transitions. [2021-11-12 23:25:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-12 23:25:32,201 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-12 23:25:32,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:32,238 INFO L225 Difference]: With dead ends: 14448 [2021-11-12 23:25:32,238 INFO L226 Difference]: Without dead ends: 14448 [2021-11-12 23:25:32,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:25:32,239 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 372 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 748.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.14ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 883.51ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:32,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 46 Invalid, 1296 Unknown, 0 Unchecked, 4.14ms Time], IncrementalHoareTripleChecker [40 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 883.51ms Time] [2021-11-12 23:25:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14448 states. [2021-11-12 23:25:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14448 to 8808. [2021-11-12 23:25:32,431 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-12 23:25:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8808 states to 8808 states and 29855 transitions. [2021-11-12 23:25:32,456 INFO L78 Accepts]: Start accepts. Automaton has 8808 states and 29855 transitions. Word has length 30 [2021-11-12 23:25:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:32,456 INFO L470 AbstractCegarLoop]: Abstraction has 8808 states and 29855 transitions. [2021-11-12 23:25:32,456 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-12 23:25:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8808 states and 29855 transitions. [2021-11-12 23:25:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:25:32,472 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:32,472 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-12 23:25:32,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-12 23:25:32,472 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-12 23:25:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:32,473 INFO L85 PathProgramCache]: Analyzing trace with hash 793743864, now seen corresponding path program 3 times [2021-11-12 23:25:32,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:32,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737769398] [2021-11-12 23:25:32,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:32,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:32,827 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-12 23:25:32,827 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:32,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737769398] [2021-11-12 23:25:32,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737769398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:32,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:32,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-12 23:25:32,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245100198] [2021-11-12 23:25:32,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:32,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:25:32,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:32,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:25:32,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:25:32,829 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-12 23:25:34,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:34,266 INFO L93 Difference]: Finished difference Result 15696 states and 52460 transitions. [2021-11-12 23:25:34,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:25:34,267 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-12 23:25:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:34,309 INFO L225 Difference]: With dead ends: 15696 [2021-11-12 23:25:34,309 INFO L226 Difference]: Without dead ends: 15696 [2021-11-12 23:25:34,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2021-11-12 23:25:34,310 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 473 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 728.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.82ms SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 867.58ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:34,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [473 Valid, 77 Invalid, 1521 Unknown, 0 Unchecked, 3.82ms Time], IncrementalHoareTripleChecker [51 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 867.58ms Time] [2021-11-12 23:25:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15696 states. [2021-11-12 23:25:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15696 to 8868. [2021-11-12 23:25:34,531 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-12 23:25:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8868 states to 8868 states and 30081 transitions. [2021-11-12 23:25:34,554 INFO L78 Accepts]: Start accepts. Automaton has 8868 states and 30081 transitions. Word has length 30 [2021-11-12 23:25:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:34,555 INFO L470 AbstractCegarLoop]: Abstraction has 8868 states and 30081 transitions. [2021-11-12 23:25:34,555 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-12 23:25:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 8868 states and 30081 transitions. [2021-11-12 23:25:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:25:34,575 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:34,575 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-12 23:25:34,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-12 23:25:34,575 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-12 23:25:34,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:34,576 INFO L85 PathProgramCache]: Analyzing trace with hash 335133258, now seen corresponding path program 4 times [2021-11-12 23:25:34,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:34,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117077119] [2021-11-12 23:25:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:34,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:34,857 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-12 23:25:34,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:34,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117077119] [2021-11-12 23:25:34,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117077119] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:34,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:34,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-12 23:25:34,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442959198] [2021-11-12 23:25:34,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:34,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:25:34,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:34,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:25:34,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:25:34,859 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-12 23:25:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:36,680 INFO L93 Difference]: Finished difference Result 16296 states and 54962 transitions. [2021-11-12 23:25:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-12 23:25:36,680 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-12 23:25:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:36,728 INFO L225 Difference]: With dead ends: 16296 [2021-11-12 23:25:36,728 INFO L226 Difference]: Without dead ends: 16296 [2021-11-12 23:25:36,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2021-11-12 23:25:36,729 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 454 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 864.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.55ms SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1083.47ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:36,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 109 Invalid, 1777 Unknown, 0 Unchecked, 4.55ms Time], IncrementalHoareTripleChecker [42 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1083.47ms Time] [2021-11-12 23:25:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16296 states. [2021-11-12 23:25:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16296 to 8016. [2021-11-12 23:25:36,957 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-12 23:25:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8016 states to 8016 states and 27358 transitions. [2021-11-12 23:25:36,978 INFO L78 Accepts]: Start accepts. Automaton has 8016 states and 27358 transitions. Word has length 30 [2021-11-12 23:25:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:36,979 INFO L470 AbstractCegarLoop]: Abstraction has 8016 states and 27358 transitions. [2021-11-12 23:25:36,979 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-12 23:25:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 8016 states and 27358 transitions. [2021-11-12 23:25:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:25:36,990 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:36,990 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-12 23:25:36,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-12 23:25:36,991 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:25:36,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash 847172721, now seen corresponding path program 1 times [2021-11-12 23:25:36,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:36,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126126821] [2021-11-12 23:25:36,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:36,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:37,610 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-12 23:25:37,610 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:37,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126126821] [2021-11-12 23:25:37,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126126821] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:37,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:37,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:25:37,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775158888] [2021-11-12 23:25:37,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:37,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:25:37,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:37,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:25:37,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:25:37,612 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-12 23:25:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:48,010 INFO L93 Difference]: Finished difference Result 9330 states and 31396 transitions. [2021-11-12 23:25:48,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-11-12 23:25:48,011 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-12 23:25:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:48,032 INFO L225 Difference]: With dead ends: 9330 [2021-11-12 23:25:48,033 INFO L226 Difference]: Without dead ends: 9262 [2021-11-12 23:25:48,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2113 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2042, Invalid=7270, Unknown=0, NotChecked=0, Total=9312 [2021-11-12 23:25:48,036 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 301 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 4835 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2493.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 4934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.47ms SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 4835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2909.69ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:48,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 214 Invalid, 4934 Unknown, 0 Unchecked, 10.47ms Time], IncrementalHoareTripleChecker [99 Valid, 4835 Invalid, 0 Unknown, 0 Unchecked, 2909.69ms Time] [2021-11-12 23:25:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9262 states. [2021-11-12 23:25:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9262 to 8656. [2021-11-12 23:25:48,185 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-12 23:25:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8656 states to 8656 states and 29318 transitions. [2021-11-12 23:25:48,209 INFO L78 Accepts]: Start accepts. Automaton has 8656 states and 29318 transitions. Word has length 31 [2021-11-12 23:25:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:48,209 INFO L470 AbstractCegarLoop]: Abstraction has 8656 states and 29318 transitions. [2021-11-12 23:25:48,209 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-12 23:25:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 8656 states and 29318 transitions. [2021-11-12 23:25:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:25:48,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:48,220 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-12 23:25:48,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-12 23:25:48,220 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:25:48,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:48,221 INFO L85 PathProgramCache]: Analyzing trace with hash 542321165, now seen corresponding path program 1 times [2021-11-12 23:25:48,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:48,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833161381] [2021-11-12 23:25:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:48,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:25:49,095 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:49,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833161381] [2021-11-12 23:25:49,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833161381] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:49,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:49,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:25:49,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909837481] [2021-11-12 23:25:49,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:49,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:25:49,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:25:49,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:25:49,097 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-12 23:25:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:51,513 INFO L93 Difference]: Finished difference Result 10144 states and 34147 transitions. [2021-11-12 23:25:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-12 23:25:51,513 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-12 23:25:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:51,536 INFO L225 Difference]: With dead ends: 10144 [2021-11-12 23:25:51,536 INFO L226 Difference]: Without dead ends: 10144 [2021-11-12 23:25:51,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:25:51,537 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 340 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 2837 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1480.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.72ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1730.94ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:51,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 69 Invalid, 2861 Unknown, 0 Unchecked, 6.72ms Time], IncrementalHoareTripleChecker [24 Valid, 2837 Invalid, 0 Unknown, 0 Unchecked, 1730.94ms Time] [2021-11-12 23:25:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10144 states. [2021-11-12 23:25:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10144 to 10038. [2021-11-12 23:25:51,711 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-12 23:25:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10038 states to 10038 states and 33864 transitions. [2021-11-12 23:25:51,738 INFO L78 Accepts]: Start accepts. Automaton has 10038 states and 33864 transitions. Word has length 31 [2021-11-12 23:25:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:51,738 INFO L470 AbstractCegarLoop]: Abstraction has 10038 states and 33864 transitions. [2021-11-12 23:25:51,738 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-12 23:25:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 10038 states and 33864 transitions. [2021-11-12 23:25:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:25:51,749 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:51,749 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-12 23:25:51,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-12 23:25:51,750 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-12 23:25:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1190522793, now seen corresponding path program 1 times [2021-11-12 23:25:51,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:51,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395322911] [2021-11-12 23:25:51,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:51,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:52,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-12 23:25:52,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:52,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395322911] [2021-11-12 23:25:52,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395322911] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:52,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:52,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-12 23:25:52,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147266097] [2021-11-12 23:25:52,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:52,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:25:52,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:52,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:25:52,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:25:52,762 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-12 23:25:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:55,333 INFO L93 Difference]: Finished difference Result 11106 states and 37393 transitions. [2021-11-12 23:25:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:25:55,334 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-12 23:25:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:55,358 INFO L225 Difference]: With dead ends: 11106 [2021-11-12 23:25:55,358 INFO L226 Difference]: Without dead ends: 11106 [2021-11-12 23:25:55,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:25:55,359 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 407 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 2855 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1356.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.34ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1592.05ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:55,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 74 Invalid, 2890 Unknown, 0 Unchecked, 6.34ms Time], IncrementalHoareTripleChecker [35 Valid, 2855 Invalid, 0 Unknown, 0 Unchecked, 1592.05ms Time] [2021-11-12 23:25:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11106 states. [2021-11-12 23:25:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11106 to 10756. [2021-11-12 23:25:55,536 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-12 23:25:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10756 states to 10756 states and 36285 transitions. [2021-11-12 23:25:55,565 INFO L78 Accepts]: Start accepts. Automaton has 10756 states and 36285 transitions. Word has length 31 [2021-11-12 23:25:55,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:55,566 INFO L470 AbstractCegarLoop]: Abstraction has 10756 states and 36285 transitions. [2021-11-12 23:25:55,566 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-12 23:25:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 10756 states and 36285 transitions. [2021-11-12 23:25:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:25:55,578 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:55,578 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-12 23:25:55,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-12 23:25:55,578 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:25:55,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:55,578 INFO L85 PathProgramCache]: Analyzing trace with hash -955509683, now seen corresponding path program 2 times [2021-11-12 23:25:55,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:55,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695671726] [2021-11-12 23:25:55,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:55,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:56,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-12 23:25:56,027 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:56,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695671726] [2021-11-12 23:25:56,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695671726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:25:56,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:25:56,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:25:56,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277063233] [2021-11-12 23:25:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:25:56,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-12 23:25:56,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:56,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-12 23:25:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-11-12 23:25:56,029 INFO L87 Difference]: Start difference. First operand 10756 states and 36285 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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-12 23:26:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:26:01,576 INFO L93 Difference]: Finished difference Result 13231 states and 43915 transitions. [2021-11-12 23:26:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-12 23:26:01,576 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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-12 23:26:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:26:01,610 INFO L225 Difference]: With dead ends: 13231 [2021-11-12 23:26:01,610 INFO L226 Difference]: Without dead ends: 13163 [2021-11-12 23:26:01,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1189, Invalid=3233, Unknown=0, NotChecked=0, Total=4422 [2021-11-12 23:26:01,612 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 441 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2876 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1568.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.87ms SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1846.75ms IncrementalHoareTripleChecker+Time [2021-11-12 23:26:01,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 108 Invalid, 2954 Unknown, 0 Unchecked, 6.87ms Time], IncrementalHoareTripleChecker [78 Valid, 2876 Invalid, 0 Unknown, 0 Unchecked, 1846.75ms Time] [2021-11-12 23:26:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2021-11-12 23:26:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 11266. [2021-11-12 23:26:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11266 states, 11262 states have (on average 3.3648552654945836) internal successors, (37895), 11265 states have internal predecessors, (37895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:26:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11266 states to 11266 states and 37895 transitions. [2021-11-12 23:26:01,843 INFO L78 Accepts]: Start accepts. Automaton has 11266 states and 37895 transitions. Word has length 31 [2021-11-12 23:26:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:26:01,843 INFO L470 AbstractCegarLoop]: Abstraction has 11266 states and 37895 transitions. [2021-11-12 23:26:01,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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-12 23:26:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 11266 states and 37895 transitions. [2021-11-12 23:26:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:26:01,857 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:26:01,857 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-12 23:26:01,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-12 23:26:01,858 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:26:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:26:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -361441105, now seen corresponding path program 2 times [2021-11-12 23:26:01,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:26:01,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896677683] [2021-11-12 23:26:01,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:26:01,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:26:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:26:02,720 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-12 23:26:02,721 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:26:02,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896677683] [2021-11-12 23:26:02,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896677683] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:26:02,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:26:02,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:26:02,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188170526] [2021-11-12 23:26:02,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:26:02,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:26:02,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:26:02,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:26:02,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:26:02,722 INFO L87 Difference]: Start difference. First operand 11266 states and 37895 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-12 23:26:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:26:05,504 INFO L93 Difference]: Finished difference Result 12634 states and 42364 transitions. [2021-11-12 23:26:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-12 23:26:05,504 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-12 23:26:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:26:05,533 INFO L225 Difference]: With dead ends: 12634 [2021-11-12 23:26:05,533 INFO L226 Difference]: Without dead ends: 12634 [2021-11-12 23:26:05,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:26:05,534 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 283 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3400 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1654.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.53ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1943.04ms IncrementalHoareTripleChecker+Time [2021-11-12 23:26:05,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 86 Invalid, 3418 Unknown, 0 Unchecked, 7.53ms Time], IncrementalHoareTripleChecker [18 Valid, 3400 Invalid, 0 Unknown, 0 Unchecked, 1943.04ms Time] [2021-11-12 23:26:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12634 states. [2021-11-12 23:26:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12634 to 11176. [2021-11-12 23:26:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11176 states, 11172 states have (on average 3.367794486215539) internal successors, (37625), 11175 states have internal predecessors, (37625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:26:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11176 states to 11176 states and 37625 transitions. [2021-11-12 23:26:05,768 INFO L78 Accepts]: Start accepts. Automaton has 11176 states and 37625 transitions. Word has length 31 [2021-11-12 23:26:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:26:05,769 INFO L470 AbstractCegarLoop]: Abstraction has 11176 states and 37625 transitions. [2021-11-12 23:26:05,769 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-12 23:26:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 11176 states and 37625 transitions. [2021-11-12 23:26:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:26:05,783 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:26:05,783 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-12 23:26:05,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-12 23:26:05,783 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:26:05,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:26:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1112527675, now seen corresponding path program 3 times [2021-11-12 23:26:05,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:26:05,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171812014] [2021-11-12 23:26:05,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:26:05,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:26:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:26:06,358 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-12 23:26:06,358 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:26:06,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171812014] [2021-11-12 23:26:06,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171812014] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:26:06,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:26:06,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:26:06,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447529467] [2021-11-12 23:26:06,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:26:06,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:26:06,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:26:06,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:26:06,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:26:06,361 INFO L87 Difference]: Start difference. First operand 11176 states and 37625 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-12 23:26:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:26:14,680 INFO L93 Difference]: Finished difference Result 13165 states and 43761 transitions. [2021-11-12 23:26:14,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-12 23:26:14,681 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-12 23:26:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:26:14,717 INFO L225 Difference]: With dead ends: 13165 [2021-11-12 23:26:14,717 INFO L226 Difference]: Without dead ends: 13097 [2021-11-12 23:26:14,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1506, Invalid=4656, Unknown=0, NotChecked=0, Total=6162 [2021-11-12 23:26:14,720 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 372 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 4799 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2614.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 4901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.61ms SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 4799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3073.76ms IncrementalHoareTripleChecker+Time [2021-11-12 23:26:14,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 179 Invalid, 4901 Unknown, 0 Unchecked, 11.61ms Time], IncrementalHoareTripleChecker [102 Valid, 4799 Invalid, 0 Unknown, 0 Unchecked, 3073.76ms Time] [2021-11-12 23:26:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13097 states. [2021-11-12 23:26:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13097 to 11546. [2021-11-12 23:26:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11546 states, 11542 states have (on average 3.359469762606134) internal successors, (38775), 11545 states have internal predecessors, (38775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:26:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11546 states to 11546 states and 38775 transitions. [2021-11-12 23:26:14,983 INFO L78 Accepts]: Start accepts. Automaton has 11546 states and 38775 transitions. Word has length 31 [2021-11-12 23:26:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:26:14,983 INFO L470 AbstractCegarLoop]: Abstraction has 11546 states and 38775 transitions. [2021-11-12 23:26:14,984 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-12 23:26:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 11546 states and 38775 transitions. [2021-11-12 23:26:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:26:15,002 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:26:15,002 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-12 23:26:15,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-12 23:26:15,002 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:26:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:26:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash -518459097, now seen corresponding path program 3 times [2021-11-12 23:26:15,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:26:15,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708561205] [2021-11-12 23:26:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:26:15,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:26:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:26:16,195 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-12 23:26:16,195 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:26:16,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708561205] [2021-11-12 23:26:16,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708561205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:26:16,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:26:16,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-12 23:26:16,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896763035] [2021-11-12 23:26:16,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:26:16,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:26:16,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:26:16,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:26:16,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:26:16,197 INFO L87 Difference]: Start difference. First operand 11546 states and 38775 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-12 23:26:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:26:19,394 INFO L93 Difference]: Finished difference Result 12764 states and 42794 transitions. [2021-11-12 23:26:19,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:26:19,394 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-12 23:26:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:26:19,428 INFO L225 Difference]: With dead ends: 12764 [2021-11-12 23:26:19,429 INFO L226 Difference]: Without dead ends: 12764 [2021-11-12 23:26:19,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2021-11-12 23:26:19,430 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 304 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 3679 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1996.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 3707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.79ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2352.26ms IncrementalHoareTripleChecker+Time [2021-11-12 23:26:19,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 106 Invalid, 3707 Unknown, 0 Unchecked, 9.79ms Time], IncrementalHoareTripleChecker [28 Valid, 3679 Invalid, 0 Unknown, 0 Unchecked, 2352.26ms Time] [2021-11-12 23:26:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12764 states. [2021-11-12 23:26:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12764 to 11156. [2021-11-12 23:26:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11156 states, 11152 states have (on average 3.3684540889526544) internal successors, (37565), 11155 states have internal predecessors, (37565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:26:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11156 states to 11156 states and 37565 transitions. [2021-11-12 23:26:19,696 INFO L78 Accepts]: Start accepts. Automaton has 11156 states and 37565 transitions. Word has length 31 [2021-11-12 23:26:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:26:19,696 INFO L470 AbstractCegarLoop]: Abstraction has 11156 states and 37565 transitions. [2021-11-12 23:26:19,696 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-12 23:26:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 11156 states and 37565 transitions. [2021-11-12 23:26:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:26:19,712 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:26:19,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-12 23:26:19,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-12 23:26:19,712 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:26:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:26:19,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2014749307, now seen corresponding path program 4 times [2021-11-12 23:26:19,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:26:19,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925127646] [2021-11-12 23:26:19,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:26:19,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:26:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:26:20,542 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-12 23:26:20,543 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:26:20,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925127646] [2021-11-12 23:26:20,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925127646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:26:20,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:26:20,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:26:20,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113952545] [2021-11-12 23:26:20,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:26:20,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:26:20,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:26:20,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:26:20,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:26:20,544 INFO L87 Difference]: Start difference. First operand 11156 states and 37565 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-12 23:26:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:26:29,603 INFO L93 Difference]: Finished difference Result 12663 states and 42211 transitions. [2021-11-12 23:26:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-11-12 23:26:29,603 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-12 23:26:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:26:29,638 INFO L225 Difference]: With dead ends: 12663 [2021-11-12 23:26:29,638 INFO L226 Difference]: Without dead ends: 12591 [2021-11-12 23:26:29,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1398, Invalid=5082, Unknown=0, NotChecked=0, Total=6480 [2021-11-12 23:26:29,640 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 364 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 4668 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2866.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 4765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.36ms SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 4668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3341.75ms IncrementalHoareTripleChecker+Time [2021-11-12 23:26:29,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 156 Invalid, 4765 Unknown, 0 Unchecked, 13.36ms Time], IncrementalHoareTripleChecker [97 Valid, 4668 Invalid, 0 Unknown, 0 Unchecked, 3341.75ms Time] [2021-11-12 23:26:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12591 states. [2021-11-12 23:26:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12591 to 11306. [2021-11-12 23:26:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11306 states, 11302 states have (on average 3.3653335692797737) internal successors, (38035), 11305 states have internal predecessors, (38035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:26:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11306 states to 11306 states and 38035 transitions. [2021-11-12 23:26:29,998 INFO L78 Accepts]: Start accepts. Automaton has 11306 states and 38035 transitions. Word has length 31 [2021-11-12 23:26:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:26:29,999 INFO L470 AbstractCegarLoop]: Abstraction has 11306 states and 38035 transitions. [2021-11-12 23:26:29,999 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-12 23:26:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 11306 states and 38035 transitions. [2021-11-12 23:26:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:26:30,015 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:26:30,015 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-12 23:26:30,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-12 23:26:30,015 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:26:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:26:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1686149411, now seen corresponding path program 4 times [2021-11-12 23:26:30,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:26:30,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895915450] [2021-11-12 23:26:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:26:30,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:26:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:26:30,853 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-12 23:26:30,853 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:26:30,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895915450] [2021-11-12 23:26:30,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895915450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:26:30,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:26:30,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:26:30,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106557729] [2021-11-12 23:26:30,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:26:30,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:26:30,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:26:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:26:30,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:26:30,854 INFO L87 Difference]: Start difference. First operand 11306 states and 38035 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-12 23:26:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:26:33,406 INFO L93 Difference]: Finished difference Result 12374 states and 41564 transitions. [2021-11-12 23:26:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-12 23:26:33,409 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-12 23:26:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:26:33,443 INFO L225 Difference]: With dead ends: 12374 [2021-11-12 23:26:33,443 INFO L226 Difference]: Without dead ends: 12374 [2021-11-12 23:26:33,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:26:33,444 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 277 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 3198 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1627.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.64ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1920.21ms IncrementalHoareTripleChecker+Time [2021-11-12 23:26:33,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 82 Invalid, 3219 Unknown, 0 Unchecked, 8.64ms Time], IncrementalHoareTripleChecker [21 Valid, 3198 Invalid, 0 Unknown, 0 Unchecked, 1920.21ms Time] [2021-11-12 23:26:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12374 states. [2021-11-12 23:26:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12374 to 11016. [2021-11-12 23:26:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11016 states, 11012 states have (on average 3.369505993461678) internal successors, (37105), 11015 states have internal predecessors, (37105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:26:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11016 states to 11016 states and 37105 transitions. [2021-11-12 23:26:33,687 INFO L78 Accepts]: Start accepts. Automaton has 11016 states and 37105 transitions. Word has length 31 [2021-11-12 23:26:33,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:26:33,688 INFO L470 AbstractCegarLoop]: Abstraction has 11016 states and 37105 transitions. [2021-11-12 23:26:33,688 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-12 23:26:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand 11016 states and 37105 transitions. [2021-11-12 23:26:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:26:33,701 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:26:33,702 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-12 23:26:33,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-12 23:26:33,702 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:26:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:26:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash 900882487, now seen corresponding path program 5 times [2021-11-12 23:26:33,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:26:33,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958533407] [2021-11-12 23:26:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:26:33,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:26:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:26:34,478 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-12 23:26:34,478 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:26:34,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958533407] [2021-11-12 23:26:34,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958533407] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:26:34,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:26:34,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:26:34,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982118736] [2021-11-12 23:26:34,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:26:34,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:26:34,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:26:34,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:26:34,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:26:34,480 INFO L87 Difference]: Start difference. First operand 11016 states and 37105 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-12 23:26:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:26:48,412 INFO L93 Difference]: Finished difference Result 13240 states and 43840 transitions. [2021-11-12 23:26:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-11-12 23:26:48,413 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-12 23:26:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:26:48,448 INFO L225 Difference]: With dead ends: 13240 [2021-11-12 23:26:48,448 INFO L226 Difference]: Without dead ends: 13152 [2021-11-12 23:26:48,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4107 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3101, Invalid=11905, Unknown=0, NotChecked=0, Total=15006 [2021-11-12 23:26:48,451 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 391 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 5675 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3453.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 5779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.33ms SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 5675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4047.75ms IncrementalHoareTripleChecker+Time [2021-11-12 23:26:48,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 240 Invalid, 5779 Unknown, 0 Unchecked, 16.33ms Time], IncrementalHoareTripleChecker [104 Valid, 5675 Invalid, 0 Unknown, 0 Unchecked, 4047.75ms Time] [2021-11-12 23:26:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2021-11-12 23:26:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 10876. [2021-11-12 23:26:48,667 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-12 23:26:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10876 states to 10876 states and 36645 transitions. [2021-11-12 23:26:48,700 INFO L78 Accepts]: Start accepts. Automaton has 10876 states and 36645 transitions. Word has length 31 [2021-11-12 23:26:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:26:48,700 INFO L470 AbstractCegarLoop]: Abstraction has 10876 states and 36645 transitions. [2021-11-12 23:26:48,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-12 23:26:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 10876 states and 36645 transitions. [2021-11-12 23:26:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:26:48,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:26:48,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, 1] [2021-11-12 23:26:48,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-12 23:26:48,715 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-12 23:26:48,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:26:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash -44988815, now seen corresponding path program 6 times [2021-11-12 23:26:48,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:26:48,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107994432] [2021-11-12 23:26:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:26:48,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:26:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:26:49,422 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-12 23:26:49,422 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:26:49,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107994432] [2021-11-12 23:26:49,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107994432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:26:49,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:26:49,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:26:49,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360145662] [2021-11-12 23:26:49,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:26:49,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:26:49,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:26:49,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:26:49,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:26:49,424 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-12 23:26:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:26:58,185 INFO L93 Difference]: Finished difference Result 12657 states and 42127 transitions. [2021-11-12 23:26:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-11-12 23:26:58,186 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-12 23:26:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:26:58,221 INFO L225 Difference]: With dead ends: 12657 [2021-11-12 23:26:58,221 INFO L226 Difference]: Without dead ends: 12585 [2021-11-12 23:26:58,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1452, Invalid=5354, Unknown=0, NotChecked=0, Total=6806 [2021-11-12 23:26:58,223 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 428 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 4491 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2586.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 4596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.28ms SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 4491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3021.85ms IncrementalHoareTripleChecker+Time [2021-11-12 23:26:58,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 155 Invalid, 4596 Unknown, 0 Unchecked, 12.28ms Time], IncrementalHoareTripleChecker [105 Valid, 4491 Invalid, 0 Unknown, 0 Unchecked, 3021.85ms Time] [2021-11-12 23:26:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12585 states. [2021-11-12 23:26:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12585 to 10877. [2021-11-12 23:26:58,437 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-12 23:26:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10877 states to 10877 states and 36648 transitions. [2021-11-12 23:26:58,470 INFO L78 Accepts]: Start accepts. Automaton has 10877 states and 36648 transitions. Word has length 31 [2021-11-12 23:26:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:26:58,470 INFO L470 AbstractCegarLoop]: Abstraction has 10877 states and 36648 transitions. [2021-11-12 23:26:58,470 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-12 23:26:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 10877 states and 36648 transitions. [2021-11-12 23:26:58,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:26:58,484 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:26:58,485 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-12 23:26:58,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-12 23:26:58,485 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-12 23:26:58,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:26:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1605977919, now seen corresponding path program 7 times [2021-11-12 23:26:58,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:26:58,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514577827] [2021-11-12 23:26:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:26:58,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:26:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:26:59,138 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-12 23:26:59,138 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:26:59,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514577827] [2021-11-12 23:26:59,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514577827] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:26:59,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:26:59,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-12 23:26:59,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917188391] [2021-11-12 23:26:59,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:26:59,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:26:59,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:26:59,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:26:59,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:26:59,140 INFO L87 Difference]: Start difference. First operand 10877 states and 36648 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-12 23:27:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:27:17,415 INFO L93 Difference]: Finished difference Result 13032 states and 43194 transitions. [2021-11-12 23:27:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2021-11-12 23:27:17,416 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-12 23:27:17,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:27:17,536 INFO L225 Difference]: With dead ends: 13032 [2021-11-12 23:27:17,536 INFO L226 Difference]: Without dead ends: 12944 [2021-11-12 23:27:17,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4460 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3621, Invalid=14201, Unknown=0, NotChecked=0, Total=17822 [2021-11-12 23:27:17,539 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 313 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 8274 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4617.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 8358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.24ms SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 8274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5431.21ms IncrementalHoareTripleChecker+Time [2021-11-12 23:27:17,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 359 Invalid, 8358 Unknown, 0 Unchecked, 21.24ms Time], IncrementalHoareTripleChecker [84 Valid, 8274 Invalid, 0 Unknown, 0 Unchecked, 5431.21ms Time] [2021-11-12 23:27:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2021-11-12 23:27:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 10776. [2021-11-12 23:27:17,742 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-12 23:27:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10776 states to 10776 states and 36305 transitions. [2021-11-12 23:27:17,775 INFO L78 Accepts]: Start accepts. Automaton has 10776 states and 36305 transitions. Word has length 31 [2021-11-12 23:27:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:27:17,775 INFO L470 AbstractCegarLoop]: Abstraction has 10776 states and 36305 transitions. [2021-11-12 23:27:17,775 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-12 23:27:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 10776 states and 36305 transitions. [2021-11-12 23:27:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:27:17,790 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:27:17,790 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-12 23:27:17,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-12 23:27:17,790 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-12 23:27:17,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:27:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash 259335471, now seen corresponding path program 8 times [2021-11-12 23:27:17,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:27:17,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174963682] [2021-11-12 23:27:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:27:17,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:27:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:27:18,368 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-12 23:27:18,368 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:27:18,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174963682] [2021-11-12 23:27:18,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174963682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:27:18,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:27:18,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:27:18,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230802875] [2021-11-12 23:27:18,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:27:18,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:27:18,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:27:18,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:27:18,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:27:18,369 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-12 23:27:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:27:35,642 INFO L93 Difference]: Finished difference Result 12536 states and 41684 transitions. [2021-11-12 23:27:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2021-11-12 23:27:35,643 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-12 23:27:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:27:35,674 INFO L225 Difference]: With dead ends: 12536 [2021-11-12 23:27:35,674 INFO L226 Difference]: Without dead ends: 12448 [2021-11-12 23:27:35,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5309 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=4000, Invalid=16306, Unknown=0, NotChecked=0, Total=20306 [2021-11-12 23:27:35,677 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 348 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 7967 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4297.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 8059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.83ms SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 7967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5041.97ms IncrementalHoareTripleChecker+Time [2021-11-12 23:27:35,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 384 Invalid, 8059 Unknown, 0 Unchecked, 18.83ms Time], IncrementalHoareTripleChecker [92 Valid, 7967 Invalid, 0 Unknown, 0 Unchecked, 5041.97ms Time] [2021-11-12 23:27:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12448 states. [2021-11-12 23:27:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12448 to 10576. [2021-11-12 23:27:35,885 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-12 23:27:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10576 states to 10576 states and 35705 transitions. [2021-11-12 23:27:35,918 INFO L78 Accepts]: Start accepts. Automaton has 10576 states and 35705 transitions. Word has length 31 [2021-11-12 23:27:35,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:27:35,918 INFO L470 AbstractCegarLoop]: Abstraction has 10576 states and 35705 transitions. [2021-11-12 23:27:35,918 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-12 23:27:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 10576 states and 35705 transitions. [2021-11-12 23:27:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:27:35,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:27:35,933 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-12 23:27:35,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-12 23:27:35,933 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-12 23:27:35,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:27:35,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2035111155, now seen corresponding path program 9 times [2021-11-12 23:27:35,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:27:35,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930972400] [2021-11-12 23:27:35,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:27:35,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:27:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:27:36,667 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-12 23:27:36,667 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:27:36,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930972400] [2021-11-12 23:27:36,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930972400] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:27:36,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:27:36,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-12 23:27:36,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555421376] [2021-11-12 23:27:36,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:27:36,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:27:36,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:27:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:27:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:27:36,669 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-12 23:27:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:27:58,337 INFO L93 Difference]: Finished difference Result 12006 states and 40002 transitions. [2021-11-12 23:27:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-11-12 23:27:58,338 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-12 23:27:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:27:58,370 INFO L225 Difference]: With dead ends: 12006 [2021-11-12 23:27:58,370 INFO L226 Difference]: Without dead ends: 11906 [2021-11-12 23:27:58,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6103 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=3981, Invalid=17775, Unknown=0, NotChecked=0, Total=21756 [2021-11-12 23:27:58,372 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 369 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 7764 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4787.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 7856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.31ms SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 7764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5596.42ms IncrementalHoareTripleChecker+Time [2021-11-12 23:27:58,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 408 Invalid, 7856 Unknown, 0 Unchecked, 21.31ms Time], IncrementalHoareTripleChecker [92 Valid, 7764 Invalid, 0 Unknown, 0 Unchecked, 5596.42ms Time] [2021-11-12 23:27:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11906 states. [2021-11-12 23:27:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11906 to 10520. [2021-11-12 23:27:58,662 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-12 23:27:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10520 states to 10520 states and 35453 transitions. [2021-11-12 23:27:58,694 INFO L78 Accepts]: Start accepts. Automaton has 10520 states and 35453 transitions. Word has length 31 [2021-11-12 23:27:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:27:58,694 INFO L470 AbstractCegarLoop]: Abstraction has 10520 states and 35453 transitions. [2021-11-12 23:27:58,694 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-12 23:27:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 10520 states and 35453 transitions. [2021-11-12 23:27:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:27:58,708 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:27:58,709 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-12 23:27:58,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-12 23:27:58,709 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-12 23:27:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:27:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1799717511, now seen corresponding path program 10 times [2021-11-12 23:27:58,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:27:58,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459263119] [2021-11-12 23:27:58,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:27:58,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:27:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:27:59,524 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-12 23:27:59,524 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:27:59,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459263119] [2021-11-12 23:27:59,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459263119] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:27:59,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:27:59,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-12 23:27:59,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562259707] [2021-11-12 23:27:59,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:27:59,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:27:59,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:27:59,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:27:59,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:27:59,526 INFO L87 Difference]: Start difference. First operand 10520 states and 35453 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-12 23:28:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:28,322 INFO L93 Difference]: Finished difference Result 11916 states and 39708 transitions. [2021-11-12 23:28:28,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2021-11-12 23:28:28,323 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-12 23:28:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:28,352 INFO L225 Difference]: With dead ends: 11916 [2021-11-12 23:28:28,352 INFO L226 Difference]: Without dead ends: 11808 [2021-11-12 23:28:28,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7573 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=4725, Invalid=22007, Unknown=0, NotChecked=0, Total=26732 [2021-11-12 23:28:28,354 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 316 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 9450 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6576.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 9541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.76ms SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 9450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7625.17ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:28,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 490 Invalid, 9541 Unknown, 0 Unchecked, 26.76ms Time], IncrementalHoareTripleChecker [91 Valid, 9450 Invalid, 0 Unknown, 0 Unchecked, 7625.17ms Time] [2021-11-12 23:28:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2021-11-12 23:28:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 10520. [2021-11-12 23:28:28,556 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-12 23:28:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10520 states to 10520 states and 35453 transitions. [2021-11-12 23:28:28,589 INFO L78 Accepts]: Start accepts. Automaton has 10520 states and 35453 transitions. Word has length 31 [2021-11-12 23:28:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:28,590 INFO L470 AbstractCegarLoop]: Abstraction has 10520 states and 35453 transitions. [2021-11-12 23:28:28,590 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-12 23:28:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 10520 states and 35453 transitions. [2021-11-12 23:28:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:28:28,603 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:28,604 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-12 23:28:28,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-12 23:28:28,604 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:28:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:28,605 INFO L85 PathProgramCache]: Analyzing trace with hash 195862715, now seen corresponding path program 5 times [2021-11-12 23:28:28,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:28:28,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836553786] [2021-11-12 23:28:28,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:28,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:28:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:29,513 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-12 23:28:29,513 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:28:29,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836553786] [2021-11-12 23:28:29,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836553786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:28:29,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:28:29,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:28:29,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961154892] [2021-11-12 23:28:29,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:28:29,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:28:29,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:28:29,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:28:29,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:28:29,515 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-12 23:28:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:32,273 INFO L93 Difference]: Finished difference Result 11136 states and 37394 transitions. [2021-11-12 23:28:32,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-12 23:28:32,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-12 23:28:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:32,302 INFO L225 Difference]: With dead ends: 11136 [2021-11-12 23:28:32,302 INFO L226 Difference]: Without dead ends: 11136 [2021-11-12 23:28:32,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-11-12 23:28:32,303 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 279 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 3270 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1793.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.98ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2113.17ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:32,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 88 Invalid, 3295 Unknown, 0 Unchecked, 8.98ms Time], IncrementalHoareTripleChecker [25 Valid, 3270 Invalid, 0 Unknown, 0 Unchecked, 2113.17ms Time] [2021-11-12 23:28:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11136 states. [2021-11-12 23:28:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11136 to 10068. [2021-11-12 23:28:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10068 states, 10064 states have (on average 3.3649642289348174) internal successors, (33865), 10067 states have internal predecessors, (33865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:28:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10068 states to 10068 states and 33865 transitions. [2021-11-12 23:28:32,527 INFO L78 Accepts]: Start accepts. Automaton has 10068 states and 33865 transitions. Word has length 31 [2021-11-12 23:28:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:32,527 INFO L470 AbstractCegarLoop]: Abstraction has 10068 states and 33865 transitions. [2021-11-12 23:28:32,527 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-12 23:28:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 10068 states and 33865 transitions. [2021-11-12 23:28:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:28:32,546 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:32,546 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-12 23:28:32,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-12 23:28:32,547 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:28:32,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:32,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1049571059, now seen corresponding path program 6 times [2021-11-12 23:28:32,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:28:32,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729942523] [2021-11-12 23:28:32,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:32,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:28:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:33,394 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-12 23:28:33,395 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:28:33,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729942523] [2021-11-12 23:28:33,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729942523] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:28:33,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:28:33,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-12 23:28:33,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681680083] [2021-11-12 23:28:33,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:28:33,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:28:33,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:28:33,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:28:33,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:28:33,396 INFO L87 Difference]: Start difference. First operand 10068 states and 33865 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-12 23:28:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:36,523 INFO L93 Difference]: Finished difference Result 12145 states and 40797 transitions. [2021-11-12 23:28:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:28:36,523 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-12 23:28:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:36,556 INFO L225 Difference]: With dead ends: 12145 [2021-11-12 23:28:36,557 INFO L226 Difference]: Without dead ends: 12145 [2021-11-12 23:28:36,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2021-11-12 23:28:36,557 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 299 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 3381 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1990.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.83ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2337.72ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:36,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 91 Invalid, 3409 Unknown, 0 Unchecked, 9.83ms Time], IncrementalHoareTripleChecker [28 Valid, 3381 Invalid, 0 Unknown, 0 Unchecked, 2337.72ms Time] [2021-11-12 23:28:36,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12145 states. [2021-11-12 23:28:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12145 to 10516. [2021-11-12 23:28:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10516 states, 10512 states have (on average 3.3835616438356166) internal successors, (35568), 10515 states have internal predecessors, (35568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:28:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10516 states to 10516 states and 35568 transitions. [2021-11-12 23:28:36,807 INFO L78 Accepts]: Start accepts. Automaton has 10516 states and 35568 transitions. Word has length 31 [2021-11-12 23:28:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:36,807 INFO L470 AbstractCegarLoop]: Abstraction has 10516 states and 35568 transitions. [2021-11-12 23:28:36,808 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-12 23:28:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 10516 states and 35568 transitions. [2021-11-12 23:28:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:28:36,822 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:36,822 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-12 23:28:36,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-12 23:28:36,822 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:28:36,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash 197104431, now seen corresponding path program 2 times [2021-11-12 23:28:36,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:28:36,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693496249] [2021-11-12 23:28:36,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:36,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:28:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:28:37,992 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:28:37,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693496249] [2021-11-12 23:28:37,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693496249] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:28:37,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:28:37,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-12 23:28:37,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468960282] [2021-11-12 23:28:37,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:28:37,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:28:37,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:28:37,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:28:37,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:28:37,994 INFO L87 Difference]: Start difference. First operand 10516 states and 35568 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-12 23:28:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:41,519 INFO L93 Difference]: Finished difference Result 12004 states and 40377 transitions. [2021-11-12 23:28:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:28:41,519 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-12 23:28:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:41,551 INFO L225 Difference]: With dead ends: 12004 [2021-11-12 23:28:41,551 INFO L226 Difference]: Without dead ends: 12004 [2021-11-12 23:28:41,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:28:41,552 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 345 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 3501 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2039.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.88ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2391.10ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:41,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 98 Invalid, 3532 Unknown, 0 Unchecked, 9.88ms Time], IncrementalHoareTripleChecker [31 Valid, 3501 Invalid, 0 Unknown, 0 Unchecked, 2391.10ms Time] [2021-11-12 23:28:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12004 states. [2021-11-12 23:28:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12004 to 10456. [2021-11-12 23:28:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10456 states, 10452 states have (on average 3.3857634902411022) internal successors, (35388), 10455 states have internal predecessors, (35388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:28:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10456 states to 10456 states and 35388 transitions. [2021-11-12 23:28:41,970 INFO L78 Accepts]: Start accepts. Automaton has 10456 states and 35388 transitions. Word has length 31 [2021-11-12 23:28:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:41,970 INFO L470 AbstractCegarLoop]: Abstraction has 10456 states and 35388 transitions. [2021-11-12 23:28:41,971 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-12 23:28:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 10456 states and 35388 transitions. [2021-11-12 23:28:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:28:41,984 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:41,985 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-12 23:28:41,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-12 23:28:41,985 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-12 23:28:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:41,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1163740935, now seen corresponding path program 3 times [2021-11-12 23:28:41,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:28:41,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159318016] [2021-11-12 23:28:41,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:41,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:28:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:43,114 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-12 23:28:43,114 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:28:43,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159318016] [2021-11-12 23:28:43,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159318016] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:28:43,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:28:43,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-12 23:28:43,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385918681] [2021-11-12 23:28:43,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:28:43,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:28:43,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:28:43,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:28:43,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:28:43,117 INFO L87 Difference]: Start difference. First operand 10456 states and 35388 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-12 23:28:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:46,658 INFO L93 Difference]: Finished difference Result 11884 states and 40017 transitions. [2021-11-12 23:28:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:28:46,659 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-12 23:28:46,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:46,690 INFO L225 Difference]: With dead ends: 11884 [2021-11-12 23:28:46,690 INFO L226 Difference]: Without dead ends: 11884 [2021-11-12 23:28:46,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:28:46,691 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 321 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 3665 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2090.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.11ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2454.12ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:46,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 100 Invalid, 3692 Unknown, 0 Unchecked, 10.11ms Time], IncrementalHoareTripleChecker [27 Valid, 3665 Invalid, 0 Unknown, 0 Unchecked, 2454.12ms Time] [2021-11-12 23:28:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2021-11-12 23:28:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 10396. [2021-11-12 23:28:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10396 states, 10392 states have (on average 3.387990762124711) internal successors, (35208), 10395 states have internal predecessors, (35208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:28:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10396 states to 10396 states and 35208 transitions. [2021-11-12 23:28:46,938 INFO L78 Accepts]: Start accepts. Automaton has 10396 states and 35208 transitions. Word has length 31 [2021-11-12 23:28:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:46,939 INFO L470 AbstractCegarLoop]: Abstraction has 10396 states and 35208 transitions. [2021-11-12 23:28:46,939 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-12 23:28:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 10396 states and 35208 transitions. [2021-11-12 23:28:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:28:46,952 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:46,952 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-12 23:28:46,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-12 23:28:46,953 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-12 23:28:46,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:46,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1799199463, now seen corresponding path program 4 times [2021-11-12 23:28:46,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:28:46,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352549476] [2021-11-12 23:28:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:46,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:28:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:48,180 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-12 23:28:48,181 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:28:48,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352549476] [2021-11-12 23:28:48,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352549476] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:28:48,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:28:48,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-12 23:28:48,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253336467] [2021-11-12 23:28:48,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:28:48,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:28:48,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:28:48,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:28:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:28:48,183 INFO L87 Difference]: Start difference. First operand 10396 states and 35208 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-12 23:28:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:51,627 INFO L93 Difference]: Finished difference Result 11584 states and 39097 transitions. [2021-11-12 23:28:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-12 23:28:51,628 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-12 23:28:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:51,657 INFO L225 Difference]: With dead ends: 11584 [2021-11-12 23:28:51,657 INFO L226 Difference]: Without dead ends: 11584 [2021-11-12 23:28:51,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:28:51,658 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 367 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 3289 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1902.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.95ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2231.07ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:51,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 91 Invalid, 3321 Unknown, 0 Unchecked, 8.95ms Time], IncrementalHoareTripleChecker [32 Valid, 3289 Invalid, 0 Unknown, 0 Unchecked, 2231.07ms Time] [2021-11-12 23:28:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11584 states. [2021-11-12 23:28:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11584 to 10036. [2021-11-12 23:28:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10036 states, 10032 states have (on average 3.399920255183413) internal successors, (34108), 10035 states have internal predecessors, (34108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:28:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10036 states to 10036 states and 34108 transitions. [2021-11-12 23:28:51,902 INFO L78 Accepts]: Start accepts. Automaton has 10036 states and 34108 transitions. Word has length 31 [2021-11-12 23:28:51,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:51,903 INFO L470 AbstractCegarLoop]: Abstraction has 10036 states and 34108 transitions. [2021-11-12 23:28:51,903 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-12 23:28:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 10036 states and 34108 transitions. [2021-11-12 23:28:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:28:51,916 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:51,916 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-12 23:28:51,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-12 23:28:51,917 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:28:51,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:51,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1026212421, now seen corresponding path program 5 times [2021-11-12 23:28:51,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:28:51,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095012947] [2021-11-12 23:28:51,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:51,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:28:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:52,753 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-12 23:28:52,753 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:28:52,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095012947] [2021-11-12 23:28:52,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095012947] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:28:52,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:28:52,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-12 23:28:52,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561956019] [2021-11-12 23:28:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:28:52,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:28:52,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:28:52,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:28:52,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:28:52,755 INFO L87 Difference]: Start difference. First operand 10036 states and 34108 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-12 23:28:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:55,929 INFO L93 Difference]: Finished difference Result 11104 states and 37637 transitions. [2021-11-12 23:28:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-12 23:28:55,933 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-12 23:28:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:55,966 INFO L225 Difference]: With dead ends: 11104 [2021-11-12 23:28:55,966 INFO L226 Difference]: Without dead ends: 11104 [2021-11-12 23:28:55,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2021-11-12 23:28:55,967 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 368 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 3305 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1824.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.18ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2148.84ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:55,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 93 Invalid, 3344 Unknown, 0 Unchecked, 9.18ms Time], IncrementalHoareTripleChecker [39 Valid, 3305 Invalid, 0 Unknown, 0 Unchecked, 2148.84ms Time] [2021-11-12 23:28:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11104 states. [2021-11-12 23:28:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11104 to 10036. [2021-11-12 23:28:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10036 states, 10032 states have (on average 3.399920255183413) internal successors, (34108), 10035 states have internal predecessors, (34108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:28:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10036 states to 10036 states and 34108 transitions. [2021-11-12 23:28:56,351 INFO L78 Accepts]: Start accepts. Automaton has 10036 states and 34108 transitions. Word has length 31 [2021-11-12 23:28:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:56,352 INFO L470 AbstractCegarLoop]: Abstraction has 10036 states and 34108 transitions. [2021-11-12 23:28:56,352 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-12 23:28:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 10036 states and 34108 transitions. [2021-11-12 23:28:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:28:56,364 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:56,364 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-12 23:28:56,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-12 23:28:56,364 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:28:56,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash -135986171, now seen corresponding path program 6 times [2021-11-12 23:28:56,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:28:56,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314380676] [2021-11-12 23:28:56,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:56,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:28:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:57,134 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-12 23:28:57,134 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:28:57,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314380676] [2021-11-12 23:28:57,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314380676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:28:57,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:28:57,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-12 23:28:57,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336593048] [2021-11-12 23:28:57,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:28:57,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:28:57,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:28:57,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:28:57,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:28:57,135 INFO L87 Difference]: Start difference. First operand 10036 states and 34108 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-12 23:29:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:29:00,667 INFO L93 Difference]: Finished difference Result 11821 states and 39867 transitions. [2021-11-12 23:29:00,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-12 23:29:00,668 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-12 23:29:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:29:00,702 INFO L225 Difference]: With dead ends: 11821 [2021-11-12 23:29:00,702 INFO L226 Difference]: Without dead ends: 11821 [2021-11-12 23:29:00,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=188, Invalid=934, Unknown=0, NotChecked=0, Total=1122 [2021-11-12 23:29:00,703 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 336 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 3721 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2043.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.24ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2409.57ms IncrementalHoareTripleChecker+Time [2021-11-12 23:29:00,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 104 Invalid, 3756 Unknown, 0 Unchecked, 10.24ms Time], IncrementalHoareTripleChecker [35 Valid, 3721 Invalid, 0 Unknown, 0 Unchecked, 2409.57ms Time] [2021-11-12 23:29:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2021-11-12 23:29:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 9602. [2021-11-12 23:29:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9602 states, 9598 states have (on average 3.3884142529693686) internal successors, (32522), 9601 states have internal predecessors, (32522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:29:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9602 states to 9602 states and 32522 transitions. [2021-11-12 23:29:00,991 INFO L78 Accepts]: Start accepts. Automaton has 9602 states and 32522 transitions. Word has length 31 [2021-11-12 23:29:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:29:00,992 INFO L470 AbstractCegarLoop]: Abstraction has 9602 states and 32522 transitions. [2021-11-12 23:29:00,992 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-12 23:29:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 9602 states and 32522 transitions. [2021-11-12 23:29:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:29:01,004 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:29:01,005 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-12 23:29:01,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-12 23:29:01,005 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-12 23:29:01,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:29:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2109249087, now seen corresponding path program 7 times [2021-11-12 23:29:01,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:29:01,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605987825] [2021-11-12 23:29:01,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:29:01,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:29:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:29:02,368 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-12 23:29:02,368 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:29:02,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605987825] [2021-11-12 23:29:02,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605987825] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:29:02,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:29:02,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-12 23:29:02,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630378473] [2021-11-12 23:29:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:29:02,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-12 23:29:02,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:29:02,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-12 23:29:02,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2021-11-12 23:29:02,370 INFO L87 Difference]: Start difference. First operand 9602 states and 32522 transitions. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-12 23:29:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:29:15,242 INFO L93 Difference]: Finished difference Result 11151 states and 37432 transitions. [2021-11-12 23:29:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-12 23:29:15,242 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-12 23:29:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:29:15,273 INFO L225 Difference]: With dead ends: 11151 [2021-11-12 23:29:15,273 INFO L226 Difference]: Without dead ends: 11151 [2021-11-12 23:29:15,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=771, Invalid=3519, Unknown=0, NotChecked=0, Total=4290 [2021-11-12 23:29:15,274 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 455 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 7450 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5274.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.27ms SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 7450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6124.35ms IncrementalHoareTripleChecker+Time [2021-11-12 23:29:15,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 178 Invalid, 7516 Unknown, 0 Unchecked, 21.27ms Time], IncrementalHoareTripleChecker [66 Valid, 7450 Invalid, 0 Unknown, 0 Unchecked, 6124.35ms Time] [2021-11-12 23:29:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11151 states. [2021-11-12 23:29:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11151 to 9078. [2021-11-12 23:29:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9078 states, 9074 states have (on average 3.391227683491294) internal successors, (30772), 9077 states have internal predecessors, (30772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:29:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9078 states to 9078 states and 30772 transitions. [2021-11-12 23:29:15,488 INFO L78 Accepts]: Start accepts. Automaton has 9078 states and 30772 transitions. Word has length 31 [2021-11-12 23:29:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:29:15,488 INFO L470 AbstractCegarLoop]: Abstraction has 9078 states and 30772 transitions. [2021-11-12 23:29:15,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-12 23:29:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 9078 states and 30772 transitions. [2021-11-12 23:29:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-12 23:29:15,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:29:15,502 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:29:15,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-12 23:29:15,502 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-12 23:29:15,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:29:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2023938091, now seen corresponding path program 7 times [2021-11-12 23:29:15,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:29:15,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529469789] [2021-11-12 23:29:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:29:15,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:29:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:29:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:29:16,287 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:29:16,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529469789] [2021-11-12 23:29:16,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529469789] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:29:16,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759669342] [2021-11-12 23:29:16,288 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:29:16,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:29:16,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:29:16,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:29:16,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c28a658-ee94-44d7-8d40-86ab73110521/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-12 23:29:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:29:16,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 92 conjunts are in the unsatisfiable core [2021-11-12 23:29:16,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:29:16,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:16,628 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-12 23:29:16,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 44 [2021-11-12 23:29:16,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 104 [2021-11-12 23:29:16,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:16,901 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-12 23:29:16,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2021-11-12 23:29:17,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-12 23:29:17,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:17,435 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-12 23:29:17,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 41 [2021-11-12 23:29:17,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:17,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:17,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-12 23:29:17,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:17,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 105 [2021-11-12 23:29:17,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:17,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:17,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:17,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 35 [2021-11-12 23:29:17,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:17,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:17,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-12 23:29:17,980 INFO L354 Elim1Store]: treesize reduction 84, result has 27.6 percent of original size [2021-11-12 23:29:17,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 56 [2021-11-12 23:29:18,197 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-12 23:29:18,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2021-11-12 23:29:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:29:18,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:29:38,887 WARN L227 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 23:30:01,805 WARN L227 SmtUtils]: Spent 7.80s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 23:30:22,632 WARN L227 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 23:30:31,531 WARN L227 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 23:30:43,144 WARN L227 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 23:32:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:32:59,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759669342] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:32:59,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [575769888] [2021-11-12 23:32:59,409 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:32:59,413 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:32:59,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 46 [2021-11-12 23:32:59,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918838755] [2021-11-12 23:32:59,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:32:59,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-12 23:32:59,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:32:59,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-12 23:32:59,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2000, Unknown=53, NotChecked=0, Total=2256 [2021-11-12 23:32:59,417 INFO L87 Difference]: Start difference. First operand 9078 states and 30772 transitions. Second operand has 48 states, 47 states have (on average 1.872340425531915) internal successors, (88), 47 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:33:02,987 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse22 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|)) (.cse3 (select .cse0 .cse22)) (.cse1 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (and (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 2) (= (select .cse0 4) 1) (<= (select .cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)) 1) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) (= .cse2 0) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (<= 0 .cse3) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= (select .cse4 4) 1) (let ((.cse5 (+ .cse3 1))) (let ((.cse6 (mod .cse5 4))) (let ((.cse7 (= .cse6 0))) (or (and (< .cse5 0) (= (+ .cse2 4) .cse6) (not .cse7)) (let ((.cse14 (+ 1 (select (store .cse0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* .cse3 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|) .cse22)))) (let ((.cse15 (= (mod .cse14 4) 0))) (and (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| Int) (v_subst_2 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse12 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse11 (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse13 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse13 .cse12) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse11 .cse12 (mod (+ 1 (select .cse11 .cse12)) 4))))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse10 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_subst_2)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse8 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| (select .cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))))))) (and (< .cse14 0) (not .cse15))) (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| Int) (v_subst_1 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse20 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse19 (let ((.cse21 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse21 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse21 .cse20) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse19 .cse20 (+ (- 4) (mod (+ 1 (select .cse19 .cse20)) 4)))))))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse16 (select (store .cse17 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse18 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_subst_1)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse16 (+ (* (select .cse16 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| (select .cse18 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))))))) .cse15 (<= 0 .cse14))))) (and (= .cse2 .cse6) (or (<= 0 .cse5) .cse7)))))) (= (select .cse1 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 0) (= (select .cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) 1) (<= 0 (select .cse4 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 1) (= (select .cse4 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) 0)))) is different from false [2021-11-12 23:33:05,008 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse30 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse9 (select .cse7 .cse30))) (let ((.cse16 (+ 1 (select (store .cse7 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* .cse9 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|) .cse30))) (.cse0 (+ .cse9 1))) (let ((.cse1 (= (mod .cse0 4) 0)) (.cse8 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base|)) (.cse17 (= (mod .cse16 4) 0)) (.cse18 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (and (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 2) (or (<= 0 .cse0) .cse1 (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse6 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store .cse5 .cse6 (+ (- 4) (mod (+ (select .cse5 .cse6) 1) 4))))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse2 (select (store .cse3 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse4 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) |ULTIMATE.start_ring_enqueue_~x#1|)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse2 (+ (* (select .cse2 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| (select .cse4 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))))))) (= (select .cse7 4) 1) (<= (select .cse8 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)) 1) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) (= (select .cse7 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (<= 0 .cse9) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| Int) (v_subst_2 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse14 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse13 (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse15 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse15 .cse14) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse13 .cse14 (mod (+ 1 (select .cse13 .cse14)) 4))))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse10 (select (store .cse11 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse12 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_subst_2)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse10 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse10 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| (select .cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))))))) (and (< .cse16 0) (not .cse17))) (<= (select .cse18 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4)) 1) (= (select .cse18 4) 1) (or (and (< .cse0 0) (not .cse1)) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse22 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse23 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store .cse22 .cse23 (mod (+ (select .cse22 .cse23) 1) 4)))))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| (select .cse19 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (<= (let ((.cse20 (select (store .cse21 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse19 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) |ULTIMATE.start_ring_enqueue_~x#1|)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse20 (+ (* (select .cse20 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) 8)))))) (= (select .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 0) (= (select .cse8 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) 1) (<= 0 (select .cse18 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 1) (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| Int) (v_subst_1 Int)) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse28 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse27 (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse29 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse29 .cse28) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse27 .cse28 (+ (- 4) (mod (+ 1 (select .cse27 .cse28)) 4)))))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse24 (select (store .cse25 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse26 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_subst_1)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse24 (+ (* (select .cse24 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| (select .cse26 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))))))) .cse17 (<= 0 .cse16)) (= (select .cse18 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) 0)))))) is different from false [2021-11-12 23:34:37,616 WARN L227 SmtUtils]: Spent 26.24s on a formula simplification. DAG size of input: 96 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 23:34:56,051 WARN L227 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 80 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 23:35:31,403 WARN L227 SmtUtils]: Spent 17.03s on a formula simplification. DAG size of input: 69 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 23:35:32,382 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse1 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (and (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 2) (= (select .cse0 4) 1) (<= (select .cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)) 1) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) (= (select .cse0 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (<= 0 (select .cse0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= (select .cse2 4) 1) (= (select .cse1 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 0) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse4 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) |ULTIMATE.start_ring_enqueue_~x#1|)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse3 (+ (* (select .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| (select .cse4 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))))) (= (select .cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) 1) (<= 0 (select .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 1) (= (select .cse2 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) 0))) is different from false [2021-11-12 23:35:33,852 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse17 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse1 (select .cse2 .cse17))) (let ((.cse9 (+ 1 (select (store .cse2 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* .cse1 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|) .cse17)))) (let ((.cse0 (select .cse2 4)) (.cse10 (= (mod .cse9 4) 0))) (and (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 2) (= .cse0 (+ |c_ULTIMATE.start_writer_fn_~i~1#1| 1)) (= .cse0 1) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 0) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) (= .cse1 0) (= (select .cse2 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (<= 0 .cse1) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| Int) (v_subst_2 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse7 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse6 (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse8 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse8 .cse7) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse6 .cse7 (mod (+ 1 (select .cse6 .cse7)) 4))))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse3 (select (store .cse4 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_subst_2)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| (select .cse5 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))))))) (and (< .cse9 0) (not .cse10))) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| Int) (v_subst_1 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse15 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse14 (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse16 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse16 .cse15) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse14 .cse15 (+ (- 4) (mod (+ 1 (select .cse14 .cse15)) 4)))))))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse11 (select (store .cse12 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse13 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_subst_1)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse11 (+ (* (select .cse11 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem8#1_246| (select .cse13 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))))))) .cse10 (<= 0 .cse9)) (= |c_ULTIMATE.start_writer_fn_~r~1#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)))))) is different from false