./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 509c3c8c1895397e4c0d03f6462ad0ca0ed3ce99b40d08b775ab8473dba5ee1f --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:10:58,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:10:58,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:10:58,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:10:58,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:10:58,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:10:58,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:10:58,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:10:58,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:10:58,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:10:58,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:10:58,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:10:58,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:10:58,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:10:58,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:10:58,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:10:58,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:10:58,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:10:58,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:10:58,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:10:58,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:10:58,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:10:58,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:10:58,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:10:58,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:10:58,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:10:58,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:10:58,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:10:58,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:10:58,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:10:58,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:10:58,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:10:58,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:10:58,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:10:58,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:10:58,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:10:58,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:10:58,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:10:58,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:10:58,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:10:58,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:10:58,978 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 19:10:59,017 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:10:59,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:10:59,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:10:59,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:10:59,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:10:59,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:10:59,023 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:10:59,023 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:10:59,023 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:10:59,023 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:10:59,024 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:10:59,025 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:10:59,025 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:10:59,025 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:10:59,025 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:10:59,026 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:10:59,026 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:10:59,026 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:10:59,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:10:59,027 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:10:59,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:10:59,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:10:59,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:10:59,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 19:10:59,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:10:59,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 19:10:59,036 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:10:59,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 19:10:59,036 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:10:59,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 19:10:59,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:10:59,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:10:59,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:10:59,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:10:59,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:10:59,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 19:10:59,038 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:10:59,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:10:59,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 19:10:59,039 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:10:59,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:10:59,039 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_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 509c3c8c1895397e4c0d03f6462ad0ca0ed3ce99b40d08b775ab8473dba5ee1f [2021-11-25 19:10:59,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:10:59,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:10:59,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:10:59,314 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:10:59,315 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:10:59,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2021-11-25 19:10:59,374 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/data/7054892d2/ebb6b8f617574f2bb331ab976d76f75a/FLAGca51f9ce6 [2021-11-25 19:10:59,933 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:10:59,934 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2021-11-25 19:10:59,964 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/data/7054892d2/ebb6b8f617574f2bb331ab976d76f75a/FLAGca51f9ce6 [2021-11-25 19:11:00,193 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/data/7054892d2/ebb6b8f617574f2bb331ab976d76f75a [2021-11-25 19:11:00,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:11:00,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:11:00,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:11:00,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:11:00,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:11:00,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:00,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cc7315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00, skipping insertion in model container [2021-11-25 19:11:00,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:00,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:11:00,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:11:00,447 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 19:11:00,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-11-25 19:11:00,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-11-25 19:11:00,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-11-25 19:11:00,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-11-25 19:11:00,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-11-25 19:11:00,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-11-25 19:11:00,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-11-25 19:11:00,822 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:11:00,833 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:11:00,845 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 19:11:00,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-11-25 19:11:00,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-11-25 19:11:00,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-11-25 19:11:00,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-11-25 19:11:00,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-11-25 19:11:00,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-11-25 19:11:00,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-11-25 19:11:00,886 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:11:00,959 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:11:00,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00 WrapperNode [2021-11-25 19:11:00,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:11:00,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:11:00,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:11:00,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:11:00,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:00,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:01,033 INFO L137 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2021-11-25 19:11:01,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:11:01,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:11:01,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:11:01,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:11:01,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:01,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:01,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:01,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:01,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:01,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:01,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:01,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:11:01,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:11:01,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:11:01,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:11:01,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00" (1/1) ... [2021-11-25 19:11:01,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:11:01,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:11:01,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:11:01,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:11:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2021-11-25 19:11:01,172 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2021-11-25 19:11:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2021-11-25 19:11:01,173 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2021-11-25 19:11:01,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 19:11:01,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 19:11:01,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 19:11:01,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 19:11:01,174 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-25 19:11:01,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:11:01,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 19:11:01,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:11:01,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:11:01,176 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 19:11:01,335 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:11:01,337 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:11:01,746 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:11:01,757 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:11:01,757 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-25 19:11:01,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:11:01 BoogieIcfgContainer [2021-11-25 19:11:01,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:11:01,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:11:01,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:11:01,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:11:01,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:11:00" (1/3) ... [2021-11-25 19:11:01,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292547a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:11:01, skipping insertion in model container [2021-11-25 19:11:01,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:11:00" (2/3) ... [2021-11-25 19:11:01,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292547a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:11:01, skipping insertion in model container [2021-11-25 19:11:01,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:11:01" (3/3) ... [2021-11-25 19:11:01,768 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2021-11-25 19:11:01,774 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 19:11:01,774 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:11:01,774 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-25 19:11:01,774 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 19:11:01,838 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,843 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,848 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,850 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,851 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,851 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,851 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,851 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,852 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,852 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,852 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,852 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,854 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,854 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,855 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,855 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,855 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,855 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,855 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,856 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,856 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,856 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,865 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,866 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,867 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,868 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,868 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,868 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,875 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,875 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,875 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,875 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,876 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,876 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,876 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,876 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,877 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,877 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,877 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,877 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,878 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,878 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,878 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,878 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,879 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,879 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,880 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,881 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,881 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,881 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,881 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,882 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,883 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,883 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,884 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,884 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,884 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,884 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,885 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,885 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,885 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,885 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,885 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,886 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,886 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,887 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,887 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,888 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,888 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,888 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,888 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,889 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,890 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,891 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,891 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,891 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,891 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,891 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,892 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,893 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,894 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,896 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,896 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,896 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,896 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,897 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,897 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,897 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,897 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,898 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,898 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,898 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,898 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,898 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,899 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,899 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,899 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,899 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,900 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,900 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,900 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,900 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,901 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,901 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,901 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,901 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,902 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,902 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,902 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,902 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,902 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,903 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,903 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,903 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,903 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,903 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,904 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,904 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,904 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,905 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,905 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,905 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,905 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,906 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,906 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,909 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,909 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,910 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,910 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,910 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,924 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,924 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,925 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,925 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,925 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,925 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,926 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,926 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,926 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,926 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,927 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,927 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,927 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,927 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,927 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,928 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,928 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,928 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,928 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,929 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,929 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,929 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,929 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,929 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,930 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,930 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,930 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,931 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,931 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,931 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,931 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,931 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,932 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,932 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,932 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,932 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,933 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,933 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,933 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,933 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,933 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,935 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,935 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,937 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,937 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,937 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,937 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,939 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,939 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,939 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,939 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,939 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,943 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,943 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,943 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,943 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,944 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,944 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,944 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,944 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,944 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,945 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,945 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,945 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,945 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,946 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,946 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,947 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,947 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,947 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,947 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,947 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,948 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,948 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,948 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,948 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,949 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,949 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,949 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,951 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,952 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,952 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,952 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,952 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,953 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,953 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,953 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,953 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,954 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,955 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,955 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,955 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,955 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,956 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,956 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,956 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,956 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,956 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,957 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,957 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,979 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,979 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,979 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,979 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,980 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,980 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,980 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,980 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,981 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,981 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,981 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,981 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,981 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,982 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,982 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,982 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,982 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,982 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,983 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,983 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,983 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,983 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,983 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,984 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,984 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,984 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,984 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,985 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,985 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,985 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,985 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,985 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,986 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,986 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,986 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,986 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,986 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,987 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,987 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,987 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,987 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,991 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,991 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,991 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,991 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,994 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,994 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,997 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,997 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,997 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,999 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,999 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,999 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:01,999 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,000 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,000 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,000 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,001 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,001 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,001 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,001 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,015 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,016 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,016 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,016 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,017 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,017 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,017 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,017 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,017 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,018 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,022 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,025 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,027 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,027 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,027 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,027 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,028 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,028 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,028 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,029 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,029 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,029 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,029 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,029 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,030 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,030 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,030 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,035 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,036 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,036 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,036 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,037 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,037 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,037 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,042 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,060 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,060 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,060 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,060 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,061 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,061 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,061 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,061 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,062 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,062 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,062 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,062 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,063 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,063 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,063 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,063 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,064 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,064 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,064 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,065 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,065 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,065 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,066 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,081 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,082 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,082 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,082 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:11:02,091 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-25 19:11:02,140 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:11:02,147 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 19:11:02,147 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-11-25 19:11:02,163 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 19:11:02,175 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 233 transitions, 482 flow [2021-11-25 19:11:02,178 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 233 transitions, 482 flow [2021-11-25 19:11:02,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 223 places, 233 transitions, 482 flow [2021-11-25 19:11:02,340 INFO L129 PetriNetUnfolder]: 17/231 cut-off events. [2021-11-25 19:11:02,340 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-25 19:11:02,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 231 events. 17/231 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 458 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2021-11-25 19:11:02,367 INFO L116 LiptonReduction]: Number of co-enabled transitions 19012 [2021-11-25 19:11:09,463 INFO L131 LiptonReduction]: Checked pairs total: 41222 [2021-11-25 19:11:09,463 INFO L133 LiptonReduction]: Total number of compositions: 214 [2021-11-25 19:11:09,472 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 64 transitions, 144 flow [2021-11-25 19:11:09,619 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2452 states, 2447 states have (on average 3.5435226808336737) internal successors, (8671), 2451 states have internal predecessors, (8671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 2452 states, 2447 states have (on average 3.5435226808336737) internal successors, (8671), 2451 states have internal predecessors, (8671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 19:11:09,656 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:09,657 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:09,658 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:09,663 INFO L85 PathProgramCache]: Analyzing trace with hash 773188809, now seen corresponding path program 1 times [2021-11-25 19:11:09,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:09,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33030309] [2021-11-25 19:11:09,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:09,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:09,943 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:09,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33030309] [2021-11-25 19:11:09,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33030309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:09,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:09,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:11:09,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050587492] [2021-11-25 19:11:09,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:09,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 19:11:09,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:09,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 19:11:09,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 19:11:09,992 INFO L87 Difference]: Start difference. First operand has 2452 states, 2447 states have (on average 3.5435226808336737) internal successors, (8671), 2451 states have internal predecessors, (8671), 0 states have call successors, (0), 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 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:10,130 INFO L93 Difference]: Finished difference Result 2452 states and 7985 transitions. [2021-11-25 19:11:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 19:11:10,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-11-25 19:11:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:10,182 INFO L225 Difference]: With dead ends: 2452 [2021-11-25 19:11:10,183 INFO L226 Difference]: Without dead ends: 2450 [2021-11-25 19:11:10,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 19:11:10,188 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:10,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:11:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2021-11-25 19:11:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2021-11-25 19:11:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2446 states have (on average 3.2632869991823386) internal successors, (7982), 2449 states have internal predecessors, (7982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 7982 transitions. [2021-11-25 19:11:10,422 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 7982 transitions. Word has length 13 [2021-11-25 19:11:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:10,423 INFO L470 AbstractCegarLoop]: Abstraction has 2450 states and 7982 transitions. [2021-11-25 19:11:10,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 7982 transitions. [2021-11-25 19:11:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 19:11:10,427 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:10,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:10,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 19:11:10,428 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -780183603, now seen corresponding path program 1 times [2021-11-25 19:11:10,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:10,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690685824] [2021-11-25 19:11:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:10,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:10,691 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:10,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690685824] [2021-11-25 19:11:10,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690685824] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:10,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:10,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 19:11:10,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3991527] [2021-11-25 19:11:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:10,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 19:11:10,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:10,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 19:11:10,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:11:10,694 INFO L87 Difference]: Start difference. First operand 2450 states and 7982 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:11,200 INFO L93 Difference]: Finished difference Result 2641 states and 8501 transitions. [2021-11-25 19:11:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 19:11:11,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-25 19:11:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:11,234 INFO L225 Difference]: With dead ends: 2641 [2021-11-25 19:11:11,234 INFO L226 Difference]: Without dead ends: 2539 [2021-11-25 19:11:11,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:11:11,236 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:11,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 20 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 19:11:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2021-11-25 19:11:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2437. [2021-11-25 19:11:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 2433 states have (on average 3.2692149609535552) internal successors, (7954), 2436 states have internal predecessors, (7954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 7954 transitions. [2021-11-25 19:11:11,399 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 7954 transitions. Word has length 17 [2021-11-25 19:11:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:11,400 INFO L470 AbstractCegarLoop]: Abstraction has 2437 states and 7954 transitions. [2021-11-25 19:11:11,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 7954 transitions. [2021-11-25 19:11:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 19:11:11,403 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:11,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:11,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 19:11:11,404 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:11,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:11,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1334173546, now seen corresponding path program 1 times [2021-11-25 19:11:11,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:11,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778850298] [2021-11-25 19:11:11,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:11,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:11,690 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:11,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778850298] [2021-11-25 19:11:11,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778850298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:11,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:11,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 19:11:11,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848327631] [2021-11-25 19:11:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:11,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 19:11:11,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:11,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 19:11:11,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:11:11,692 INFO L87 Difference]: Start difference. First operand 2437 states and 7954 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:12,391 INFO L93 Difference]: Finished difference Result 3522 states and 11540 transitions. [2021-11-25 19:11:12,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 19:11:12,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-25 19:11:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:12,467 INFO L225 Difference]: With dead ends: 3522 [2021-11-25 19:11:12,467 INFO L226 Difference]: Without dead ends: 3361 [2021-11-25 19:11:12,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:11:12,468 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 147 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:12,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 13 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 19:11:12,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2021-11-25 19:11:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3010. [2021-11-25 19:11:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 3006 states have (on average 3.2887558216899535) internal successors, (9886), 3009 states have internal predecessors, (9886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 9886 transitions. [2021-11-25 19:11:12,632 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 9886 transitions. Word has length 18 [2021-11-25 19:11:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:12,632 INFO L470 AbstractCegarLoop]: Abstraction has 3010 states and 9886 transitions. [2021-11-25 19:11:12,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:12,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 9886 transitions. [2021-11-25 19:11:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 19:11:12,637 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:12,637 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:12,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 19:11:12,638 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:12,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash 281159732, now seen corresponding path program 2 times [2021-11-25 19:11:12,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:12,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035905313] [2021-11-25 19:11:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:12,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:12,905 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:12,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035905313] [2021-11-25 19:11:12,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035905313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:12,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:12,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 19:11:12,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450798464] [2021-11-25 19:11:12,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:12,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 19:11:12,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:12,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 19:11:12,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:11:12,907 INFO L87 Difference]: Start difference. First operand 3010 states and 9886 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:13,562 INFO L93 Difference]: Finished difference Result 3276 states and 10612 transitions. [2021-11-25 19:11:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 19:11:13,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-25 19:11:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:13,595 INFO L225 Difference]: With dead ends: 3276 [2021-11-25 19:11:13,595 INFO L226 Difference]: Without dead ends: 3126 [2021-11-25 19:11:13,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:11:13,598 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 139 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:13,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 14 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 19:11:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2021-11-25 19:11:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 2928. [2021-11-25 19:11:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2924 states have (on average 3.2797537619699044) internal successors, (9590), 2927 states have internal predecessors, (9590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 9590 transitions. [2021-11-25 19:11:13,728 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 9590 transitions. Word has length 18 [2021-11-25 19:11:13,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:13,729 INFO L470 AbstractCegarLoop]: Abstraction has 2928 states and 9590 transitions. [2021-11-25 19:11:13,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:13,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 9590 transitions. [2021-11-25 19:11:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:13,735 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:13,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:13,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 19:11:13,736 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:13,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1307091812, now seen corresponding path program 1 times [2021-11-25 19:11:13,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:13,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052898585] [2021-11-25 19:11:13,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:13,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:14,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:14,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052898585] [2021-11-25 19:11:14,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052898585] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:14,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:14,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:11:14,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104718007] [2021-11-25 19:11:14,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:14,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:11:14,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:14,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:11:14,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:11:14,313 INFO L87 Difference]: Start difference. First operand 2928 states and 9590 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:15,711 INFO L93 Difference]: Finished difference Result 3243 states and 10507 transitions. [2021-11-25 19:11:15,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:11:15,712 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:15,742 INFO L225 Difference]: With dead ends: 3243 [2021-11-25 19:11:15,742 INFO L226 Difference]: Without dead ends: 3139 [2021-11-25 19:11:15,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2021-11-25 19:11:15,743 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 278 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:15,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 16 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 19:11:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2021-11-25 19:11:15,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2984. [2021-11-25 19:11:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2984 states, 2980 states have (on average 3.279194630872483) internal successors, (9772), 2983 states have internal predecessors, (9772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 9772 transitions. [2021-11-25 19:11:15,850 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 9772 transitions. Word has length 25 [2021-11-25 19:11:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:15,851 INFO L470 AbstractCegarLoop]: Abstraction has 2984 states and 9772 transitions. [2021-11-25 19:11:15,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 9772 transitions. [2021-11-25 19:11:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:15,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:15,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:15,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 19:11:15,858 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1416519606, now seen corresponding path program 1 times [2021-11-25 19:11:15,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:15,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782194285] [2021-11-25 19:11:15,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:15,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:16,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:16,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782194285] [2021-11-25 19:11:16,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782194285] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:16,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:16,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:11:16,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983857546] [2021-11-25 19:11:16,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:16,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:11:16,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:16,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:11:16,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:11:16,343 INFO L87 Difference]: Start difference. First operand 2984 states and 9772 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:17,435 INFO L93 Difference]: Finished difference Result 3292 states and 10661 transitions. [2021-11-25 19:11:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 19:11:17,435 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:17,453 INFO L225 Difference]: With dead ends: 3292 [2021-11-25 19:11:17,454 INFO L226 Difference]: Without dead ends: 3188 [2021-11-25 19:11:17,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:11:17,455 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 214 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:17,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 16 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-25 19:11:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2021-11-25 19:11:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3033. [2021-11-25 19:11:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 3029 states have (on average 3.2769891053152858) internal successors, (9926), 3032 states have internal predecessors, (9926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 9926 transitions. [2021-11-25 19:11:17,562 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 9926 transitions. Word has length 25 [2021-11-25 19:11:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:17,562 INFO L470 AbstractCegarLoop]: Abstraction has 3033 states and 9926 transitions. [2021-11-25 19:11:17,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 9926 transitions. [2021-11-25 19:11:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:17,569 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:17,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:17,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 19:11:17,569 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash -325293552, now seen corresponding path program 2 times [2021-11-25 19:11:17,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:17,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209792161] [2021-11-25 19:11:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:17,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:18,055 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:18,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209792161] [2021-11-25 19:11:18,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209792161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:18,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:18,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:11:18,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661395603] [2021-11-25 19:11:18,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:18,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:11:18,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:18,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:11:18,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:11:18,057 INFO L87 Difference]: Start difference. First operand 3033 states and 9926 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:19,897 INFO L93 Difference]: Finished difference Result 4031 states and 13080 transitions. [2021-11-25 19:11:19,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:11:19,897 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:19,926 INFO L225 Difference]: With dead ends: 4031 [2021-11-25 19:11:19,926 INFO L226 Difference]: Without dead ends: 3927 [2021-11-25 19:11:19,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2021-11-25 19:11:19,928 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 298 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:19,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 29 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:11:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2021-11-25 19:11:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 3208. [2021-11-25 19:11:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3204 states have (on average 3.2936953807740323) internal successors, (10553), 3207 states have internal predecessors, (10553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 10553 transitions. [2021-11-25 19:11:20,045 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 10553 transitions. Word has length 25 [2021-11-25 19:11:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:20,046 INFO L470 AbstractCegarLoop]: Abstraction has 3208 states and 10553 transitions. [2021-11-25 19:11:20,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 10553 transitions. [2021-11-25 19:11:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:20,058 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:20,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:20,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 19:11:20,059 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:20,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:20,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2025687736, now seen corresponding path program 3 times [2021-11-25 19:11:20,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:20,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973652980] [2021-11-25 19:11:20,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:20,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:20,584 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:20,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973652980] [2021-11-25 19:11:20,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973652980] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:20,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:20,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:11:20,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784800804] [2021-11-25 19:11:20,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:20,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:11:20,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:20,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:11:20,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:11:20,586 INFO L87 Difference]: Start difference. First operand 3208 states and 10553 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:22,530 INFO L93 Difference]: Finished difference Result 4009 states and 13022 transitions. [2021-11-25 19:11:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:11:22,531 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:22,547 INFO L225 Difference]: With dead ends: 4009 [2021-11-25 19:11:22,548 INFO L226 Difference]: Without dead ends: 3905 [2021-11-25 19:11:22,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2021-11-25 19:11:22,549 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 305 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:22,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 36 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:11:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2021-11-25 19:11:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3445. [2021-11-25 19:11:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 3441 states have (on average 3.308921825050857) internal successors, (11386), 3444 states have internal predecessors, (11386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 11386 transitions. [2021-11-25 19:11:22,662 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 11386 transitions. Word has length 25 [2021-11-25 19:11:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:22,663 INFO L470 AbstractCegarLoop]: Abstraction has 3445 states and 11386 transitions. [2021-11-25 19:11:22,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 11386 transitions. [2021-11-25 19:11:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:22,672 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:22,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:22,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 19:11:22,672 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:22,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2045096728, now seen corresponding path program 4 times [2021-11-25 19:11:22,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:22,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842302326] [2021-11-25 19:11:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:22,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:23,197 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:23,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842302326] [2021-11-25 19:11:23,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842302326] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:23,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:23,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:11:23,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606723248] [2021-11-25 19:11:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:23,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:11:23,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:11:23,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:11:23,200 INFO L87 Difference]: Start difference. First operand 3445 states and 11386 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:25,276 INFO L93 Difference]: Finished difference Result 4040 states and 13032 transitions. [2021-11-25 19:11:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 19:11:25,277 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:25,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:25,295 INFO L225 Difference]: With dead ends: 4040 [2021-11-25 19:11:25,295 INFO L226 Difference]: Without dead ends: 3936 [2021-11-25 19:11:25,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=338, Invalid=784, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 19:11:25,296 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 303 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:25,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 46 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 19:11:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2021-11-25 19:11:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3567. [2021-11-25 19:11:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3567 states, 3563 states have (on average 3.2756104406399102) internal successors, (11671), 3566 states have internal predecessors, (11671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 11671 transitions. [2021-11-25 19:11:25,422 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 11671 transitions. Word has length 25 [2021-11-25 19:11:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:25,423 INFO L470 AbstractCegarLoop]: Abstraction has 3567 states and 11671 transitions. [2021-11-25 19:11:25,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 11671 transitions. [2021-11-25 19:11:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:25,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:25,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:25,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 19:11:25,433 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2028950726, now seen corresponding path program 2 times [2021-11-25 19:11:25,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:25,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183860474] [2021-11-25 19:11:25,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:25,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:25,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:25,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183860474] [2021-11-25 19:11:25,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183860474] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:25,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:25,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:11:25,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618928757] [2021-11-25 19:11:25,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:25,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:11:25,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:25,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:11:25,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:11:25,790 INFO L87 Difference]: Start difference. First operand 3567 states and 11671 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:27,564 INFO L93 Difference]: Finished difference Result 4455 states and 14323 transitions. [2021-11-25 19:11:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:11:27,564 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:27,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:27,585 INFO L225 Difference]: With dead ends: 4455 [2021-11-25 19:11:27,585 INFO L226 Difference]: Without dead ends: 4351 [2021-11-25 19:11:27,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2021-11-25 19:11:27,586 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 253 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:27,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 30 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 19:11:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4351 states. [2021-11-25 19:11:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4351 to 3847. [2021-11-25 19:11:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3847 states, 3843 states have (on average 3.265938069216758) internal successors, (12551), 3846 states have internal predecessors, (12551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 12551 transitions. [2021-11-25 19:11:27,735 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 12551 transitions. Word has length 25 [2021-11-25 19:11:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:27,736 INFO L470 AbstractCegarLoop]: Abstraction has 3847 states and 12551 transitions. [2021-11-25 19:11:27,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 12551 transitions. [2021-11-25 19:11:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:27,746 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:27,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:27,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 19:11:27,747 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:27,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1347164886, now seen corresponding path program 3 times [2021-11-25 19:11:27,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:27,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94890349] [2021-11-25 19:11:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:27,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:28,146 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:28,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94890349] [2021-11-25 19:11:28,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94890349] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:28,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:28,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:11:28,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94296823] [2021-11-25 19:11:28,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:28,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:11:28,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:28,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:11:28,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:11:28,149 INFO L87 Difference]: Start difference. First operand 3847 states and 12551 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:29,922 INFO L93 Difference]: Finished difference Result 4376 states and 14125 transitions. [2021-11-25 19:11:29,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 19:11:29,923 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:29,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:29,936 INFO L225 Difference]: With dead ends: 4376 [2021-11-25 19:11:29,936 INFO L226 Difference]: Without dead ends: 4375 [2021-11-25 19:11:29,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=560, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:11:29,937 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 187 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:29,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 30 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 19:11:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4375 states. [2021-11-25 19:11:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4375 to 4119. [2021-11-25 19:11:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4119 states, 4115 states have (on average 3.2478736330498177) internal successors, (13365), 4118 states have internal predecessors, (13365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 13365 transitions. [2021-11-25 19:11:30,057 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 13365 transitions. Word has length 25 [2021-11-25 19:11:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:30,058 INFO L470 AbstractCegarLoop]: Abstraction has 4119 states and 13365 transitions. [2021-11-25 19:11:30,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 13365 transitions. [2021-11-25 19:11:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:30,068 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:30,068 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:30,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 19:11:30,068 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:30,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:30,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1272367008, now seen corresponding path program 5 times [2021-11-25 19:11:30,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:30,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878392027] [2021-11-25 19:11:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:30,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:30,557 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:30,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878392027] [2021-11-25 19:11:30,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878392027] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:30,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:30,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:11:30,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340876052] [2021-11-25 19:11:30,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:30,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:11:30,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:30,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:11:30,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:11:30,559 INFO L87 Difference]: Start difference. First operand 4119 states and 13365 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:32,142 INFO L93 Difference]: Finished difference Result 5542 states and 17857 transitions. [2021-11-25 19:11:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:11:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:32,152 INFO L225 Difference]: With dead ends: 5542 [2021-11-25 19:11:32,152 INFO L226 Difference]: Without dead ends: 5438 [2021-11-25 19:11:32,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2021-11-25 19:11:32,153 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 284 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:32,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 40 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 19:11:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5438 states. [2021-11-25 19:11:32,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5438 to 4343. [2021-11-25 19:11:32,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4343 states, 4339 states have (on average 3.27402627333487) internal successors, (14206), 4342 states have internal predecessors, (14206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 14206 transitions. [2021-11-25 19:11:32,282 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 14206 transitions. Word has length 25 [2021-11-25 19:11:32,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:32,283 INFO L470 AbstractCegarLoop]: Abstraction has 4343 states and 14206 transitions. [2021-11-25 19:11:32,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 14206 transitions. [2021-11-25 19:11:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:32,294 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:32,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:32,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 19:11:32,295 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:32,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:32,295 INFO L85 PathProgramCache]: Analyzing trace with hash -671619000, now seen corresponding path program 6 times [2021-11-25 19:11:32,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:32,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802272343] [2021-11-25 19:11:32,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:32,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:32,722 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:32,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802272343] [2021-11-25 19:11:32,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802272343] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:32,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:32,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:11:32,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323022674] [2021-11-25 19:11:32,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:32,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:11:32,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:32,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:11:32,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:11:32,724 INFO L87 Difference]: Start difference. First operand 4343 states and 14206 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:34,407 INFO L93 Difference]: Finished difference Result 5574 states and 17976 transitions. [2021-11-25 19:11:34,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:11:34,408 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:34,418 INFO L225 Difference]: With dead ends: 5574 [2021-11-25 19:11:34,418 INFO L226 Difference]: Without dead ends: 5470 [2021-11-25 19:11:34,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=692, Unknown=0, NotChecked=0, Total=930 [2021-11-25 19:11:34,419 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 289 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:34,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 35 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 19:11:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5470 states. [2021-11-25 19:11:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5470 to 4735. [2021-11-25 19:11:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4735 states, 4731 states have (on average 3.295286408793067) internal successors, (15590), 4734 states have internal predecessors, (15590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 15590 transitions. [2021-11-25 19:11:34,557 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 15590 transitions. Word has length 25 [2021-11-25 19:11:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:34,558 INFO L470 AbstractCegarLoop]: Abstraction has 4735 states and 15590 transitions. [2021-11-25 19:11:34,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 15590 transitions. [2021-11-25 19:11:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:34,568 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:34,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:34,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-25 19:11:34,569 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:34,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash -652210008, now seen corresponding path program 7 times [2021-11-25 19:11:34,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:34,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839551978] [2021-11-25 19:11:34,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:34,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:34,964 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:34,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839551978] [2021-11-25 19:11:34,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839551978] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:34,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:34,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:11:34,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897076235] [2021-11-25 19:11:34,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:34,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:11:34,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:34,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:11:34,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:11:34,966 INFO L87 Difference]: Start difference. First operand 4735 states and 15590 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:36,911 INFO L93 Difference]: Finished difference Result 7173 states and 23750 transitions. [2021-11-25 19:11:36,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:11:36,922 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:36,939 INFO L225 Difference]: With dead ends: 7173 [2021-11-25 19:11:36,939 INFO L226 Difference]: Without dead ends: 7173 [2021-11-25 19:11:36,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:11:36,940 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 352 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 2360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:36,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 81 Invalid, 2390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2360 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:11:36,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7173 states. [2021-11-25 19:11:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7173 to 5796. [2021-11-25 19:11:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5796 states, 5792 states have (on average 3.288328729281768) internal successors, (19046), 5795 states have internal predecessors, (19046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5796 states to 5796 states and 19046 transitions. [2021-11-25 19:11:37,169 INFO L78 Accepts]: Start accepts. Automaton has 5796 states and 19046 transitions. Word has length 25 [2021-11-25 19:11:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:37,170 INFO L470 AbstractCegarLoop]: Abstraction has 5796 states and 19046 transitions. [2021-11-25 19:11:37,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5796 states and 19046 transitions. [2021-11-25 19:11:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:37,182 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:37,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:37,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-25 19:11:37,183 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:37,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash -652210007, now seen corresponding path program 1 times [2021-11-25 19:11:37,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:37,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747006470] [2021-11-25 19:11:37,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:37,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:37,659 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:37,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747006470] [2021-11-25 19:11:37,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747006470] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:37,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:37,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:11:37,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689454743] [2021-11-25 19:11:37,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:37,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:11:37,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:37,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:11:37,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:11:37,661 INFO L87 Difference]: Start difference. First operand 5796 states and 19046 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:40,349 INFO L93 Difference]: Finished difference Result 6943 states and 22226 transitions. [2021-11-25 19:11:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 19:11:40,350 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:40,362 INFO L225 Difference]: With dead ends: 6943 [2021-11-25 19:11:40,362 INFO L226 Difference]: Without dead ends: 6790 [2021-11-25 19:11:40,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=445, Invalid=1115, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 19:11:40,364 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 271 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:40,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 60 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:11:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2021-11-25 19:11:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 5652. [2021-11-25 19:11:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5652 states, 5648 states have (on average 3.263810198300283) internal successors, (18434), 5651 states have internal predecessors, (18434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5652 states to 5652 states and 18434 transitions. [2021-11-25 19:11:40,514 INFO L78 Accepts]: Start accepts. Automaton has 5652 states and 18434 transitions. Word has length 25 [2021-11-25 19:11:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:40,514 INFO L470 AbstractCegarLoop]: Abstraction has 5652 states and 18434 transitions. [2021-11-25 19:11:40,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5652 states and 18434 transitions. [2021-11-25 19:11:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:40,526 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:40,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] [2021-11-25 19:11:40,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-25 19:11:40,527 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:40,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1485885564, now seen corresponding path program 8 times [2021-11-25 19:11:40,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:40,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760090066] [2021-11-25 19:11:40,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:40,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:40,999 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:40,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760090066] [2021-11-25 19:11:40,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760090066] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:41,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:41,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:11:41,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308461133] [2021-11-25 19:11:41,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:41,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:11:41,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:11:41,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:11:41,002 INFO L87 Difference]: Start difference. First operand 5652 states and 18434 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:42,397 INFO L93 Difference]: Finished difference Result 6286 states and 20289 transitions. [2021-11-25 19:11:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 19:11:42,398 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:42,410 INFO L225 Difference]: With dead ends: 6286 [2021-11-25 19:11:42,410 INFO L226 Difference]: Without dead ends: 6182 [2021-11-25 19:11:42,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:11:42,411 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 247 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:42,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 36 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 19:11:42,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6182 states. [2021-11-25 19:11:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6182 to 5734. [2021-11-25 19:11:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5734 states, 5730 states have (on average 3.262478184991274) internal successors, (18694), 5733 states have internal predecessors, (18694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 18694 transitions. [2021-11-25 19:11:42,534 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 18694 transitions. Word has length 25 [2021-11-25 19:11:42,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:42,534 INFO L470 AbstractCegarLoop]: Abstraction has 5734 states and 18694 transitions. [2021-11-25 19:11:42,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 18694 transitions. [2021-11-25 19:11:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:42,546 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:42,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] [2021-11-25 19:11:42,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-25 19:11:42,547 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:42,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash 865095724, now seen corresponding path program 9 times [2021-11-25 19:11:42,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:42,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478913565] [2021-11-25 19:11:42,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:42,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:42,990 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:42,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478913565] [2021-11-25 19:11:42,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478913565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:42,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:42,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:11:42,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011784154] [2021-11-25 19:11:42,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:42,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:11:42,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:42,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:11:42,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:11:42,992 INFO L87 Difference]: Start difference. First operand 5734 states and 18694 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:44,709 INFO L93 Difference]: Finished difference Result 6896 states and 22358 transitions. [2021-11-25 19:11:44,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:11:44,709 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:44,722 INFO L225 Difference]: With dead ends: 6896 [2021-11-25 19:11:44,723 INFO L226 Difference]: Without dead ends: 6792 [2021-11-25 19:11:44,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=579, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:11:44,723 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 268 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:44,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 45 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 19:11:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6792 states. [2021-11-25 19:11:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6792 to 6143. [2021-11-25 19:11:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6143 states, 6139 states have (on average 3.2765922788727804) internal successors, (20115), 6142 states have internal predecessors, (20115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6143 states to 6143 states and 20115 transitions. [2021-11-25 19:11:44,878 INFO L78 Accepts]: Start accepts. Automaton has 6143 states and 20115 transitions. Word has length 25 [2021-11-25 19:11:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:44,878 INFO L470 AbstractCegarLoop]: Abstraction has 6143 states and 20115 transitions. [2021-11-25 19:11:44,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 6143 states and 20115 transitions. [2021-11-25 19:11:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:44,891 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:44,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:44,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-25 19:11:44,892 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-25 19:11:44,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash 884504716, now seen corresponding path program 10 times [2021-11-25 19:11:44,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:44,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924699106] [2021-11-25 19:11:44,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:44,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:45,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-25 19:11:45,290 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:45,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924699106] [2021-11-25 19:11:45,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924699106] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:45,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:45,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:11:45,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36887338] [2021-11-25 19:11:45,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:45,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:11:45,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:45,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:11:45,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:11:45,291 INFO L87 Difference]: Start difference. First operand 6143 states and 20115 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:48,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:48,088 INFO L93 Difference]: Finished difference Result 7624 states and 24422 transitions. [2021-11-25 19:11:48,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 19:11:48,089 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:48,103 INFO L225 Difference]: With dead ends: 7624 [2021-11-25 19:11:48,103 INFO L226 Difference]: Without dead ends: 7520 [2021-11-25 19:11:48,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=471, Invalid=1169, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 19:11:48,104 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 238 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 2327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:48,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 62 Invalid, 2327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:11:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7520 states. [2021-11-25 19:11:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7520 to 5777. [2021-11-25 19:11:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5777 states, 5773 states have (on average 3.2605231248917375) internal successors, (18823), 5776 states have internal predecessors, (18823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5777 states to 5777 states and 18823 transitions. [2021-11-25 19:11:48,314 INFO L78 Accepts]: Start accepts. Automaton has 5777 states and 18823 transitions. Word has length 25 [2021-11-25 19:11:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:48,315 INFO L470 AbstractCegarLoop]: Abstraction has 5777 states and 18823 transitions. [2021-11-25 19:11:48,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5777 states and 18823 transitions. [2021-11-25 19:11:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:48,326 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:48,327 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:48,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-25 19:11:48,327 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash -377685254, now seen corresponding path program 11 times [2021-11-25 19:11:48,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:48,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326159976] [2021-11-25 19:11:48,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:48,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:48,653 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:48,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326159976] [2021-11-25 19:11:48,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326159976] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:48,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:48,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:11:48,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881824316] [2021-11-25 19:11:48,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:48,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:11:48,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:48,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:11:48,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:11:48,654 INFO L87 Difference]: Start difference. First operand 5777 states and 18823 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:50,557 INFO L93 Difference]: Finished difference Result 6453 states and 20893 transitions. [2021-11-25 19:11:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:11:50,557 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:50,571 INFO L225 Difference]: With dead ends: 6453 [2021-11-25 19:11:50,571 INFO L226 Difference]: Without dead ends: 6349 [2021-11-25 19:11:50,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2021-11-25 19:11:50,572 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 205 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:50,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 46 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 19:11:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6349 states. [2021-11-25 19:11:50,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6349 to 5919. [2021-11-25 19:11:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5919 states, 5915 states have (on average 3.25832628909552) internal successors, (19273), 5918 states have internal predecessors, (19273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5919 states to 5919 states and 19273 transitions. [2021-11-25 19:11:50,790 INFO L78 Accepts]: Start accepts. Automaton has 5919 states and 19273 transitions. Word has length 25 [2021-11-25 19:11:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:50,790 INFO L470 AbstractCegarLoop]: Abstraction has 5919 states and 19273 transitions. [2021-11-25 19:11:50,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5919 states and 19273 transitions. [2021-11-25 19:11:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:50,807 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:50,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:50,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-25 19:11:50,808 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:50,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1906198596, now seen corresponding path program 12 times [2021-11-25 19:11:50,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:50,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526653761] [2021-11-25 19:11:50,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:50,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:51,207 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:51,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526653761] [2021-11-25 19:11:51,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526653761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:51,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:51,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:11:51,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872017064] [2021-11-25 19:11:51,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:51,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:11:51,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:51,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:11:51,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:11:51,209 INFO L87 Difference]: Start difference. First operand 5919 states and 19273 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:54,391 INFO L93 Difference]: Finished difference Result 7318 states and 23528 transitions. [2021-11-25 19:11:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 19:11:54,391 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:54,406 INFO L225 Difference]: With dead ends: 7318 [2021-11-25 19:11:54,406 INFO L226 Difference]: Without dead ends: 7214 [2021-11-25 19:11:54,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=513, Invalid=1293, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 19:11:54,408 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 314 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:54,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 72 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 19:11:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7214 states. [2021-11-25 19:11:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7214 to 5527. [2021-11-25 19:11:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5527 states, 5523 states have (on average 3.2647112076769873) internal successors, (18031), 5526 states have internal predecessors, (18031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5527 states to 5527 states and 18031 transitions. [2021-11-25 19:11:54,529 INFO L78 Accepts]: Start accepts. Automaton has 5527 states and 18031 transitions. Word has length 25 [2021-11-25 19:11:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:54,530 INFO L470 AbstractCegarLoop]: Abstraction has 5527 states and 18031 transitions. [2021-11-25 19:11:54,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5527 states and 18031 transitions. [2021-11-25 19:11:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:54,538 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:54,538 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:54,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-25 19:11:54,538 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-25 19:11:54,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2087370654, now seen corresponding path program 13 times [2021-11-25 19:11:54,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:54,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614163632] [2021-11-25 19:11:54,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:54,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:11:54,955 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:54,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614163632] [2021-11-25 19:11:54,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614163632] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:54,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:54,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:11:54,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915352250] [2021-11-25 19:11:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:54,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:11:54,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:54,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:11:54,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:11:54,957 INFO L87 Difference]: Start difference. First operand 5527 states and 18031 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:58,567 INFO L93 Difference]: Finished difference Result 6893 states and 22034 transitions. [2021-11-25 19:11:58,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 19:11:58,567 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:11:58,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:58,581 INFO L225 Difference]: With dead ends: 6893 [2021-11-25 19:11:58,581 INFO L226 Difference]: Without dead ends: 6789 [2021-11-25 19:11:58,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=594, Invalid=1662, Unknown=0, NotChecked=0, Total=2256 [2021-11-25 19:11:58,583 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 297 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 2952 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:58,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 83 Invalid, 2987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2952 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 19:11:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6789 states. [2021-11-25 19:11:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6789 to 5291. [2021-11-25 19:11:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 5287 states have (on average 3.243994703990921) internal successors, (17151), 5290 states have internal predecessors, (17151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 17151 transitions. [2021-11-25 19:11:58,696 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 17151 transitions. Word has length 25 [2021-11-25 19:11:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:58,696 INFO L470 AbstractCegarLoop]: Abstraction has 5291 states and 17151 transitions. [2021-11-25 19:11:58,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 17151 transitions. [2021-11-25 19:11:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:11:58,705 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:58,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:11:58,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-25 19:11:58,705 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:11:58,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:58,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1463852106, now seen corresponding path program 4 times [2021-11-25 19:11:58,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:58,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826967481] [2021-11-25 19:11:58,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:58,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:59,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-25 19:11:59,052 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:59,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826967481] [2021-11-25 19:11:59,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826967481] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:11:59,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:11:59,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:11:59,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858818497] [2021-11-25 19:11:59,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:59,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:11:59,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:59,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:11:59,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:11:59,054 INFO L87 Difference]: Start difference. First operand 5291 states and 17151 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:01,651 INFO L93 Difference]: Finished difference Result 7114 states and 22508 transitions. [2021-11-25 19:12:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 19:12:01,651 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:12:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:01,666 INFO L225 Difference]: With dead ends: 7114 [2021-11-25 19:12:01,666 INFO L226 Difference]: Without dead ends: 7010 [2021-11-25 19:12:01,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=349, Invalid=841, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 19:12:01,668 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 207 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:01,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 54 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2478 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 19:12:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7010 states. [2021-11-25 19:12:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7010 to 5911. [2021-11-25 19:12:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5911 states, 5907 states have (on average 3.221770780429998) internal successors, (19031), 5910 states have internal predecessors, (19031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 19031 transitions. [2021-11-25 19:12:01,783 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 19031 transitions. Word has length 25 [2021-11-25 19:12:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:01,783 INFO L470 AbstractCegarLoop]: Abstraction has 5911 states and 19031 transitions. [2021-11-25 19:12:01,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 19031 transitions. [2021-11-25 19:12:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:12:01,792 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:01,792 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:01,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-25 19:12:01,792 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:01,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:01,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1776481424, now seen corresponding path program 5 times [2021-11-25 19:12:01,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:01,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951822070] [2021-11-25 19:12:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:01,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:02,091 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:02,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951822070] [2021-11-25 19:12:02,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951822070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:02,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:02,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:12:02,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688921778] [2021-11-25 19:12:02,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:02,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:12:02,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:02,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:12:02,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:12:02,093 INFO L87 Difference]: Start difference. First operand 5911 states and 19031 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:04,547 INFO L93 Difference]: Finished difference Result 7543 states and 23938 transitions. [2021-11-25 19:12:04,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 19:12:04,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:12:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:04,565 INFO L225 Difference]: With dead ends: 7543 [2021-11-25 19:12:04,565 INFO L226 Difference]: Without dead ends: 7439 [2021-11-25 19:12:04,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=385, Invalid=947, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 19:12:04,566 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 208 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:04,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 54 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2206 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:12:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7439 states. [2021-11-25 19:12:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7439 to 5671. [2021-11-25 19:12:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5671 states, 5667 states have (on average 3.23116287277219) internal successors, (18311), 5670 states have internal predecessors, (18311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5671 states to 5671 states and 18311 transitions. [2021-11-25 19:12:04,733 INFO L78 Accepts]: Start accepts. Automaton has 5671 states and 18311 transitions. Word has length 25 [2021-11-25 19:12:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:04,734 INFO L470 AbstractCegarLoop]: Abstraction has 5671 states and 18311 transitions. [2021-11-25 19:12:04,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 5671 states and 18311 transitions. [2021-11-25 19:12:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:12:04,744 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:04,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:04,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-25 19:12:04,744 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:04,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:04,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1019653420, now seen corresponding path program 6 times [2021-11-25 19:12:04,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:04,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15484166] [2021-11-25 19:12:04,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:04,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:05,055 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:05,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15484166] [2021-11-25 19:12:05,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15484166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:05,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:05,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:12:05,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49863165] [2021-11-25 19:12:05,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:05,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:12:05,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:05,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:12:05,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:12:05,057 INFO L87 Difference]: Start difference. First operand 5671 states and 18311 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:07,486 INFO L93 Difference]: Finished difference Result 7127 states and 22545 transitions. [2021-11-25 19:12:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 19:12:07,486 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:12:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:07,500 INFO L225 Difference]: With dead ends: 7127 [2021-11-25 19:12:07,500 INFO L226 Difference]: Without dead ends: 6961 [2021-11-25 19:12:07,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:12:07,503 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 218 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:07,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 57 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:12:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6961 states. [2021-11-25 19:12:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6961 to 5245. [2021-11-25 19:12:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5245 states, 5241 states have (on average 3.2135088723526044) internal successors, (16842), 5244 states have internal predecessors, (16842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5245 states to 5245 states and 16842 transitions. [2021-11-25 19:12:07,613 INFO L78 Accepts]: Start accepts. Automaton has 5245 states and 16842 transitions. Word has length 25 [2021-11-25 19:12:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:07,614 INFO L470 AbstractCegarLoop]: Abstraction has 5245 states and 16842 transitions. [2021-11-25 19:12:07,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5245 states and 16842 transitions. [2021-11-25 19:12:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:07,619 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:07,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:07,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-25 19:12:07,620 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:07,620 INFO L85 PathProgramCache]: Analyzing trace with hash -791090139, now seen corresponding path program 1 times [2021-11-25 19:12:07,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:07,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562807431] [2021-11-25 19:12:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:07,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:08,237 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:08,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562807431] [2021-11-25 19:12:08,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562807431] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:08,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:08,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 19:12:08,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314600922] [2021-11-25 19:12:08,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:08,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 19:12:08,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 19:12:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-25 19:12:08,239 INFO L87 Difference]: Start difference. First operand 5245 states and 16842 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:10,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:10,166 INFO L93 Difference]: Finished difference Result 7058 states and 22866 transitions. [2021-11-25 19:12:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:12:10,167 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:10,183 INFO L225 Difference]: With dead ends: 7058 [2021-11-25 19:12:10,183 INFO L226 Difference]: Without dead ends: 7058 [2021-11-25 19:12:10,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-25 19:12:10,184 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 296 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:10,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 41 Invalid, 2488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:12:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2021-11-25 19:12:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 5838. [2021-11-25 19:12:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5838 states, 5834 states have (on average 3.21957490572506) internal successors, (18783), 5837 states have internal predecessors, (18783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 18783 transitions. [2021-11-25 19:12:10,326 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 18783 transitions. Word has length 27 [2021-11-25 19:12:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:10,326 INFO L470 AbstractCegarLoop]: Abstraction has 5838 states and 18783 transitions. [2021-11-25 19:12:10,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 18783 transitions. [2021-11-25 19:12:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:10,333 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:10,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:10,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-25 19:12:10,333 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:10,334 INFO L85 PathProgramCache]: Analyzing trace with hash -144571469, now seen corresponding path program 1 times [2021-11-25 19:12:10,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:10,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309744732] [2021-11-25 19:12:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:10,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:10,964 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:10,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309744732] [2021-11-25 19:12:10,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309744732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:10,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:10,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:12:10,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852728628] [2021-11-25 19:12:10,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:10,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 19:12:10,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:10,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 19:12:10,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-11-25 19:12:10,966 INFO L87 Difference]: Start difference. First operand 5838 states and 18783 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-25 19:12:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:12,959 INFO L93 Difference]: Finished difference Result 7872 states and 25473 transitions. [2021-11-25 19:12:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 19:12:12,960 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-25 19:12:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:12,975 INFO L225 Difference]: With dead ends: 7872 [2021-11-25 19:12:12,975 INFO L226 Difference]: Without dead ends: 7872 [2021-11-25 19:12:12,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:12:12,976 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 302 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:12,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 40 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:12:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7872 states. [2021-11-25 19:12:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7872 to 6214. [2021-11-25 19:12:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6214 states, 6210 states have (on average 3.2114331723027374) internal successors, (19943), 6213 states have internal predecessors, (19943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 19943 transitions. [2021-11-25 19:12:13,103 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 19943 transitions. Word has length 27 [2021-11-25 19:12:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:13,103 INFO L470 AbstractCegarLoop]: Abstraction has 6214 states and 19943 transitions. [2021-11-25 19:12:13,103 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-25 19:12:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 19943 transitions. [2021-11-25 19:12:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:13,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:13,109 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:13,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-25 19:12:13,110 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:13,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:13,110 INFO L85 PathProgramCache]: Analyzing trace with hash -144571468, now seen corresponding path program 1 times [2021-11-25 19:12:13,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:13,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867365786] [2021-11-25 19:12:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:13,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:13,679 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867365786] [2021-11-25 19:12:13,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867365786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:13,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:13,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:12:13,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537068688] [2021-11-25 19:12:13,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:13,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 19:12:13,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:13,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 19:12:13,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-11-25 19:12:13,681 INFO L87 Difference]: Start difference. First operand 6214 states and 19943 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-25 19:12:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:15,383 INFO L93 Difference]: Finished difference Result 7782 states and 25135 transitions. [2021-11-25 19:12:15,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 19:12:15,384 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-25 19:12:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:15,399 INFO L225 Difference]: With dead ends: 7782 [2021-11-25 19:12:15,399 INFO L226 Difference]: Without dead ends: 7782 [2021-11-25 19:12:15,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:12:15,400 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 283 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:15,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 40 Invalid, 2291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2260 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:12:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7782 states. [2021-11-25 19:12:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7782 to 6214. [2021-11-25 19:12:15,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6214 states, 6210 states have (on average 3.2099838969404186) internal successors, (19934), 6213 states have internal predecessors, (19934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 19934 transitions. [2021-11-25 19:12:15,525 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 19934 transitions. Word has length 27 [2021-11-25 19:12:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:15,525 INFO L470 AbstractCegarLoop]: Abstraction has 6214 states and 19934 transitions. [2021-11-25 19:12:15,525 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-25 19:12:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 19934 transitions. [2021-11-25 19:12:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:15,531 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:15,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-25 19:12:15,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-25 19:12:15,531 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:15,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:15,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2119199897, now seen corresponding path program 2 times [2021-11-25 19:12:15,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:15,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671077293] [2021-11-25 19:12:15,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:15,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:16,190 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:16,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671077293] [2021-11-25 19:12:16,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671077293] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:16,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:16,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 19:12:16,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447286576] [2021-11-25 19:12:16,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:16,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 19:12:16,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:16,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 19:12:16,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-25 19:12:16,192 INFO L87 Difference]: Start difference. First operand 6214 states and 19934 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:18,173 INFO L93 Difference]: Finished difference Result 9289 states and 29916 transitions. [2021-11-25 19:12:18,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:12:18,173 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:18,191 INFO L225 Difference]: With dead ends: 9289 [2021-11-25 19:12:18,192 INFO L226 Difference]: Without dead ends: 9289 [2021-11-25 19:12:18,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-25 19:12:18,193 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 317 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 2660 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:18,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 60 Invalid, 2692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2660 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:12:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9289 states. [2021-11-25 19:12:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9289 to 6345. [2021-11-25 19:12:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6345 states, 6341 states have (on average 3.207222835514903) internal successors, (20337), 6344 states have internal predecessors, (20337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 20337 transitions. [2021-11-25 19:12:18,324 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 20337 transitions. Word has length 27 [2021-11-25 19:12:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:18,324 INFO L470 AbstractCegarLoop]: Abstraction has 6345 states and 20337 transitions. [2021-11-25 19:12:18,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 20337 transitions. [2021-11-25 19:12:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:18,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:18,330 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:18,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-25 19:12:18,330 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:18,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:18,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2035547327, now seen corresponding path program 3 times [2021-11-25 19:12:18,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:18,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938744569] [2021-11-25 19:12:18,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:18,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:19,022 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:19,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938744569] [2021-11-25 19:12:19,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938744569] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:19,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:19,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:12:19,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341196495] [2021-11-25 19:12:19,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:19,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:12:19,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:19,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:12:19,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:12:19,024 INFO L87 Difference]: Start difference. First operand 6345 states and 20337 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:21,055 INFO L93 Difference]: Finished difference Result 9323 states and 30034 transitions. [2021-11-25 19:12:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:12:21,055 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:21,073 INFO L225 Difference]: With dead ends: 9323 [2021-11-25 19:12:21,073 INFO L226 Difference]: Without dead ends: 9323 [2021-11-25 19:12:21,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2021-11-25 19:12:21,074 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 337 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:21,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 69 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2732 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:12:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9323 states. [2021-11-25 19:12:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9323 to 6588. [2021-11-25 19:12:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6588 states, 6584 states have (on average 3.1995747266099634) internal successors, (21066), 6587 states have internal predecessors, (21066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 21066 transitions. [2021-11-25 19:12:21,208 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 21066 transitions. Word has length 27 [2021-11-25 19:12:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:21,208 INFO L470 AbstractCegarLoop]: Abstraction has 6588 states and 21066 transitions. [2021-11-25 19:12:21,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 21066 transitions. [2021-11-25 19:12:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:21,217 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:21,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:21,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-25 19:12:21,218 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1610363571, now seen corresponding path program 4 times [2021-11-25 19:12:21,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:21,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068650013] [2021-11-25 19:12:21,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:21,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:21,737 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:21,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068650013] [2021-11-25 19:12:21,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068650013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:21,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:21,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:12:21,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849758617] [2021-11-25 19:12:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:21,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:12:21,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:21,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:12:21,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:12:21,739 INFO L87 Difference]: Start difference. First operand 6588 states and 21066 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:24,348 INFO L93 Difference]: Finished difference Result 9713 states and 31743 transitions. [2021-11-25 19:12:24,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 19:12:24,348 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:24,367 INFO L225 Difference]: With dead ends: 9713 [2021-11-25 19:12:24,367 INFO L226 Difference]: Without dead ends: 9713 [2021-11-25 19:12:24,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:12:24,369 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 449 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 3594 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:24,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 96 Invalid, 3629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3594 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 19:12:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9713 states. [2021-11-25 19:12:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9713 to 6588. [2021-11-25 19:12:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6588 states, 6584 states have (on average 3.1995747266099634) internal successors, (21066), 6587 states have internal predecessors, (21066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 21066 transitions. [2021-11-25 19:12:24,585 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 21066 transitions. Word has length 27 [2021-11-25 19:12:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:24,585 INFO L470 AbstractCegarLoop]: Abstraction has 6588 states and 21066 transitions. [2021-11-25 19:12:24,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 21066 transitions. [2021-11-25 19:12:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:24,593 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:24,593 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:24,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-25 19:12:24,593 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:24,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:24,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1610363570, now seen corresponding path program 1 times [2021-11-25 19:12:24,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:24,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435576072] [2021-11-25 19:12:24,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:24,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:25,141 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:25,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435576072] [2021-11-25 19:12:25,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435576072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:25,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:25,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:12:25,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822576089] [2021-11-25 19:12:25,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:25,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:12:25,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:25,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:12:25,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:12:25,143 INFO L87 Difference]: Start difference. First operand 6588 states and 21066 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:27,776 INFO L93 Difference]: Finished difference Result 9713 states and 31555 transitions. [2021-11-25 19:12:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 19:12:27,777 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:27,797 INFO L225 Difference]: With dead ends: 9713 [2021-11-25 19:12:27,797 INFO L226 Difference]: Without dead ends: 9713 [2021-11-25 19:12:27,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:12:27,798 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 448 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 3558 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:27,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 100 Invalid, 3592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3558 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 19:12:27,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9713 states. [2021-11-25 19:12:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9713 to 6869. [2021-11-25 19:12:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6869 states, 6865 states have (on average 3.2085943190094683) internal successors, (22027), 6868 states have internal predecessors, (22027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6869 states to 6869 states and 22027 transitions. [2021-11-25 19:12:27,950 INFO L78 Accepts]: Start accepts. Automaton has 6869 states and 22027 transitions. Word has length 27 [2021-11-25 19:12:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:27,950 INFO L470 AbstractCegarLoop]: Abstraction has 6869 states and 22027 transitions. [2021-11-25 19:12:27,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 6869 states and 22027 transitions. [2021-11-25 19:12:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:27,957 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:27,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:27,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-25 19:12:27,958 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:27,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash -280358237, now seen corresponding path program 2 times [2021-11-25 19:12:27,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:27,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072221850] [2021-11-25 19:12:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:27,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:28,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:28,469 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:28,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072221850] [2021-11-25 19:12:28,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072221850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:28,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:28,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:12:28,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026872804] [2021-11-25 19:12:28,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:28,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:12:28,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:28,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:12:28,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:12:28,470 INFO L87 Difference]: Start difference. First operand 6869 states and 22027 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:30,279 INFO L93 Difference]: Finished difference Result 9899 states and 31965 transitions. [2021-11-25 19:12:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:12:30,279 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:30,300 INFO L225 Difference]: With dead ends: 9899 [2021-11-25 19:12:30,300 INFO L226 Difference]: Without dead ends: 9899 [2021-11-25 19:12:30,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:12:30,301 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 348 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:30,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 77 Invalid, 2369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:12:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9899 states. [2021-11-25 19:12:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9899 to 7723. [2021-11-25 19:12:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7723 states, 7719 states have (on average 3.186552662261951) internal successors, (24597), 7722 states have internal predecessors, (24597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7723 states to 7723 states and 24597 transitions. [2021-11-25 19:12:30,467 INFO L78 Accepts]: Start accepts. Automaton has 7723 states and 24597 transitions. Word has length 27 [2021-11-25 19:12:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:30,468 INFO L470 AbstractCegarLoop]: Abstraction has 7723 states and 24597 transitions. [2021-11-25 19:12:30,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 7723 states and 24597 transitions. [2021-11-25 19:12:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:30,477 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:30,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:30,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-25 19:12:30,477 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:30,478 INFO L85 PathProgramCache]: Analyzing trace with hash -280358236, now seen corresponding path program 2 times [2021-11-25 19:12:30,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:30,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628438931] [2021-11-25 19:12:30,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:30,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:30,961 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:30,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628438931] [2021-11-25 19:12:30,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628438931] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:30,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:30,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:12:30,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664596897] [2021-11-25 19:12:30,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:30,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:12:30,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:30,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:12:30,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:12:30,963 INFO L87 Difference]: Start difference. First operand 7723 states and 24597 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:32,647 INFO L93 Difference]: Finished difference Result 9809 states and 31627 transitions. [2021-11-25 19:12:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:12:32,647 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:32,667 INFO L225 Difference]: With dead ends: 9809 [2021-11-25 19:12:32,667 INFO L226 Difference]: Without dead ends: 9809 [2021-11-25 19:12:32,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:12:32,668 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 309 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 2682 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:32,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 87 Invalid, 2703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2682 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:12:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9809 states. [2021-11-25 19:12:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9809 to 7292. [2021-11-25 19:12:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7292 states, 7288 states have (on average 3.1903128430296377) internal successors, (23251), 7291 states have internal predecessors, (23251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 23251 transitions. [2021-11-25 19:12:32,835 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 23251 transitions. Word has length 27 [2021-11-25 19:12:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:32,835 INFO L470 AbstractCegarLoop]: Abstraction has 7292 states and 23251 transitions. [2021-11-25 19:12:32,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 23251 transitions. [2021-11-25 19:12:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:32,843 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:32,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:32,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-25 19:12:32,843 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:32,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:32,844 INFO L85 PathProgramCache]: Analyzing trace with hash -127293910, now seen corresponding path program 2 times [2021-11-25 19:12:32,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:32,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558494919] [2021-11-25 19:12:32,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:32,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:33,468 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:33,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558494919] [2021-11-25 19:12:33,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558494919] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:33,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:33,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 19:12:33,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116810954] [2021-11-25 19:12:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:33,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 19:12:33,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:33,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 19:12:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-11-25 19:12:33,470 INFO L87 Difference]: Start difference. First operand 7292 states and 23251 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:35,620 INFO L93 Difference]: Finished difference Result 9000 states and 28939 transitions. [2021-11-25 19:12:35,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:12:35,620 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:35,638 INFO L225 Difference]: With dead ends: 9000 [2021-11-25 19:12:35,639 INFO L226 Difference]: Without dead ends: 9000 [2021-11-25 19:12:35,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2021-11-25 19:12:35,640 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 284 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:35,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 75 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 19:12:35,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9000 states. [2021-11-25 19:12:35,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9000 to 7352. [2021-11-25 19:12:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7352 states, 7348 states have (on average 3.188758845944475) internal successors, (23431), 7351 states have internal predecessors, (23431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 23431 transitions. [2021-11-25 19:12:35,792 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 23431 transitions. Word has length 27 [2021-11-25 19:12:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:35,792 INFO L470 AbstractCegarLoop]: Abstraction has 7352 states and 23431 transitions. [2021-11-25 19:12:35,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 23431 transitions. [2021-11-25 19:12:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:35,804 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:35,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:35,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-25 19:12:35,804 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:35,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash 12926162, now seen corresponding path program 3 times [2021-11-25 19:12:35,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:35,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36792245] [2021-11-25 19:12:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:35,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:36,472 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:36,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36792245] [2021-11-25 19:12:36,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36792245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:36,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:36,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 19:12:36,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239763503] [2021-11-25 19:12:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:36,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 19:12:36,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:36,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 19:12:36,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-25 19:12:36,474 INFO L87 Difference]: Start difference. First operand 7352 states and 23431 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:38,528 INFO L93 Difference]: Finished difference Result 9694 states and 31196 transitions. [2021-11-25 19:12:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:12:38,529 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:38,548 INFO L225 Difference]: With dead ends: 9694 [2021-11-25 19:12:38,548 INFO L226 Difference]: Without dead ends: 9694 [2021-11-25 19:12:38,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-25 19:12:38,549 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 362 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 2816 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:38,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 80 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2816 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:12:38,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9694 states. [2021-11-25 19:12:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9694 to 7352. [2021-11-25 19:12:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7352 states, 7348 states have (on average 3.188758845944475) internal successors, (23431), 7351 states have internal predecessors, (23431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 23431 transitions. [2021-11-25 19:12:38,766 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 23431 transitions. Word has length 27 [2021-11-25 19:12:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:38,766 INFO L470 AbstractCegarLoop]: Abstraction has 7352 states and 23431 transitions. [2021-11-25 19:12:38,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 23431 transitions. [2021-11-25 19:12:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:38,773 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:38,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:38,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-25 19:12:38,774 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:38,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash 438109918, now seen corresponding path program 4 times [2021-11-25 19:12:38,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:38,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305600704] [2021-11-25 19:12:38,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:38,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:39,371 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:39,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305600704] [2021-11-25 19:12:39,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305600704] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:39,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:39,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:12:39,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420482059] [2021-11-25 19:12:39,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:39,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:12:39,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:39,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:12:39,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:12:39,373 INFO L87 Difference]: Start difference. First operand 7352 states and 23431 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:41,933 INFO L93 Difference]: Finished difference Result 9646 states and 31089 transitions. [2021-11-25 19:12:41,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 19:12:41,934 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:41,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:41,953 INFO L225 Difference]: With dead ends: 9646 [2021-11-25 19:12:41,953 INFO L226 Difference]: Without dead ends: 9646 [2021-11-25 19:12:41,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:12:41,954 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 421 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 3650 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:41,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 99 Invalid, 3679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3650 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 19:12:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9646 states. [2021-11-25 19:12:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9646 to 6024. [2021-11-25 19:12:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6024 states, 6020 states have (on average 3.1697674418604653) internal successors, (19082), 6023 states have internal predecessors, (19082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6024 states to 6024 states and 19082 transitions. [2021-11-25 19:12:42,084 INFO L78 Accepts]: Start accepts. Automaton has 6024 states and 19082 transitions. Word has length 27 [2021-11-25 19:12:42,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:42,084 INFO L470 AbstractCegarLoop]: Abstraction has 6024 states and 19082 transitions. [2021-11-25 19:12:42,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 6024 states and 19082 transitions. [2021-11-25 19:12:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:42,090 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:42,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:42,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-25 19:12:42,090 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash -813193971, now seen corresponding path program 5 times [2021-11-25 19:12:42,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:42,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668847257] [2021-11-25 19:12:42,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:42,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:42,556 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:42,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668847257] [2021-11-25 19:12:42,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668847257] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:42,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:42,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:12:42,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694355841] [2021-11-25 19:12:42,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:42,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 19:12:42,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:42,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 19:12:42,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-25 19:12:42,558 INFO L87 Difference]: Start difference. First operand 6024 states and 19082 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-25 19:12:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:44,244 INFO L93 Difference]: Finished difference Result 7646 states and 24580 transitions. [2021-11-25 19:12:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 19:12:44,244 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-25 19:12:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:44,259 INFO L225 Difference]: With dead ends: 7646 [2021-11-25 19:12:44,259 INFO L226 Difference]: Without dead ends: 7646 [2021-11-25 19:12:44,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:12:44,260 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 342 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:44,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 63 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:12:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7646 states. [2021-11-25 19:12:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7646 to 6420. [2021-11-25 19:12:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6420 states, 6416 states have (on average 3.196228179551122) internal successors, (20507), 6419 states have internal predecessors, (20507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6420 states to 6420 states and 20507 transitions. [2021-11-25 19:12:44,389 INFO L78 Accepts]: Start accepts. Automaton has 6420 states and 20507 transitions. Word has length 27 [2021-11-25 19:12:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:44,389 INFO L470 AbstractCegarLoop]: Abstraction has 6420 states and 20507 transitions. [2021-11-25 19:12:44,389 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-25 19:12:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6420 states and 20507 transitions. [2021-11-25 19:12:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:44,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:44,396 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:44,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-25 19:12:44,396 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash -813193970, now seen corresponding path program 5 times [2021-11-25 19:12:44,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:44,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112146565] [2021-11-25 19:12:44,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:44,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:45,032 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:45,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112146565] [2021-11-25 19:12:45,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112146565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:45,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:45,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 19:12:45,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857695522] [2021-11-25 19:12:45,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:45,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 19:12:45,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:45,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 19:12:45,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-11-25 19:12:45,034 INFO L87 Difference]: Start difference. First operand 6420 states and 20507 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:47,105 INFO L93 Difference]: Finished difference Result 7556 states and 24242 transitions. [2021-11-25 19:12:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:12:47,105 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:47,120 INFO L225 Difference]: With dead ends: 7556 [2021-11-25 19:12:47,120 INFO L226 Difference]: Without dead ends: 7556 [2021-11-25 19:12:47,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2021-11-25 19:12:47,121 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 275 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:47,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 80 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 19:12:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7556 states. [2021-11-25 19:12:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7556 to 5896. [2021-11-25 19:12:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5896 states, 5892 states have (on average 3.1734555329260012) internal successors, (18698), 5895 states have internal predecessors, (18698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5896 states to 5896 states and 18698 transitions. [2021-11-25 19:12:47,239 INFO L78 Accepts]: Start accepts. Automaton has 5896 states and 18698 transitions. Word has length 27 [2021-11-25 19:12:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:47,240 INFO L470 AbstractCegarLoop]: Abstraction has 5896 states and 18698 transitions. [2021-11-25 19:12:47,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5896 states and 18698 transitions. [2021-11-25 19:12:47,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:47,248 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:47,248 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:47,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-25 19:12:47,249 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:47,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:47,249 INFO L85 PathProgramCache]: Analyzing trace with hash -672973899, now seen corresponding path program 6 times [2021-11-25 19:12:47,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:47,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637264113] [2021-11-25 19:12:47,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:47,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:47,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-25 19:12:47,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:47,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637264113] [2021-11-25 19:12:47,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637264113] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:47,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:47,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 19:12:47,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800299371] [2021-11-25 19:12:47,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:47,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 19:12:47,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:47,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 19:12:47,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-25 19:12:47,860 INFO L87 Difference]: Start difference. First operand 5896 states and 18698 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:49,968 INFO L93 Difference]: Finished difference Result 8730 states and 28078 transitions. [2021-11-25 19:12:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:12:49,969 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:49,986 INFO L225 Difference]: With dead ends: 8730 [2021-11-25 19:12:49,986 INFO L226 Difference]: Without dead ends: 8730 [2021-11-25 19:12:49,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-25 19:12:49,987 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 339 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 2807 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:49,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 82 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2807 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 19:12:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8730 states. [2021-11-25 19:12:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8730 to 6720. [2021-11-25 19:12:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6720 states, 6716 states have (on average 3.1874627754615843) internal successors, (21407), 6719 states have internal predecessors, (21407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6720 states to 6720 states and 21407 transitions. [2021-11-25 19:12:50,127 INFO L78 Accepts]: Start accepts. Automaton has 6720 states and 21407 transitions. Word has length 27 [2021-11-25 19:12:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:50,128 INFO L470 AbstractCegarLoop]: Abstraction has 6720 states and 21407 transitions. [2021-11-25 19:12:50,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 6720 states and 21407 transitions. [2021-11-25 19:12:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:50,134 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:50,134 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:50,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-25 19:12:50,134 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:50,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash -672973898, now seen corresponding path program 6 times [2021-11-25 19:12:50,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:50,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668249142] [2021-11-25 19:12:50,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:50,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:50,808 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:50,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668249142] [2021-11-25 19:12:50,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668249142] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:50,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:50,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 19:12:50,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385179310] [2021-11-25 19:12:50,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:50,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 19:12:50,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:50,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 19:12:50,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-25 19:12:50,810 INFO L87 Difference]: Start difference. First operand 6720 states and 21407 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:52,840 INFO L93 Difference]: Finished difference Result 8730 states and 27939 transitions. [2021-11-25 19:12:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:12:52,841 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:52,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:52,858 INFO L225 Difference]: With dead ends: 8730 [2021-11-25 19:12:52,858 INFO L226 Difference]: Without dead ends: 8730 [2021-11-25 19:12:52,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2021-11-25 19:12:52,859 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 311 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:52,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 80 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:12:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8730 states. [2021-11-25 19:12:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8730 to 6220. [2021-11-25 19:12:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6220 states, 6216 states have (on average 3.1644144144144146) internal successors, (19670), 6219 states have internal predecessors, (19670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 19670 transitions. [2021-11-25 19:12:52,988 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 19670 transitions. Word has length 27 [2021-11-25 19:12:52,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:52,988 INFO L470 AbstractCegarLoop]: Abstraction has 6220 states and 19670 transitions. [2021-11-25 19:12:52,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 19670 transitions. [2021-11-25 19:12:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:52,994 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:52,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:52,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-25 19:12:52,994 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-25 19:12:52,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash -247790143, now seen corresponding path program 7 times [2021-11-25 19:12:52,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:52,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877847921] [2021-11-25 19:12:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:52,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:53,641 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:53,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877847921] [2021-11-25 19:12:53,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877847921] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:53,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:53,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:12:53,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844662844] [2021-11-25 19:12:53,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:53,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:12:53,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:53,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:12:53,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:12:53,642 INFO L87 Difference]: Start difference. First operand 6220 states and 19670 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:56,309 INFO L93 Difference]: Finished difference Result 9602 states and 30957 transitions. [2021-11-25 19:12:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 19:12:56,310 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:12:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:56,331 INFO L225 Difference]: With dead ends: 9602 [2021-11-25 19:12:56,332 INFO L226 Difference]: Without dead ends: 9602 [2021-11-25 19:12:56,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:12:56,333 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 396 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 3635 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:56,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 99 Invalid, 3667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3635 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 19:12:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9602 states. [2021-11-25 19:12:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9602 to 5788. [2021-11-25 19:12:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5788 states, 5784 states have (on average 3.1766943291839556) internal successors, (18374), 5787 states have internal predecessors, (18374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5788 states to 5788 states and 18374 transitions. [2021-11-25 19:12:56,457 INFO L78 Accepts]: Start accepts. Automaton has 5788 states and 18374 transitions. Word has length 27 [2021-11-25 19:12:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:56,458 INFO L470 AbstractCegarLoop]: Abstraction has 5788 states and 18374 transitions. [2021-11-25 19:12:56,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5788 states and 18374 transitions. [2021-11-25 19:12:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:56,463 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:56,463 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:56,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-25 19:12:56,463 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:56,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash -984585469, now seen corresponding path program 8 times [2021-11-25 19:12:56,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:56,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674073206] [2021-11-25 19:12:56,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:56,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:12:56,989 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:56,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674073206] [2021-11-25 19:12:56,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674073206] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:56,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:56,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:12:56,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794162850] [2021-11-25 19:12:56,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:56,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 19:12:56,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:56,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 19:12:56,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-25 19:12:56,990 INFO L87 Difference]: Start difference. First operand 5788 states and 18374 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-25 19:12:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:58,999 INFO L93 Difference]: Finished difference Result 8114 states and 26112 transitions. [2021-11-25 19:12:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 19:12:58,999 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-25 19:12:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:59,020 INFO L225 Difference]: With dead ends: 8114 [2021-11-25 19:12:59,021 INFO L226 Difference]: Without dead ends: 8114 [2021-11-25 19:12:59,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:12:59,022 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 342 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 2849 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:59,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 107 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2849 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:12:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8114 states. [2021-11-25 19:12:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8114 to 6816. [2021-11-25 19:12:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6816 states, 6812 states have (on average 3.203611274221961) internal successors, (21823), 6815 states have internal predecessors, (21823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6816 states to 6816 states and 21823 transitions. [2021-11-25 19:12:59,160 INFO L78 Accepts]: Start accepts. Automaton has 6816 states and 21823 transitions. Word has length 27 [2021-11-25 19:12:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:59,161 INFO L470 AbstractCegarLoop]: Abstraction has 6816 states and 21823 transitions. [2021-11-25 19:12:59,161 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-25 19:12:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6816 states and 21823 transitions. [2021-11-25 19:12:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:12:59,168 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:59,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:12:59,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-25 19:12:59,168 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:12:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:59,169 INFO L85 PathProgramCache]: Analyzing trace with hash -984585468, now seen corresponding path program 7 times [2021-11-25 19:12:59,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:59,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118294577] [2021-11-25 19:12:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:59,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:59,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-25 19:12:59,851 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:59,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118294577] [2021-11-25 19:12:59,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118294577] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:12:59,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:12:59,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 19:12:59,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165116667] [2021-11-25 19:12:59,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:59,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 19:12:59,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:59,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 19:12:59,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:12:59,854 INFO L87 Difference]: Start difference. First operand 6816 states and 21823 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:02,205 INFO L93 Difference]: Finished difference Result 8524 states and 27511 transitions. [2021-11-25 19:13:02,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 19:13:02,206 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:13:02,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:02,224 INFO L225 Difference]: With dead ends: 8524 [2021-11-25 19:13:02,224 INFO L226 Difference]: Without dead ends: 8524 [2021-11-25 19:13:02,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 19:13:02,226 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 343 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 3122 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:02,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 94 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3122 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 19:13:02,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8524 states. [2021-11-25 19:13:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8524 to 6780. [2021-11-25 19:13:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6780 states, 6776 states have (on average 3.2046930342384887) internal successors, (21715), 6779 states have internal predecessors, (21715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6780 states to 6780 states and 21715 transitions. [2021-11-25 19:13:02,375 INFO L78 Accepts]: Start accepts. Automaton has 6780 states and 21715 transitions. Word has length 27 [2021-11-25 19:13:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:02,375 INFO L470 AbstractCegarLoop]: Abstraction has 6780 states and 21715 transitions. [2021-11-25 19:13:02,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 6780 states and 21715 transitions. [2021-11-25 19:13:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:13:02,382 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:02,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, 1, 1] [2021-11-25 19:13:02,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-25 19:13:02,382 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:02,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2054080270, now seen corresponding path program 8 times [2021-11-25 19:13:02,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:02,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587931045] [2021-11-25 19:13:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:02,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:02,872 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:02,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587931045] [2021-11-25 19:13:02,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587931045] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:02,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:02,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 19:13:02,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976180449] [2021-11-25 19:13:02,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:02,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 19:13:02,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:02,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 19:13:02,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:13:02,873 INFO L87 Difference]: Start difference. First operand 6780 states and 21715 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:05,396 INFO L93 Difference]: Finished difference Result 9242 states and 29877 transitions. [2021-11-25 19:13:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 19:13:05,396 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:13:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:05,416 INFO L225 Difference]: With dead ends: 9242 [2021-11-25 19:13:05,416 INFO L226 Difference]: Without dead ends: 9242 [2021-11-25 19:13:05,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:13:05,417 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 403 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 3552 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:05,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 104 Invalid, 3579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3552 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 19:13:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9242 states. [2021-11-25 19:13:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9242 to 5428. [2021-11-25 19:13:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5428 states, 5424 states have (on average 3.1884218289085546) internal successors, (17294), 5427 states have internal predecessors, (17294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 17294 transitions. [2021-11-25 19:13:05,537 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 17294 transitions. Word has length 27 [2021-11-25 19:13:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:05,538 INFO L470 AbstractCegarLoop]: Abstraction has 5428 states and 17294 transitions. [2021-11-25 19:13:05,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 17294 transitions. [2021-11-25 19:13:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:13:05,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:05,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:05,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-25 19:13:05,543 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-25 19:13:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1805307027, now seen corresponding path program 9 times [2021-11-25 19:13:05,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:05,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764904334] [2021-11-25 19:13:05,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:05,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:06,059 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:06,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764904334] [2021-11-25 19:13:06,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764904334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:06,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:06,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:13:06,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280206702] [2021-11-25 19:13:06,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:06,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 19:13:06,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:06,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 19:13:06,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-25 19:13:06,060 INFO L87 Difference]: Start difference. First operand 5428 states and 17294 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-25 19:13:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:07,933 INFO L93 Difference]: Finished difference Result 7424 states and 23974 transitions. [2021-11-25 19:13:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 19:13:07,933 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-25 19:13:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:07,949 INFO L225 Difference]: With dead ends: 7424 [2021-11-25 19:13:07,949 INFO L226 Difference]: Without dead ends: 7424 [2021-11-25 19:13:07,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:13:07,950 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 382 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:07,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 97 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:13:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7424 states. [2021-11-25 19:13:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7424 to 5308. [2021-11-25 19:13:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5308 states, 5304 states have (on average 3.192684766214178) internal successors, (16934), 5307 states have internal predecessors, (16934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 16934 transitions. [2021-11-25 19:13:08,107 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 16934 transitions. Word has length 27 [2021-11-25 19:13:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:08,107 INFO L470 AbstractCegarLoop]: Abstraction has 5308 states and 16934 transitions. [2021-11-25 19:13:08,108 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-25 19:13:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 16934 transitions. [2021-11-25 19:13:08,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:13:08,112 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:08,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:08,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-25 19:13:08,113 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:08,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:08,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1545076689, now seen corresponding path program 10 times [2021-11-25 19:13:08,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:08,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789315610] [2021-11-25 19:13:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:08,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:08,537 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:08,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789315610] [2021-11-25 19:13:08,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789315610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:08,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:08,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:13:08,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834263029] [2021-11-25 19:13:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:08,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:13:08,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:13:08,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:13:08,539 INFO L87 Difference]: Start difference. First operand 5308 states and 16934 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:10,689 INFO L93 Difference]: Finished difference Result 7461 states and 24178 transitions. [2021-11-25 19:13:10,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 19:13:10,689 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:13:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:10,713 INFO L225 Difference]: With dead ends: 7461 [2021-11-25 19:13:10,714 INFO L226 Difference]: Without dead ends: 7461 [2021-11-25 19:13:10,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:13:10,715 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 327 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 2764 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:10,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 98 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2764 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 19:13:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2021-11-25 19:13:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 6097. [2021-11-25 19:13:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6097 states, 6093 states have (on average 3.2248481864434595) internal successors, (19649), 6096 states have internal predecessors, (19649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6097 states to 6097 states and 19649 transitions. [2021-11-25 19:13:10,878 INFO L78 Accepts]: Start accepts. Automaton has 6097 states and 19649 transitions. Word has length 27 [2021-11-25 19:13:10,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:10,879 INFO L470 AbstractCegarLoop]: Abstraction has 6097 states and 19649 transitions. [2021-11-25 19:13:10,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 6097 states and 19649 transitions. [2021-11-25 19:13:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:13:10,887 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:10,887 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:10,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-25 19:13:10,888 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1545076688, now seen corresponding path program 9 times [2021-11-25 19:13:10,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:10,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475511166] [2021-11-25 19:13:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:10,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:11,329 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:11,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475511166] [2021-11-25 19:13:11,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475511166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:11,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:11,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:13:11,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629895607] [2021-11-25 19:13:11,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:11,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 19:13:11,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:11,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 19:13:11,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-25 19:13:11,331 INFO L87 Difference]: Start difference. First operand 6097 states and 19649 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-25 19:13:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:13,338 INFO L93 Difference]: Finished difference Result 7371 states and 23840 transitions. [2021-11-25 19:13:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:13:13,339 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-25 19:13:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:13,354 INFO L225 Difference]: With dead ends: 7371 [2021-11-25 19:13:13,354 INFO L226 Difference]: Without dead ends: 7371 [2021-11-25 19:13:13,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2021-11-25 19:13:13,355 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 389 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 2974 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:13,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 110 Invalid, 3001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2974 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:13:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7371 states. [2021-11-25 19:13:13,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7371 to 5189. [2021-11-25 19:13:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5189 states, 5185 states have (on average 3.1938283510125363) internal successors, (16560), 5188 states have internal predecessors, (16560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 16560 transitions. [2021-11-25 19:13:13,507 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 16560 transitions. Word has length 27 [2021-11-25 19:13:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:13,507 INFO L470 AbstractCegarLoop]: Abstraction has 5189 states and 16560 transitions. [2021-11-25 19:13:13,508 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-25 19:13:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 16560 transitions. [2021-11-25 19:13:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:13:13,512 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:13,512 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:13,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-25 19:13:13,512 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:13,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash -7282017, now seen corresponding path program 3 times [2021-11-25 19:13:13,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:13,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247347152] [2021-11-25 19:13:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:13,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:13,917 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:13,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247347152] [2021-11-25 19:13:13,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247347152] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:13,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:13,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:13:13,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322137794] [2021-11-25 19:13:13,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:13,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:13:13,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:13,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:13:13,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:13:13,918 INFO L87 Difference]: Start difference. First operand 5189 states and 16560 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:15,525 INFO L93 Difference]: Finished difference Result 7359 states and 23762 transitions. [2021-11-25 19:13:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:13:15,525 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:13:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:15,540 INFO L225 Difference]: With dead ends: 7359 [2021-11-25 19:13:15,540 INFO L226 Difference]: Without dead ends: 7359 [2021-11-25 19:13:15,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:13:15,544 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 374 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:15,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 87 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:13:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7359 states. [2021-11-25 19:13:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7359 to 5063. [2021-11-25 19:13:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5063 states, 5059 states have (on average 3.1986558608420634) internal successors, (16182), 5062 states have internal predecessors, (16182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 16182 transitions. [2021-11-25 19:13:15,646 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 16182 transitions. Word has length 27 [2021-11-25 19:13:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:15,646 INFO L470 AbstractCegarLoop]: Abstraction has 5063 states and 16182 transitions. [2021-11-25 19:13:15,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 16182 transitions. [2021-11-25 19:13:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:13:15,651 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:15,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:15,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-25 19:13:15,652 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:15,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:15,652 INFO L85 PathProgramCache]: Analyzing trace with hash 203654105, now seen corresponding path program 4 times [2021-11-25 19:13:15,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:15,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27882392] [2021-11-25 19:13:15,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:15,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:16,136 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:16,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27882392] [2021-11-25 19:13:16,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27882392] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:16,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:16,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:13:16,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723889443] [2021-11-25 19:13:16,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:16,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:13:16,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:16,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:13:16,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:13:16,138 INFO L87 Difference]: Start difference. First operand 5063 states and 16182 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:17,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:17,751 INFO L93 Difference]: Finished difference Result 7239 states and 23402 transitions. [2021-11-25 19:13:17,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:13:17,752 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:13:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:17,766 INFO L225 Difference]: With dead ends: 7239 [2021-11-25 19:13:17,766 INFO L226 Difference]: Without dead ends: 7239 [2021-11-25 19:13:17,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:13:17,767 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 374 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:17,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 82 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:13:17,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7239 states. [2021-11-25 19:13:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7239 to 4883. [2021-11-25 19:13:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4883 states, 4879 states have (on average 3.205984832957573) internal successors, (15642), 4882 states have internal predecessors, (15642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4883 states to 4883 states and 15642 transitions. [2021-11-25 19:13:17,922 INFO L78 Accepts]: Start accepts. Automaton has 4883 states and 15642 transitions. Word has length 27 [2021-11-25 19:13:17,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:17,923 INFO L470 AbstractCegarLoop]: Abstraction has 4883 states and 15642 transitions. [2021-11-25 19:13:17,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4883 states and 15642 transitions. [2021-11-25 19:13:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:13:17,928 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:17,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:17,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-25 19:13:17,928 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:17,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1755634015, now seen corresponding path program 5 times [2021-11-25 19:13:17,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:17,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710024485] [2021-11-25 19:13:17,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:17,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:18,396 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:18,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710024485] [2021-11-25 19:13:18,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710024485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:18,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:18,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:13:18,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510660587] [2021-11-25 19:13:18,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:18,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:13:18,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:18,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:13:18,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:13:18,398 INFO L87 Difference]: Start difference. First operand 4883 states and 15642 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:20,293 INFO L93 Difference]: Finished difference Result 7470 states and 24313 transitions. [2021-11-25 19:13:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 19:13:20,294 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:13:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:20,308 INFO L225 Difference]: With dead ends: 7470 [2021-11-25 19:13:20,308 INFO L226 Difference]: Without dead ends: 7470 [2021-11-25 19:13:20,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:13:20,309 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 345 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 2690 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:20,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 96 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2690 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:13:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2021-11-25 19:13:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 5812. [2021-11-25 19:13:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5812 states, 5808 states have (on average 3.236398071625344) internal successors, (18797), 5811 states have internal predecessors, (18797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5812 states to 5812 states and 18797 transitions. [2021-11-25 19:13:20,426 INFO L78 Accepts]: Start accepts. Automaton has 5812 states and 18797 transitions. Word has length 27 [2021-11-25 19:13:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:20,426 INFO L470 AbstractCegarLoop]: Abstraction has 5812 states and 18797 transitions. [2021-11-25 19:13:20,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 5812 states and 18797 transitions. [2021-11-25 19:13:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:13:20,431 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:20,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:20,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-25 19:13:20,431 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:20,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1755634016, now seen corresponding path program 3 times [2021-11-25 19:13:20,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:20,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119597299] [2021-11-25 19:13:20,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:20,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:20,856 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:20,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119597299] [2021-11-25 19:13:20,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119597299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:20,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:20,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:13:20,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896713964] [2021-11-25 19:13:20,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:20,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 19:13:20,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:20,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 19:13:20,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-11-25 19:13:20,857 INFO L87 Difference]: Start difference. First operand 5812 states and 18797 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-25 19:13:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:22,666 INFO L93 Difference]: Finished difference Result 7738 states and 25257 transitions. [2021-11-25 19:13:22,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:13:22,668 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-25 19:13:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:22,683 INFO L225 Difference]: With dead ends: 7738 [2021-11-25 19:13:22,683 INFO L226 Difference]: Without dead ends: 7738 [2021-11-25 19:13:22,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2021-11-25 19:13:22,684 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 298 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 2752 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:22,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 103 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2752 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:13:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7738 states. [2021-11-25 19:13:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7738 to 5672. [2021-11-25 19:13:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5672 states, 5668 states have (on average 3.2387085391672548) internal successors, (18357), 5671 states have internal predecessors, (18357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5672 states to 5672 states and 18357 transitions. [2021-11-25 19:13:22,823 INFO L78 Accepts]: Start accepts. Automaton has 5672 states and 18357 transitions. Word has length 27 [2021-11-25 19:13:22,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:22,824 INFO L470 AbstractCegarLoop]: Abstraction has 5672 states and 18357 transitions. [2021-11-25 19:13:22,824 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-25 19:13:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5672 states and 18357 transitions. [2021-11-25 19:13:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:13:22,829 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:22,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:22,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-25 19:13:22,829 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:22,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash -256708586, now seen corresponding path program 4 times [2021-11-25 19:13:22,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:22,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890349637] [2021-11-25 19:13:22,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:22,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:23,234 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:23,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890349637] [2021-11-25 19:13:23,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890349637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:23,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:23,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:13:23,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63581679] [2021-11-25 19:13:23,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:23,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:13:23,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:23,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:13:23,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:13:23,236 INFO L87 Difference]: Start difference. First operand 5672 states and 18357 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:25,236 INFO L93 Difference]: Finished difference Result 9582 states and 31617 transitions. [2021-11-25 19:13:25,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:13:25,237 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:13:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:25,256 INFO L225 Difference]: With dead ends: 9582 [2021-11-25 19:13:25,256 INFO L226 Difference]: Without dead ends: 9582 [2021-11-25 19:13:25,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:13:25,257 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 348 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 2594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:25,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 93 Invalid, 2594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:13:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9582 states. [2021-11-25 19:13:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9582 to 5447. [2021-11-25 19:13:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5447 states, 5443 states have (on average 3.2404923755282016) internal successors, (17638), 5446 states have internal predecessors, (17638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5447 states to 5447 states and 17638 transitions. [2021-11-25 19:13:25,375 INFO L78 Accepts]: Start accepts. Automaton has 5447 states and 17638 transitions. Word has length 27 [2021-11-25 19:13:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:25,375 INFO L470 AbstractCegarLoop]: Abstraction has 5447 states and 17638 transitions. [2021-11-25 19:13:25,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5447 states and 17638 transitions. [2021-11-25 19:13:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:13:25,380 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:25,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:25,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-25 19:13:25,380 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1554442335, now seen corresponding path program 6 times [2021-11-25 19:13:25,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:25,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253225501] [2021-11-25 19:13:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:25,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:25,804 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:25,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253225501] [2021-11-25 19:13:25,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253225501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:25,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:25,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:13:25,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201716235] [2021-11-25 19:13:25,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:25,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:13:25,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:25,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:13:25,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:13:25,806 INFO L87 Difference]: Start difference. First operand 5447 states and 17638 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:27,597 INFO L93 Difference]: Finished difference Result 7303 states and 24017 transitions. [2021-11-25 19:13:27,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:13:27,597 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:13:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:27,612 INFO L225 Difference]: With dead ends: 7303 [2021-11-25 19:13:27,612 INFO L226 Difference]: Without dead ends: 7303 [2021-11-25 19:13:27,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:13:27,613 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 316 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:27,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 89 Invalid, 2430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:13:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2021-11-25 19:13:27,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 6215. [2021-11-25 19:13:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6215 states, 6211 states have (on average 3.26630172274996) internal successors, (20287), 6214 states have internal predecessors, (20287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 20287 transitions. [2021-11-25 19:13:27,728 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 20287 transitions. Word has length 27 [2021-11-25 19:13:27,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:27,728 INFO L470 AbstractCegarLoop]: Abstraction has 6215 states and 20287 transitions. [2021-11-25 19:13:27,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 20287 transitions. [2021-11-25 19:13:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:13:27,732 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:27,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:27,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-25 19:13:27,733 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:27,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1554442336, now seen corresponding path program 5 times [2021-11-25 19:13:27,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:27,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952195558] [2021-11-25 19:13:27,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:27,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:28,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-25 19:13:28,180 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:28,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952195558] [2021-11-25 19:13:28,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952195558] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:28,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:28,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 19:13:28,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667420471] [2021-11-25 19:13:28,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:28,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:13:28,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:28,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:13:28,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:13:28,182 INFO L87 Difference]: Start difference. First operand 6215 states and 20287 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:29,940 INFO L93 Difference]: Finished difference Result 7303 states and 23878 transitions. [2021-11-25 19:13:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:13:29,940 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 19:13:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:29,955 INFO L225 Difference]: With dead ends: 7303 [2021-11-25 19:13:29,955 INFO L226 Difference]: Without dead ends: 7303 [2021-11-25 19:13:29,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:13:29,956 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 341 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:29,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 89 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:13:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2021-11-25 19:13:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 5247. [2021-11-25 19:13:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5247 states, 5243 states have (on average 3.2458516116727063) internal successors, (17018), 5246 states have internal predecessors, (17018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5247 states to 5247 states and 17018 transitions. [2021-11-25 19:13:30,108 INFO L78 Accepts]: Start accepts. Automaton has 5247 states and 17018 transitions. Word has length 27 [2021-11-25 19:13:30,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:30,108 INFO L470 AbstractCegarLoop]: Abstraction has 5247 states and 17018 transitions. [2021-11-25 19:13:30,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5247 states and 17018 transitions. [2021-11-25 19:13:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-25 19:13:30,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:30,113 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:30,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-25 19:13:30,113 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:30,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:30,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1460019004, now seen corresponding path program 1 times [2021-11-25 19:13:30,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:30,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851295345] [2021-11-25 19:13:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:30,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:30,676 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851295345] [2021-11-25 19:13:30,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851295345] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:13:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941308847] [2021-11-25 19:13:30,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:30,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:13:30,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:13:30,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:13:30,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 19:13:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:30,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 94 conjunts are in the unsatisfiable core [2021-11-25 19:13:30,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:13:30,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:30,991 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2021-11-25 19:13:30,999 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 14 treesize of output 12 [2021-11-25 19:13:31,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-11-25 19:13:31,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-11-25 19:13:31,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:13:31,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:31,514 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-25 19:13:31,515 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 39 treesize of output 38 [2021-11-25 19:13:31,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:31,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:31,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:31,602 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:13:31,603 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 3 case distinctions, treesize of input 39 treesize of output 35 [2021-11-25 19:13:31,862 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-25 19:13:31,863 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-25 19:13:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:31,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:13:43,581 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 Int) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1577 Int)) (or (< 1 v_ArrVal_1574) (<= (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1573))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_1574)) .cse3 v_ArrVal_1577)))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4))) 8))) is different from false [2021-11-25 19:13:43,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 Int) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1577 Int)) (or (< 1 v_ArrVal_1574) (<= (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_1574)) .cse2 v_ArrVal_1577)))) (select .cse0 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))) 8))) is different from false [2021-11-25 19:13:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:43,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941308847] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:13:43,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1449405042] [2021-11-25 19:13:43,612 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-25 19:13:43,620 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:13:43,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 42 [2021-11-25 19:13:43,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091439485] [2021-11-25 19:13:43,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:13:43,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 19:13:43,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:43,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 19:13:43,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1578, Unknown=8, NotChecked=162, Total=1892 [2021-11-25 19:13:43,622 INFO L87 Difference]: Start difference. First operand 5247 states and 17018 transitions. Second operand has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:47,266 INFO L93 Difference]: Finished difference Result 8374 states and 27528 transitions. [2021-11-25 19:13:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 19:13:47,266 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 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 29 [2021-11-25 19:13:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:47,283 INFO L225 Difference]: With dead ends: 8374 [2021-11-25 19:13:47,283 INFO L226 Difference]: Without dead ends: 8374 [2021-11-25 19:13:47,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=426, Invalid=2766, Unknown=8, NotChecked=222, Total=3422 [2021-11-25 19:13:47,285 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 729 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 4041 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 5907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 4041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1808 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:47,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 190 Invalid, 5907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 4041 Invalid, 0 Unknown, 1808 Unchecked, 2.4s Time] [2021-11-25 19:13:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8374 states. [2021-11-25 19:13:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8374 to 5270. [2021-11-25 19:13:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5270 states, 5266 states have (on average 3.24743638435245) internal successors, (17101), 5269 states have internal predecessors, (17101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5270 states to 5270 states and 17101 transitions. [2021-11-25 19:13:47,403 INFO L78 Accepts]: Start accepts. Automaton has 5270 states and 17101 transitions. Word has length 29 [2021-11-25 19:13:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:47,403 INFO L470 AbstractCegarLoop]: Abstraction has 5270 states and 17101 transitions. [2021-11-25 19:13:47,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5270 states and 17101 transitions. [2021-11-25 19:13:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-25 19:13:47,407 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:47,407 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:47,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 19:13:47,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-11-25 19:13:47,608 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:47,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:47,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1353625980, now seen corresponding path program 1 times [2021-11-25 19:13:47,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:47,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505480732] [2021-11-25 19:13:47,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:47,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:48,181 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:48,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505480732] [2021-11-25 19:13:48,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505480732] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:13:48,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051492849] [2021-11-25 19:13:48,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:48,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:13:48,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:13:48,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:13:48,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 19:13:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:48,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-25 19:13:48,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:13:48,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:48,415 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2021-11-25 19:13:48,423 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 14 treesize of output 12 [2021-11-25 19:13:48,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-11-25 19:13:48,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-11-25 19:13:48,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:13:48,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:48,814 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-25 19:13:48,814 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 39 treesize of output 38 [2021-11-25 19:13:48,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:48,923 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-25 19:13:48,923 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 41 [2021-11-25 19:13:49,075 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-25 19:13:49,076 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-25 19:13:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:49,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:13:51,657 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1657 Int)) (<= (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1653))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse2 .cse3) 4)) 1)) .cse3 v_ArrVal_1657)))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4))) 8)) is different from false [2021-11-25 19:13:51,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1657 Int)) (<= (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse1 .cse2) 4)) 1)) .cse2 v_ArrVal_1657)))) (select .cse0 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))) 8)) is different from false [2021-11-25 19:13:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:51,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051492849] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:13:51,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [84178063] [2021-11-25 19:13:51,670 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-25 19:13:51,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:13:51,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2021-11-25 19:13:51,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907168968] [2021-11-25 19:13:51,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:13:51,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 19:13:51,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:51,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 19:13:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1211, Unknown=4, NotChecked=142, Total=1482 [2021-11-25 19:13:51,674 INFO L87 Difference]: Start difference. First operand 5270 states and 17101 transitions. Second operand has 39 states, 38 states have (on average 2.0) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:54,235 INFO L93 Difference]: Finished difference Result 7858 states and 25692 transitions. [2021-11-25 19:13:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 19:13:54,236 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.0) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 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 29 [2021-11-25 19:13:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:54,252 INFO L225 Difference]: With dead ends: 7858 [2021-11-25 19:13:54,252 INFO L226 Difference]: Without dead ends: 7858 [2021-11-25 19:13:54,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=337, Invalid=2217, Unknown=4, NotChecked=198, Total=2756 [2021-11-25 19:13:54,253 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 763 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 3534 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 4978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1398 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:54,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 160 Invalid, 4978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3534 Invalid, 0 Unknown, 1398 Unchecked, 1.8s Time] [2021-11-25 19:13:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7858 states. [2021-11-25 19:13:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7858 to 4724. [2021-11-25 19:13:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4724 states, 4720 states have (on average 3.2114406779661016) internal successors, (15158), 4723 states have internal predecessors, (15158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 15158 transitions. [2021-11-25 19:13:54,349 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 15158 transitions. Word has length 29 [2021-11-25 19:13:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:54,350 INFO L470 AbstractCegarLoop]: Abstraction has 4724 states and 15158 transitions. [2021-11-25 19:13:54,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.0) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 15158 transitions. [2021-11-25 19:13:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:13:54,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:54,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:54,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 19:13:54,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-11-25 19:13:54,555 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:54,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash -880818359, now seen corresponding path program 1 times [2021-11-25 19:13:54,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:54,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746096315] [2021-11-25 19:13:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:54,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:54,869 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:54,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746096315] [2021-11-25 19:13:54,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746096315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:54,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:54,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 19:13:54,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330057213] [2021-11-25 19:13:54,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:54,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:13:54,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:54,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:13:54,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:13:54,871 INFO L87 Difference]: Start difference. First operand 4724 states and 15158 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:56,084 INFO L93 Difference]: Finished difference Result 11091 states and 36280 transitions. [2021-11-25 19:13:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 19:13:56,090 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:13:56,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:56,112 INFO L225 Difference]: With dead ends: 11091 [2021-11-25 19:13:56,113 INFO L226 Difference]: Without dead ends: 11091 [2021-11-25 19:13:56,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2021-11-25 19:13:56,113 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 540 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:56,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 33 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 19:13:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11091 states. [2021-11-25 19:13:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11091 to 9287. [2021-11-25 19:13:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9287 states, 9283 states have (on average 3.310890875794463) internal successors, (30735), 9286 states have internal predecessors, (30735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9287 states to 9287 states and 30735 transitions. [2021-11-25 19:13:56,291 INFO L78 Accepts]: Start accepts. Automaton has 9287 states and 30735 transitions. Word has length 30 [2021-11-25 19:13:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:56,291 INFO L470 AbstractCegarLoop]: Abstraction has 9287 states and 30735 transitions. [2021-11-25 19:13:56,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 9287 states and 30735 transitions. [2021-11-25 19:13:56,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:13:56,298 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:56,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:56,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-25 19:13:56,298 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:56,299 INFO L85 PathProgramCache]: Analyzing trace with hash 923524347, now seen corresponding path program 1 times [2021-11-25 19:13:56,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:56,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388681865] [2021-11-25 19:13:56,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:56,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:56,580 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:56,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388681865] [2021-11-25 19:13:56,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388681865] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:56,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:56,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 19:13:56,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371548165] [2021-11-25 19:13:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:56,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:13:56,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:56,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:13:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:13:56,582 INFO L87 Difference]: Start difference. First operand 9287 states and 30735 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:57,768 INFO L93 Difference]: Finished difference Result 15518 states and 51160 transitions. [2021-11-25 19:13:57,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:13:57,768 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:13:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:57,802 INFO L225 Difference]: With dead ends: 15518 [2021-11-25 19:13:57,803 INFO L226 Difference]: Without dead ends: 15518 [2021-11-25 19:13:57,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2021-11-25 19:13:57,803 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 712 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:57,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 22 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 19:13:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15518 states. [2021-11-25 19:13:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15518 to 11849. [2021-11-25 19:13:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11849 states, 11845 states have (on average 3.334909244406923) internal successors, (39502), 11848 states have internal predecessors, (39502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39502 transitions. [2021-11-25 19:13:58,064 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39502 transitions. Word has length 30 [2021-11-25 19:13:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:58,064 INFO L470 AbstractCegarLoop]: Abstraction has 11849 states and 39502 transitions. [2021-11-25 19:13:58,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39502 transitions. [2021-11-25 19:13:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:13:58,075 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:58,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, 1, 1, 1] [2021-11-25 19:13:58,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-25 19:13:58,075 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:58,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash 243179205, now seen corresponding path program 2 times [2021-11-25 19:13:58,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:58,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970157797] [2021-11-25 19:13:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:58,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:58,279 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:58,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970157797] [2021-11-25 19:13:58,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970157797] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:13:58,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:13:58,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 19:13:58,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336556503] [2021-11-25 19:13:58,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:13:58,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:13:58,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:58,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:13:58,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:13:58,280 INFO L87 Difference]: Start difference. First operand 11849 states and 39502 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:59,558 INFO L93 Difference]: Finished difference Result 19696 states and 65479 transitions. [2021-11-25 19:13:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 19:13:59,558 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:13:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:59,606 INFO L225 Difference]: With dead ends: 19696 [2021-11-25 19:13:59,606 INFO L226 Difference]: Without dead ends: 19696 [2021-11-25 19:13:59,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2021-11-25 19:13:59,607 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 592 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:59,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 49 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 19:13:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19696 states. [2021-11-25 19:13:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19696 to 12649. [2021-11-25 19:13:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12649 states, 12645 states have (on average 3.330723606168446) internal successors, (42117), 12648 states have internal predecessors, (42117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12649 states to 12649 states and 42117 transitions. [2021-11-25 19:13:59,929 INFO L78 Accepts]: Start accepts. Automaton has 12649 states and 42117 transitions. Word has length 30 [2021-11-25 19:13:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:59,930 INFO L470 AbstractCegarLoop]: Abstraction has 12649 states and 42117 transitions. [2021-11-25 19:13:59,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 12649 states and 42117 transitions. [2021-11-25 19:13:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:13:59,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:59,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:13:59,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-25 19:13:59,942 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:13:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2048886113, now seen corresponding path program 3 times [2021-11-25 19:13:59,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:59,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509878622] [2021-11-25 19:13:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:59,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:00,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-25 19:14:00,182 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:00,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509878622] [2021-11-25 19:14:00,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509878622] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:00,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:00,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 19:14:00,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159516493] [2021-11-25 19:14:00,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:00,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:14:00,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:00,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:14:00,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:14:00,183 INFO L87 Difference]: Start difference. First operand 12649 states and 42117 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:01,869 INFO L93 Difference]: Finished difference Result 22066 states and 73708 transitions. [2021-11-25 19:14:01,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 19:14:01,869 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:14:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:01,919 INFO L225 Difference]: With dead ends: 22066 [2021-11-25 19:14:01,919 INFO L226 Difference]: Without dead ends: 22066 [2021-11-25 19:14:01,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=717, Unknown=0, NotChecked=0, Total=992 [2021-11-25 19:14:01,919 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 683 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:01,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [683 Valid, 77 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 19:14:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22066 states. [2021-11-25 19:14:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22066 to 13077. [2021-11-25 19:14:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13077 states, 13073 states have (on average 3.3517937734261456) internal successors, (43818), 13076 states have internal predecessors, (43818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13077 states to 13077 states and 43818 transitions. [2021-11-25 19:14:02,238 INFO L78 Accepts]: Start accepts. Automaton has 13077 states and 43818 transitions. Word has length 30 [2021-11-25 19:14:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:02,238 INFO L470 AbstractCegarLoop]: Abstraction has 13077 states and 43818 transitions. [2021-11-25 19:14:02,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 13077 states and 43818 transitions. [2021-11-25 19:14:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:14:02,250 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:02,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:14:02,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-25 19:14:02,250 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:02,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1454083157, now seen corresponding path program 4 times [2021-11-25 19:14:02,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:02,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261658142] [2021-11-25 19:14:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:02,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:02,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:02,480 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:02,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261658142] [2021-11-25 19:14:02,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261658142] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:02,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:02,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 19:14:02,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734189112] [2021-11-25 19:14:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:02,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:14:02,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:02,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:14:02,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:14:02,482 INFO L87 Difference]: Start difference. First operand 13077 states and 43818 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:04,412 INFO L93 Difference]: Finished difference Result 22141 states and 74355 transitions. [2021-11-25 19:14:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 19:14:04,413 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:14:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:04,467 INFO L225 Difference]: With dead ends: 22141 [2021-11-25 19:14:04,467 INFO L226 Difference]: Without dead ends: 22141 [2021-11-25 19:14:04,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=871, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 19:14:04,468 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 538 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:04,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [538 Valid, 117 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:14:04,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22141 states. [2021-11-25 19:14:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22141 to 11196. [2021-11-25 19:14:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11196 states, 11192 states have (on average 3.3481951393852754) internal successors, (37473), 11195 states have internal predecessors, (37473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11196 states to 11196 states and 37473 transitions. [2021-11-25 19:14:04,864 INFO L78 Accepts]: Start accepts. Automaton has 11196 states and 37473 transitions. Word has length 30 [2021-11-25 19:14:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:04,865 INFO L470 AbstractCegarLoop]: Abstraction has 11196 states and 37473 transitions. [2021-11-25 19:14:04,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 11196 states and 37473 transitions. [2021-11-25 19:14:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:14:04,875 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:04,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:14:04,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-25 19:14:04,876 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2104723087, now seen corresponding path program 2 times [2021-11-25 19:14:04,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:04,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660087211] [2021-11-25 19:14:04,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:04,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:05,087 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:05,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660087211] [2021-11-25 19:14:05,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660087211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:05,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:05,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 19:14:05,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669146624] [2021-11-25 19:14:05,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:05,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:14:05,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:05,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:14:05,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:14:05,089 INFO L87 Difference]: Start difference. First operand 11196 states and 37473 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:06,828 INFO L93 Difference]: Finished difference Result 19029 states and 63217 transitions. [2021-11-25 19:14:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 19:14:06,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:14:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:06,872 INFO L225 Difference]: With dead ends: 19029 [2021-11-25 19:14:06,872 INFO L226 Difference]: Without dead ends: 19029 [2021-11-25 19:14:06,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:14:06,872 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 566 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:06,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 55 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:14:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19029 states. [2021-11-25 19:14:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19029 to 11382. [2021-11-25 19:14:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11382 states, 11378 states have (on average 3.3527860783969063) internal successors, (38148), 11381 states have internal predecessors, (38148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11382 states to 11382 states and 38148 transitions. [2021-11-25 19:14:07,135 INFO L78 Accepts]: Start accepts. Automaton has 11382 states and 38148 transitions. Word has length 30 [2021-11-25 19:14:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:07,135 INFO L470 AbstractCegarLoop]: Abstraction has 11382 states and 38148 transitions. [2021-11-25 19:14:07,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:07,135 INFO L276 IsEmpty]: Start isEmpty. Operand 11382 states and 38148 transitions. [2021-11-25 19:14:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:14:07,145 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:07,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:14:07,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-25 19:14:07,145 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:07,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1729387755, now seen corresponding path program 3 times [2021-11-25 19:14:07,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:07,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875842061] [2021-11-25 19:14:07,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:07,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:07,357 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:07,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875842061] [2021-11-25 19:14:07,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875842061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:07,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:07,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 19:14:07,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490711783] [2021-11-25 19:14:07,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:07,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:14:07,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:07,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:14:07,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:14:07,359 INFO L87 Difference]: Start difference. First operand 11382 states and 38148 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:09,069 INFO L93 Difference]: Finished difference Result 19826 states and 66430 transitions. [2021-11-25 19:14:09,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 19:14:09,070 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 19:14:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:09,114 INFO L225 Difference]: With dead ends: 19826 [2021-11-25 19:14:09,114 INFO L226 Difference]: Without dead ends: 19826 [2021-11-25 19:14:09,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2021-11-25 19:14:09,115 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 577 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:09,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 78 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 19:14:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19826 states. [2021-11-25 19:14:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19826 to 10469. [2021-11-25 19:14:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10469 states, 10465 states have (on average 3.3663640707118967) internal successors, (35229), 10468 states have internal predecessors, (35229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10469 states to 10469 states and 35229 transitions. [2021-11-25 19:14:09,482 INFO L78 Accepts]: Start accepts. Automaton has 10469 states and 35229 transitions. Word has length 30 [2021-11-25 19:14:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:09,482 INFO L470 AbstractCegarLoop]: Abstraction has 10469 states and 35229 transitions. [2021-11-25 19:14:09,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 10469 states and 35229 transitions. [2021-11-25 19:14:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:14:09,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:09,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:14:09,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-25 19:14:09,499 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:09,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1119364937, now seen corresponding path program 1 times [2021-11-25 19:14:09,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:09,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837941694] [2021-11-25 19:14:09,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:09,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:09,531 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:09,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837941694] [2021-11-25 19:14:09,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837941694] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:09,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:09,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:14:09,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401955175] [2021-11-25 19:14:09,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:09,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:14:09,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:14:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:14:09,534 INFO L87 Difference]: Start difference. First operand 10469 states and 35229 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:09,612 INFO L93 Difference]: Finished difference Result 4810 states and 14346 transitions. [2021-11-25 19:14:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:14:09,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-25 19:14:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:09,621 INFO L225 Difference]: With dead ends: 4810 [2021-11-25 19:14:09,621 INFO L226 Difference]: Without dead ends: 4810 [2021-11-25 19:14:09,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:14:09,622 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:09,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 30 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:14:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-11-25 19:14:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4038. [2021-11-25 19:14:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4038 states, 4034 states have (on average 2.941497273177987) internal successors, (11866), 4037 states have internal predecessors, (11866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4038 states to 4038 states and 11866 transitions. [2021-11-25 19:14:09,701 INFO L78 Accepts]: Start accepts. Automaton has 4038 states and 11866 transitions. Word has length 31 [2021-11-25 19:14:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:09,702 INFO L470 AbstractCegarLoop]: Abstraction has 4038 states and 11866 transitions. [2021-11-25 19:14:09,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4038 states and 11866 transitions. [2021-11-25 19:14:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:14:09,705 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:09,705 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, 1] [2021-11-25 19:14:09,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-25 19:14:09,706 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:09,706 INFO L85 PathProgramCache]: Analyzing trace with hash -357961174, now seen corresponding path program 1 times [2021-11-25 19:14:09,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:09,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118503130] [2021-11-25 19:14:09,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:09,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:10,668 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:10,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118503130] [2021-11-25 19:14:10,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118503130] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:10,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:10,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-25 19:14:10,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163247414] [2021-11-25 19:14:10,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:10,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-25 19:14:10,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:10,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-25 19:14:10,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-11-25 19:14:10,669 INFO L87 Difference]: Start difference. First operand 4038 states and 11866 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:14,118 INFO L93 Difference]: Finished difference Result 4680 states and 13673 transitions. [2021-11-25 19:14:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 19:14:14,118 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:14:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:14,126 INFO L225 Difference]: With dead ends: 4680 [2021-11-25 19:14:14,126 INFO L226 Difference]: Without dead ends: 4680 [2021-11-25 19:14:14,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=198, Invalid=1362, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 19:14:14,126 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 371 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 4277 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 4319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:14,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 30 Invalid, 4319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4277 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 19:14:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2021-11-25 19:14:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4506. [2021-11-25 19:14:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 4502 states have (on average 2.9404709018214126) internal successors, (13238), 4505 states have internal predecessors, (13238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 13238 transitions. [2021-11-25 19:14:14,261 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 13238 transitions. Word has length 32 [2021-11-25 19:14:14,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:14,262 INFO L470 AbstractCegarLoop]: Abstraction has 4506 states and 13238 transitions. [2021-11-25 19:14:14,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:14,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 13238 transitions. [2021-11-25 19:14:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:14:14,266 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:14,267 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, 1] [2021-11-25 19:14:14,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-25 19:14:14,267 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1551408292, now seen corresponding path program 1 times [2021-11-25 19:14:14,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:14,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101288758] [2021-11-25 19:14:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:14,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:15,059 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:15,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101288758] [2021-11-25 19:14:15,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101288758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:15,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:15,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-25 19:14:15,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126082511] [2021-11-25 19:14:15,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:15,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 19:14:15,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:15,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 19:14:15,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2021-11-25 19:14:15,060 INFO L87 Difference]: Start difference. First operand 4506 states and 13238 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:18,228 INFO L93 Difference]: Finished difference Result 5179 states and 15101 transitions. [2021-11-25 19:14:18,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 19:14:18,228 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:14:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:18,236 INFO L225 Difference]: With dead ends: 5179 [2021-11-25 19:14:18,236 INFO L226 Difference]: Without dead ends: 5179 [2021-11-25 19:14:18,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=176, Invalid=1230, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:14:18,237 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 317 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 4536 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 4569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:18,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 33 Invalid, 4569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4536 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 19:14:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2021-11-25 19:14:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 4851. [2021-11-25 19:14:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4851 states, 4847 states have (on average 2.9418196822776976) internal successors, (14259), 4850 states have internal predecessors, (14259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 14259 transitions. [2021-11-25 19:14:18,315 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 14259 transitions. Word has length 32 [2021-11-25 19:14:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:18,315 INFO L470 AbstractCegarLoop]: Abstraction has 4851 states and 14259 transitions. [2021-11-25 19:14:18,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 14259 transitions. [2021-11-25 19:14:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:14:18,319 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:18,319 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, 1] [2021-11-25 19:14:18,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-25 19:14:18,319 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1104452150, now seen corresponding path program 2 times [2021-11-25 19:14:18,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:18,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030005991] [2021-11-25 19:14:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:18,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:19,206 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:19,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030005991] [2021-11-25 19:14:19,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030005991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:19,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:19,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-25 19:14:19,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680845530] [2021-11-25 19:14:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:19,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 19:14:19,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:19,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 19:14:19,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2021-11-25 19:14:19,207 INFO L87 Difference]: Start difference. First operand 4851 states and 14259 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:23,025 INFO L93 Difference]: Finished difference Result 6233 states and 18135 transitions. [2021-11-25 19:14:23,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 19:14:23,025 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:14:23,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:23,035 INFO L225 Difference]: With dead ends: 6233 [2021-11-25 19:14:23,035 INFO L226 Difference]: Without dead ends: 6233 [2021-11-25 19:14:23,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:14:23,035 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 350 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 4944 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 4974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:23,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 61 Invalid, 4974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4944 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-25 19:14:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2021-11-25 19:14:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 4901. [2021-11-25 19:14:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4901 states, 4897 states have (on average 2.9424137226873595) internal successors, (14409), 4900 states have internal predecessors, (14409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4901 states to 4901 states and 14409 transitions. [2021-11-25 19:14:23,111 INFO L78 Accepts]: Start accepts. Automaton has 4901 states and 14409 transitions. Word has length 32 [2021-11-25 19:14:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:23,111 INFO L470 AbstractCegarLoop]: Abstraction has 4901 states and 14409 transitions. [2021-11-25 19:14:23,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4901 states and 14409 transitions. [2021-11-25 19:14:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:14:23,115 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:23,115 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, 1] [2021-11-25 19:14:23,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-25 19:14:23,115 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:23,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1341451406, now seen corresponding path program 3 times [2021-11-25 19:14:23,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:23,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527130573] [2021-11-25 19:14:23,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:23,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:23,954 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:23,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527130573] [2021-11-25 19:14:23,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527130573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:23,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:23,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-25 19:14:23,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233415430] [2021-11-25 19:14:23,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:23,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-25 19:14:23,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:23,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-25 19:14:23,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2021-11-25 19:14:23,955 INFO L87 Difference]: Start difference. First operand 4901 states and 14409 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:27,471 INFO L93 Difference]: Finished difference Result 6159 states and 17961 transitions. [2021-11-25 19:14:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 19:14:27,472 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:14:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:27,481 INFO L225 Difference]: With dead ends: 6159 [2021-11-25 19:14:27,481 INFO L226 Difference]: Without dead ends: 6159 [2021-11-25 19:14:27,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 19:14:27,482 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 378 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 4762 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 4795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:27,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 72 Invalid, 4795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4762 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 19:14:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6159 states. [2021-11-25 19:14:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6159 to 4961. [2021-11-25 19:14:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4961 states, 4957 states have (on average 2.9370587048618115) internal successors, (14559), 4960 states have internal predecessors, (14559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4961 states to 4961 states and 14559 transitions. [2021-11-25 19:14:27,602 INFO L78 Accepts]: Start accepts. Automaton has 4961 states and 14559 transitions. Word has length 32 [2021-11-25 19:14:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:27,603 INFO L470 AbstractCegarLoop]: Abstraction has 4961 states and 14559 transitions. [2021-11-25 19:14:27,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4961 states and 14559 transitions. [2021-11-25 19:14:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:14:27,606 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:27,606 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, 1] [2021-11-25 19:14:27,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-25 19:14:27,607 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1013287426, now seen corresponding path program 4 times [2021-11-25 19:14:27,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:27,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801843177] [2021-11-25 19:14:27,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:27,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:28,449 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:28,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801843177] [2021-11-25 19:14:28,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801843177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:28,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:28,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-25 19:14:28,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360998541] [2021-11-25 19:14:28,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:28,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 19:14:28,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:28,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 19:14:28,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:14:28,450 INFO L87 Difference]: Start difference. First operand 4961 states and 14559 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:32,820 INFO L93 Difference]: Finished difference Result 6488 states and 18920 transitions. [2021-11-25 19:14:32,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 19:14:32,821 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:14:32,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:32,831 INFO L225 Difference]: With dead ends: 6488 [2021-11-25 19:14:32,831 INFO L226 Difference]: Without dead ends: 6488 [2021-11-25 19:14:32,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=257, Invalid=1905, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 19:14:32,832 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 452 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 6310 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 6310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:32,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 115 Invalid, 6345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 6310 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-11-25 19:14:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6488 states. [2021-11-25 19:14:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6488 to 5223. [2021-11-25 19:14:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5223 states, 5219 states have (on average 2.930638053266909) internal successors, (15295), 5222 states have internal predecessors, (15295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5223 states to 5223 states and 15295 transitions. [2021-11-25 19:14:32,934 INFO L78 Accepts]: Start accepts. Automaton has 5223 states and 15295 transitions. Word has length 32 [2021-11-25 19:14:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:32,934 INFO L470 AbstractCegarLoop]: Abstraction has 5223 states and 15295 transitions. [2021-11-25 19:14:32,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5223 states and 15295 transitions. [2021-11-25 19:14:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:14:32,938 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:32,938 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, 1] [2021-11-25 19:14:32,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-25 19:14:32,939 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash -637326740, now seen corresponding path program 2 times [2021-11-25 19:14:32,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:32,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451444120] [2021-11-25 19:14:32,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:32,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:33,723 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:33,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451444120] [2021-11-25 19:14:33,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451444120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:33,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:33,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:14:33,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89943989] [2021-11-25 19:14:33,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:33,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:14:33,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:33,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:14:33,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:14:33,724 INFO L87 Difference]: Start difference. First operand 5223 states and 15295 transitions. Second operand has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:36,819 INFO L93 Difference]: Finished difference Result 6402 states and 18588 transitions. [2021-11-25 19:14:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 19:14:36,819 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:14:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:36,829 INFO L225 Difference]: With dead ends: 6402 [2021-11-25 19:14:36,830 INFO L226 Difference]: Without dead ends: 6402 [2021-11-25 19:14:36,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2021-11-25 19:14:36,830 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 376 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 4534 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:36,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 99 Invalid, 4562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4534 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 19:14:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states. [2021-11-25 19:14:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 5516. [2021-11-25 19:14:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5516 states, 5512 states have (on average 2.925435413642961) internal successors, (16125), 5515 states have internal predecessors, (16125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5516 states to 5516 states and 16125 transitions. [2021-11-25 19:14:36,915 INFO L78 Accepts]: Start accepts. Automaton has 5516 states and 16125 transitions. Word has length 32 [2021-11-25 19:14:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:36,915 INFO L470 AbstractCegarLoop]: Abstraction has 5516 states and 16125 transitions. [2021-11-25 19:14:36,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5516 states and 16125 transitions. [2021-11-25 19:14:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:14:36,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:36,919 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, 1] [2021-11-25 19:14:36,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-25 19:14:36,920 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1766906534, now seen corresponding path program 5 times [2021-11-25 19:14:36,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:36,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327167875] [2021-11-25 19:14:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:36,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:37,766 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:37,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327167875] [2021-11-25 19:14:37,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327167875] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:37,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:37,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-25 19:14:37,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912774344] [2021-11-25 19:14:37,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:37,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-25 19:14:37,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:37,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-25 19:14:37,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-11-25 19:14:37,767 INFO L87 Difference]: Start difference. First operand 5516 states and 16125 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:41,323 INFO L93 Difference]: Finished difference Result 6373 states and 18428 transitions. [2021-11-25 19:14:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 19:14:41,323 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:14:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:41,332 INFO L225 Difference]: With dead ends: 6373 [2021-11-25 19:14:41,332 INFO L226 Difference]: Without dead ends: 6373 [2021-11-25 19:14:41,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=198, Invalid=1362, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 19:14:41,333 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 325 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 5060 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 5090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:41,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 77 Invalid, 5090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5060 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-11-25 19:14:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2021-11-25 19:14:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 5548. [2021-11-25 19:14:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5548 states, 5544 states have (on average 2.9258658008658007) internal successors, (16221), 5547 states have internal predecessors, (16221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5548 states to 5548 states and 16221 transitions. [2021-11-25 19:14:41,413 INFO L78 Accepts]: Start accepts. Automaton has 5548 states and 16221 transitions. Word has length 32 [2021-11-25 19:14:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:41,414 INFO L470 AbstractCegarLoop]: Abstraction has 5548 states and 16221 transitions. [2021-11-25 19:14:41,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5548 states and 16221 transitions. [2021-11-25 19:14:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:14:41,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:41,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:14:41,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-11-25 19:14:41,418 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2003905790, now seen corresponding path program 6 times [2021-11-25 19:14:41,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:41,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893311714] [2021-11-25 19:14:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:41,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:42,416 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:42,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893311714] [2021-11-25 19:14:42,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893311714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:42,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:42,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-25 19:14:42,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941456532] [2021-11-25 19:14:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:42,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-25 19:14:42,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:42,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-25 19:14:42,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2021-11-25 19:14:42,418 INFO L87 Difference]: Start difference. First operand 5548 states and 16221 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:45,805 INFO L93 Difference]: Finished difference Result 6890 states and 19945 transitions. [2021-11-25 19:14:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 19:14:45,805 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:14:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:45,816 INFO L225 Difference]: With dead ends: 6890 [2021-11-25 19:14:45,816 INFO L226 Difference]: Without dead ends: 6890 [2021-11-25 19:14:45,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 19:14:45,817 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 350 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 4829 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:45,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 88 Invalid, 4859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4829 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 19:14:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6890 states. [2021-11-25 19:14:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6890 to 5608. [2021-11-25 19:14:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5608 states, 5604 states have (on average 2.921306209850107) internal successors, (16371), 5607 states have internal predecessors, (16371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5608 states to 5608 states and 16371 transitions. [2021-11-25 19:14:45,909 INFO L78 Accepts]: Start accepts. Automaton has 5608 states and 16371 transitions. Word has length 32 [2021-11-25 19:14:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:45,909 INFO L470 AbstractCegarLoop]: Abstraction has 5608 states and 16371 transitions. [2021-11-25 19:14:45,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 5608 states and 16371 transitions. [2021-11-25 19:14:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:14:45,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:45,914 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, 1] [2021-11-25 19:14:45,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-11-25 19:14:45,914 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1675741810, now seen corresponding path program 7 times [2021-11-25 19:14:45,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:45,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951516593] [2021-11-25 19:14:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:45,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:46,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:46,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951516593] [2021-11-25 19:14:46,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951516593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:46,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:46,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-25 19:14:46,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782024522] [2021-11-25 19:14:46,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:46,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 19:14:46,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:46,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 19:14:46,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:14:46,933 INFO L87 Difference]: Start difference. First operand 5608 states and 16371 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:52,430 INFO L93 Difference]: Finished difference Result 8724 states and 25215 transitions. [2021-11-25 19:14:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 19:14:52,431 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:14:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:52,444 INFO L225 Difference]: With dead ends: 8724 [2021-11-25 19:14:52,444 INFO L226 Difference]: Without dead ends: 8724 [2021-11-25 19:14:52,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=368, Invalid=2388, Unknown=0, NotChecked=0, Total=2756 [2021-11-25 19:14:52,445 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 447 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 6983 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 7020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 6983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:52,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 153 Invalid, 7020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 6983 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-11-25 19:14:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8724 states. [2021-11-25 19:14:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8724 to 5506. [2021-11-25 19:14:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5506 states, 5502 states have (on average 2.9252998909487458) internal successors, (16095), 5505 states have internal predecessors, (16095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5506 states to 5506 states and 16095 transitions. [2021-11-25 19:14:52,541 INFO L78 Accepts]: Start accepts. Automaton has 5506 states and 16095 transitions. Word has length 32 [2021-11-25 19:14:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:52,541 INFO L470 AbstractCegarLoop]: Abstraction has 5506 states and 16095 transitions. [2021-11-25 19:14:52,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5506 states and 16095 transitions. [2021-11-25 19:14:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:14:52,546 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:52,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, 1] [2021-11-25 19:14:52,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-11-25 19:14:52,546 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:52,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:52,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1884457538, now seen corresponding path program 8 times [2021-11-25 19:14:52,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:52,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626814156] [2021-11-25 19:14:52,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:52,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:53,545 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:53,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626814156] [2021-11-25 19:14:53,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626814156] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:53,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:53,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-25 19:14:53,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406593997] [2021-11-25 19:14:53,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:53,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-25 19:14:53,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:53,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-25 19:14:53,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-11-25 19:14:53,546 INFO L87 Difference]: Start difference. First operand 5506 states and 16095 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:56,921 INFO L93 Difference]: Finished difference Result 6154 states and 17863 transitions. [2021-11-25 19:14:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 19:14:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:14:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:56,931 INFO L225 Difference]: With dead ends: 6154 [2021-11-25 19:14:56,931 INFO L226 Difference]: Without dead ends: 6154 [2021-11-25 19:14:56,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=198, Invalid=1362, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 19:14:56,934 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 342 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 4822 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 4855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:56,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 76 Invalid, 4855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4822 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 19:14:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2021-11-25 19:14:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 5503. [2021-11-25 19:14:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5503 states, 5499 states have (on average 2.9252591380250954) internal successors, (16086), 5502 states have internal predecessors, (16086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5503 states to 5503 states and 16086 transitions. [2021-11-25 19:14:57,017 INFO L78 Accepts]: Start accepts. Automaton has 5503 states and 16086 transitions. Word has length 32 [2021-11-25 19:14:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:57,017 INFO L470 AbstractCegarLoop]: Abstraction has 5503 states and 16086 transitions. [2021-11-25 19:14:57,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 5503 states and 16086 transitions. [2021-11-25 19:14:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:14:57,021 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:57,022 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, 1] [2021-11-25 19:14:57,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-11-25 19:14:57,022 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:14:57,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:57,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2121456794, now seen corresponding path program 9 times [2021-11-25 19:14:57,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:57,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81809829] [2021-11-25 19:14:57,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:57,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:58,184 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:58,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81809829] [2021-11-25 19:14:58,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81809829] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:14:58,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:14:58,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-25 19:14:58,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005535523] [2021-11-25 19:14:58,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:58,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 19:14:58,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 19:14:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:14:58,186 INFO L87 Difference]: Start difference. First operand 5503 states and 16086 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:15:01,729 INFO L93 Difference]: Finished difference Result 6759 states and 19596 transitions. [2021-11-25 19:15:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 19:15:01,729 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:15:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:15:01,739 INFO L225 Difference]: With dead ends: 6759 [2021-11-25 19:15:01,739 INFO L226 Difference]: Without dead ends: 6759 [2021-11-25 19:15:01,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=210, Invalid=1430, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 19:15:01,742 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 411 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 4862 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 4906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:15:01,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 87 Invalid, 4906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 4862 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-25 19:15:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6759 states. [2021-11-25 19:15:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6759 to 5557. [2021-11-25 19:15:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5557 states, 5553 states have (on average 2.9211237169097783) internal successors, (16221), 5556 states have internal predecessors, (16221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5557 states to 5557 states and 16221 transitions. [2021-11-25 19:15:01,828 INFO L78 Accepts]: Start accepts. Automaton has 5557 states and 16221 transitions. Word has length 32 [2021-11-25 19:15:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:15:01,828 INFO L470 AbstractCegarLoop]: Abstraction has 5557 states and 16221 transitions. [2021-11-25 19:15:01,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5557 states and 16221 transitions. [2021-11-25 19:15:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:15:01,832 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:15:01,832 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, 1] [2021-11-25 19:15:01,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-11-25 19:15:01,833 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:15:01,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:15:01,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1793292814, now seen corresponding path program 10 times [2021-11-25 19:15:01,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:15:01,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639663922] [2021-11-25 19:15:01,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:15:01,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:15:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:15:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:15:02,715 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:15:02,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639663922] [2021-11-25 19:15:02,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639663922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:15:02,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:15:02,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-25 19:15:02,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076756752] [2021-11-25 19:15:02,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:15:02,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 19:15:02,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:15:02,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 19:15:02,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:15:02,716 INFO L87 Difference]: Start difference. First operand 5557 states and 16221 transitions. Second operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:15:07,192 INFO L93 Difference]: Finished difference Result 7365 states and 21391 transitions. [2021-11-25 19:15:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 19:15:07,193 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:15:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:15:07,204 INFO L225 Difference]: With dead ends: 7365 [2021-11-25 19:15:07,204 INFO L226 Difference]: Without dead ends: 7365 [2021-11-25 19:15:07,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=257, Invalid=1905, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 19:15:07,205 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 469 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 6695 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 6695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:15:07,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 136 Invalid, 6733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 6695 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-11-25 19:15:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7365 states. [2021-11-25 19:15:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7365 to 5476. [2021-11-25 19:15:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5476 states, 5472 states have (on average 2.924890350877193) internal successors, (16005), 5475 states have internal predecessors, (16005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 16005 transitions. [2021-11-25 19:15:07,293 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 16005 transitions. Word has length 32 [2021-11-25 19:15:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:15:07,293 INFO L470 AbstractCegarLoop]: Abstraction has 5476 states and 16005 transitions. [2021-11-25 19:15:07,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 16005 transitions. [2021-11-25 19:15:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:15:07,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:15:07,297 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, 1] [2021-11-25 19:15:07,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-11-25 19:15:07,298 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:15:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:15:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1509618164, now seen corresponding path program 11 times [2021-11-25 19:15:07,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:15:07,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031947717] [2021-11-25 19:15:07,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:15:07,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:15:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:15:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:15:08,099 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:15:08,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031947717] [2021-11-25 19:15:08,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031947717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:15:08,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:15:08,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-25 19:15:08,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729446899] [2021-11-25 19:15:08,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:15:08,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 19:15:08,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:15:08,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 19:15:08,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2021-11-25 19:15:08,100 INFO L87 Difference]: Start difference. First operand 5476 states and 16005 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:15:11,427 INFO L93 Difference]: Finished difference Result 6329 states and 18420 transitions. [2021-11-25 19:15:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 19:15:11,427 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:15:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:15:11,437 INFO L225 Difference]: With dead ends: 6329 [2021-11-25 19:15:11,437 INFO L226 Difference]: Without dead ends: 6329 [2021-11-25 19:15:11,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:15:11,438 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 386 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 4949 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 4975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:15:11,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 125 Invalid, 4975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4949 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 19:15:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6329 states. [2021-11-25 19:15:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6329 to 5416. [2021-11-25 19:15:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5416 states, 5412 states have (on average 2.92960088691796) internal successors, (15855), 5415 states have internal predecessors, (15855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5416 states to 5416 states and 15855 transitions. [2021-11-25 19:15:11,520 INFO L78 Accepts]: Start accepts. Automaton has 5416 states and 15855 transitions. Word has length 32 [2021-11-25 19:15:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:15:11,521 INFO L470 AbstractCegarLoop]: Abstraction has 5416 states and 15855 transitions. [2021-11-25 19:15:11,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5416 states and 15855 transitions. [2021-11-25 19:15:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:15:11,525 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:15:11,525 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, 1] [2021-11-25 19:15:11,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-11-25 19:15:11,525 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:15:11,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:15:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash -641128836, now seen corresponding path program 12 times [2021-11-25 19:15:11,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:15:11,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2415914] [2021-11-25 19:15:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:15:11,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:15:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:15:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:15:12,217 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:15:12,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2415914] [2021-11-25 19:15:12,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2415914] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:15:12,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:15:12,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-25 19:15:12,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999948414] [2021-11-25 19:15:12,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:15:12,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 19:15:12,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:15:12,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 19:15:12,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2021-11-25 19:15:12,218 INFO L87 Difference]: Start difference. First operand 5416 states and 15855 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:15:15,414 INFO L93 Difference]: Finished difference Result 6229 states and 18170 transitions. [2021-11-25 19:15:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 19:15:15,415 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:15:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:15:15,424 INFO L225 Difference]: With dead ends: 6229 [2021-11-25 19:15:15,424 INFO L226 Difference]: Without dead ends: 6229 [2021-11-25 19:15:15,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=1235, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 19:15:15,425 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 408 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 4725 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 4762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 4725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:15:15,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 122 Invalid, 4762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 4725 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 19:15:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6229 states. [2021-11-25 19:15:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6229 to 5396. [2021-11-25 19:15:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5396 states, 5392 states have (on average 2.9311943620178043) internal successors, (15805), 5395 states have internal predecessors, (15805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5396 states to 5396 states and 15805 transitions. [2021-11-25 19:15:15,507 INFO L78 Accepts]: Start accepts. Automaton has 5396 states and 15805 transitions. Word has length 32 [2021-11-25 19:15:15,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:15:15,507 INFO L470 AbstractCegarLoop]: Abstraction has 5396 states and 15805 transitions. [2021-11-25 19:15:15,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5396 states and 15805 transitions. [2021-11-25 19:15:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:15:15,512 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:15:15,512 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, 1] [2021-11-25 19:15:15,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-11-25 19:15:15,512 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:15:15,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:15:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash -621292448, now seen corresponding path program 13 times [2021-11-25 19:15:15,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:15:15,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592005610] [2021-11-25 19:15:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:15:15,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:15:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:15:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:15:16,245 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:15:16,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592005610] [2021-11-25 19:15:16,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592005610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:15:16,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:15:16,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-25 19:15:16,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154124614] [2021-11-25 19:15:16,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:15:16,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 19:15:16,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:15:16,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 19:15:16,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2021-11-25 19:15:16,247 INFO L87 Difference]: Start difference. First operand 5396 states and 15805 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:15:19,644 INFO L93 Difference]: Finished difference Result 6194 states and 18065 transitions. [2021-11-25 19:15:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 19:15:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:15:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:15:19,654 INFO L225 Difference]: With dead ends: 6194 [2021-11-25 19:15:19,654 INFO L226 Difference]: Without dead ends: 6194 [2021-11-25 19:15:19,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=183, Invalid=1299, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 19:15:19,654 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 418 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 5148 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 5188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 5148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:15:19,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 132 Invalid, 5188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 5148 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-25 19:15:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6194 states. [2021-11-25 19:15:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6194 to 5192. [2021-11-25 19:15:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5192 states, 5188 states have (on average 2.9377409406322283) internal successors, (15241), 5191 states have internal predecessors, (15241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5192 states to 5192 states and 15241 transitions. [2021-11-25 19:15:19,733 INFO L78 Accepts]: Start accepts. Automaton has 5192 states and 15241 transitions. Word has length 32 [2021-11-25 19:15:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:15:19,734 INFO L470 AbstractCegarLoop]: Abstraction has 5192 states and 15241 transitions. [2021-11-25 19:15:19,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 5192 states and 15241 transitions. [2021-11-25 19:15:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:15:19,738 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:15:19,738 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, 1] [2021-11-25 19:15:19,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-11-25 19:15:19,738 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:15:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:15:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -290785296, now seen corresponding path program 3 times [2021-11-25 19:15:19,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:15:19,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209706918] [2021-11-25 19:15:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:15:19,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:15:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:15:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:15:20,448 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:15:20,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209706918] [2021-11-25 19:15:20,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209706918] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:15:20,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:15:20,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:15:20,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844054755] [2021-11-25 19:15:20,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:15:20,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:15:20,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:15:20,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:15:20,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:15:20,449 INFO L87 Difference]: Start difference. First operand 5192 states and 15241 transitions. Second operand has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:15:23,410 INFO L93 Difference]: Finished difference Result 6125 states and 17836 transitions. [2021-11-25 19:15:23,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 19:15:23,410 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:15:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:15:23,421 INFO L225 Difference]: With dead ends: 6125 [2021-11-25 19:15:23,421 INFO L226 Difference]: Without dead ends: 6125 [2021-11-25 19:15:23,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2021-11-25 19:15:23,421 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 388 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 4397 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 4424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:15:23,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 107 Invalid, 4424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4397 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 19:15:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2021-11-25 19:15:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 5172. [2021-11-25 19:15:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5172 states, 5168 states have (on average 2.9375) internal successors, (15181), 5171 states have internal predecessors, (15181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5172 states to 5172 states and 15181 transitions. [2021-11-25 19:15:23,516 INFO L78 Accepts]: Start accepts. Automaton has 5172 states and 15181 transitions. Word has length 32 [2021-11-25 19:15:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:15:23,517 INFO L470 AbstractCegarLoop]: Abstraction has 5172 states and 15181 transitions. [2021-11-25 19:15:23,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5172 states and 15181 transitions. [2021-11-25 19:15:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:15:23,521 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:15:23,521 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, 1] [2021-11-25 19:15:23,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-11-25 19:15:23,522 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:15:23,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:15:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash 210635510, now seen corresponding path program 4 times [2021-11-25 19:15:23,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:15:23,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775819692] [2021-11-25 19:15:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:15:23,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:15:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:15:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:15:24,148 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:15:24,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775819692] [2021-11-25 19:15:24,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775819692] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:15:24,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:15:24,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:15:24,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185175056] [2021-11-25 19:15:24,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:15:24,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:15:24,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:15:24,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:15:24,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:15:24,149 INFO L87 Difference]: Start difference. First operand 5172 states and 15181 transitions. Second operand has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:15:27,036 INFO L93 Difference]: Finished difference Result 6045 states and 17646 transitions. [2021-11-25 19:15:27,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 19:15:27,036 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:15:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:15:27,046 INFO L225 Difference]: With dead ends: 6045 [2021-11-25 19:15:27,047 INFO L226 Difference]: Without dead ends: 6045 [2021-11-25 19:15:27,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2021-11-25 19:15:27,047 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 384 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 4332 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 4360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:15:27,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 107 Invalid, 4360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4332 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 19:15:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2021-11-25 19:15:27,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 5112. [2021-11-25 19:15:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5112 states, 5108 states have (on average 2.942638997650744) internal successors, (15031), 5111 states have internal predecessors, (15031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 15031 transitions. [2021-11-25 19:15:27,135 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 15031 transitions. Word has length 32 [2021-11-25 19:15:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:15:27,135 INFO L470 AbstractCegarLoop]: Abstraction has 5112 states and 15031 transitions. [2021-11-25 19:15:27,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 15031 transitions. [2021-11-25 19:15:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:15:27,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:15:27,139 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, 1] [2021-11-25 19:15:27,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-11-25 19:15:27,139 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:15:27,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:15:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1229142320, now seen corresponding path program 5 times [2021-11-25 19:15:27,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:15:27,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149960573] [2021-11-25 19:15:27,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:15:27,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:15:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:15:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:15:27,880 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:15:27,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149960573] [2021-11-25 19:15:27,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149960573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:15:27,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:15:27,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:15:27,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069027005] [2021-11-25 19:15:27,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:15:27,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:15:27,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:15:27,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:15:27,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:15:27,881 INFO L87 Difference]: Start difference. First operand 5112 states and 15031 transitions. Second operand has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:15:30,947 INFO L93 Difference]: Finished difference Result 6168 states and 18013 transitions. [2021-11-25 19:15:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 19:15:30,947 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:15:30,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:15:30,958 INFO L225 Difference]: With dead ends: 6168 [2021-11-25 19:15:30,958 INFO L226 Difference]: Without dead ends: 6168 [2021-11-25 19:15:30,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 19:15:30,958 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 417 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 4551 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 4590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:15:30,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 111 Invalid, 4590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4551 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 19:15:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6168 states. [2021-11-25 19:15:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6168 to 5101. [2021-11-25 19:15:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5101 states, 5097 states have (on average 2.936629389837159) internal successors, (14968), 5100 states have internal predecessors, (14968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5101 states to 5101 states and 14968 transitions. [2021-11-25 19:15:31,044 INFO L78 Accepts]: Start accepts. Automaton has 5101 states and 14968 transitions. Word has length 32 [2021-11-25 19:15:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:15:31,044 INFO L470 AbstractCegarLoop]: Abstraction has 5101 states and 14968 transitions. [2021-11-25 19:15:31,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 5101 states and 14968 transitions. [2021-11-25 19:15:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 19:15:31,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:15:31,049 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, 1] [2021-11-25 19:15:31,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-11-25 19:15:31,049 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:15:31,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:15:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash 523405872, now seen corresponding path program 6 times [2021-11-25 19:15:31,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:15:31,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475378003] [2021-11-25 19:15:31,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:15:31,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:15:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:15:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:15:31,699 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:15:31,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475378003] [2021-11-25 19:15:31,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475378003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:15:31,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:15:31,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 19:15:31,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192841147] [2021-11-25 19:15:31,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:15:31,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:15:31,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:15:31,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:15:31,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:15:31,700 INFO L87 Difference]: Start difference. First operand 5101 states and 14968 transitions. Second operand has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:15:34,667 INFO L93 Difference]: Finished difference Result 5650 states and 16530 transitions. [2021-11-25 19:15:34,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 19:15:34,667 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-25 19:15:34,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:15:34,711 INFO L225 Difference]: With dead ends: 5650 [2021-11-25 19:15:34,711 INFO L226 Difference]: Without dead ends: 5650 [2021-11-25 19:15:34,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2021-11-25 19:15:34,712 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 391 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 4584 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 4619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 4584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:15:34,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 108 Invalid, 4619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 4584 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 19:15:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2021-11-25 19:15:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 4817. [2021-11-25 19:15:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4817 states, 4813 states have (on average 2.943070849781841) internal successors, (14165), 4816 states have internal predecessors, (14165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4817 states to 4817 states and 14165 transitions. [2021-11-25 19:15:34,787 INFO L78 Accepts]: Start accepts. Automaton has 4817 states and 14165 transitions. Word has length 32 [2021-11-25 19:15:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:15:34,787 INFO L470 AbstractCegarLoop]: Abstraction has 4817 states and 14165 transitions. [2021-11-25 19:15:34,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4817 states and 14165 transitions. [2021-11-25 19:15:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-25 19:15:34,791 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:15:34,791 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, 1] [2021-11-25 19:15:34,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-11-25 19:15:34,791 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:15:34,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:15:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2031947780, now seen corresponding path program 2 times [2021-11-25 19:15:34,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:15:34,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144771079] [2021-11-25 19:15:34,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:15:34,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:15:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:15:35,834 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-25 19:15:35,835 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:15:35,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144771079] [2021-11-25 19:15:35,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144771079] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:15:35,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195723650] [2021-11-25 19:15:35,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:15:35,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:15:35,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:15:35,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:15:35,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 19:15:36,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:15:36,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:15:36,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 104 conjunts are in the unsatisfiable core [2021-11-25 19:15:36,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:15:36,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:15:36,102 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2021-11-25 19:15:36,107 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 14 treesize of output 12 [2021-11-25 19:15:36,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-11-25 19:15:36,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-11-25 19:15:36,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:15:36,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:15:36,694 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-25 19:15:36,694 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 39 treesize of output 38 [2021-11-25 19:15:36,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:15:36,840 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-25 19:15:36,840 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 48 [2021-11-25 19:15:37,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:15:37,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:15:37,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:15:37,191 INFO L354 Elim1Store]: treesize reduction 84, result has 27.6 percent of original size [2021-11-25 19:15:37,192 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 58 treesize of output 59 [2021-11-25 19:15:37,279 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:15:37,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-11-25 19:15:37,347 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-25 19:15:37,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:17:20,081 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2573 Int) (v_ArrVal_2577 Int) (v_ArrVal_2576 Int) (v_ArrVal_2572 (Array Int Int)) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_409| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse4 |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse11 (select .cse10 .cse7))) (let ((.cse0 (+ .cse11 1))) (let ((.cse2 (mod .cse0 4))) (let ((.cse1 (= .cse2 0)) (.cse3 (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (.cse6 (store .cse10 (+ (* .cse11 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2573))) (or (and (or (<= 0 .cse0) .cse1) (= .cse2 .cse3)) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_409| v_ArrVal_2576) (<= (let ((.cse5 (store .cse6 .cse7 v_ArrVal_2576))) (select (select (store .cse4 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse5 (+ (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_409| 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2577)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ (* (select (select (store .cse4 |c_ULTIMATE.start_main_~#r~3#1.base| .cse5) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))) 8) (and (not .cse1) (= .cse2 (+ 4 .cse3)) (< .cse0 0)) (let ((.cse8 (+ (select .cse6 .cse7) 1))) (let ((.cse9 (mod .cse8 4))) (and (or (<= 0 .cse8) (< (+ v_ArrVal_2576 4) .cse9) (= .cse9 0)) (< v_ArrVal_2576 .cse9)))) (< 1 v_ArrVal_2573))))))))) is different from false [2021-11-25 19:17:51,987 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2573 Int) (v_ArrVal_2577 Int) (v_ArrVal_2576 Int) (v_ArrVal_2572 (Array Int Int)) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_409| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse4 |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse11 (select .cse10 .cse7))) (let ((.cse0 (+ .cse11 1))) (let ((.cse2 (mod .cse0 4))) (let ((.cse1 (= .cse2 0)) (.cse3 (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (.cse6 (store .cse10 (+ (* .cse11 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2573))) (or (and (or (<= 0 .cse0) .cse1) (= .cse2 .cse3)) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_409| v_ArrVal_2576) (<= (let ((.cse5 (store .cse6 .cse7 v_ArrVal_2576))) (select (select (store .cse4 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse5 (+ (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_409| 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2577)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select (select (store .cse4 |c_ULTIMATE.start_main_~#r~3#1.base| .cse5) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4))) 8) (and (not .cse1) (= .cse2 (+ 4 .cse3)) (< .cse0 0)) (let ((.cse8 (+ (select .cse6 .cse7) 1))) (let ((.cse9 (mod .cse8 4))) (and (or (<= 0 .cse8) (< (+ v_ArrVal_2576 4) .cse9) (= .cse9 0)) (< v_ArrVal_2576 .cse9)))) (< 1 v_ArrVal_2573))))))))) is different from false [2021-11-25 19:17:57,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2573 Int) (v_ArrVal_2577 Int) (v_ArrVal_2576 Int) (v_ArrVal_2572 (Array Int Int)) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_409| Int)) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2572) |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse10 (select .cse9 .cse7))) (let ((.cse0 (+ .cse10 1))) (let ((.cse2 (mod .cse0 4))) (let ((.cse1 (= .cse2 0)) (.cse3 (select .cse9 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (.cse6 (store .cse9 (+ (* .cse10 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2573))) (or (and (or (<= 0 .cse0) .cse1) (= .cse2 .cse3)) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_409| v_ArrVal_2576) (and (not .cse1) (= .cse2 (+ 4 .cse3)) (< .cse0 0)) (let ((.cse4 (+ (select .cse6 .cse7) 1))) (let ((.cse5 (mod .cse4 4))) (and (or (<= 0 .cse4) (< (+ v_ArrVal_2576 4) .cse5) (= .cse5 0)) (< v_ArrVal_2576 .cse5)))) (< 1 v_ArrVal_2573) (<= (let ((.cse8 (store .cse6 .cse7 v_ArrVal_2576))) (select (store .cse8 (+ (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_409| 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2577) (+ (* (select .cse8 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4))) 8)))))))) is different from false [2021-11-25 19:17:57,851 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-25 19:17:57,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195723650] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:17:57,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1430029994] [2021-11-25 19:17:57,852 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-25 19:17:57,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:17:57,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 56 [2021-11-25 19:17:57,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404627794] [2021-11-25 19:17:57,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:17:57,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-11-25 19:17:57,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:17:57,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-11-25 19:17:57,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2744, Unknown=33, NotChecked=324, Total=3306 [2021-11-25 19:17:57,854 INFO L87 Difference]: Start difference. First operand 4817 states and 14165 transitions. Second operand has 58 states, 57 states have (on average 1.736842105263158) internal successors, (99), 57 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:18:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:18:14,173 INFO L93 Difference]: Finished difference Result 8432 states and 24533 transitions. [2021-11-25 19:18:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-11-25 19:18:14,174 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.736842105263158) internal successors, (99), 57 states have internal predecessors, (99), 0 states have call successors, (0), 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 33 [2021-11-25 19:18:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:18:14,191 INFO L225 Difference]: With dead ends: 8432 [2021-11-25 19:18:14,192 INFO L226 Difference]: Without dead ends: 8432 [2021-11-25 19:18:14,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 37 SyntacticMatches, 17 SemanticMatches, 126 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4428 ImplicationChecksByTransitivity, 96.8s TimeCoverageRelationStatistics Valid=1525, Invalid=13954, Unknown=33, NotChecked=744, Total=16256 [2021-11-25 19:18:14,193 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 1307 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 6747 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 11247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 6747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4342 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:18:14,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1307 Valid, 297 Invalid, 11247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 6747 Invalid, 0 Unknown, 4342 Unchecked, 5.7s Time] [2021-11-25 19:18:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8432 states. [2021-11-25 19:18:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8432 to 5395. [2021-11-25 19:18:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5395 states, 5391 states have (on average 2.9447226859580784) internal successors, (15875), 5394 states have internal predecessors, (15875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:18:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5395 states to 5395 states and 15875 transitions. [2021-11-25 19:18:14,324 INFO L78 Accepts]: Start accepts. Automaton has 5395 states and 15875 transitions. Word has length 33 [2021-11-25 19:18:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:18:14,325 INFO L470 AbstractCegarLoop]: Abstraction has 5395 states and 15875 transitions. [2021-11-25 19:18:14,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.736842105263158) internal successors, (99), 57 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:18:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 5395 states and 15875 transitions. [2021-11-25 19:18:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-25 19:18:14,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:18:14,330 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, 1] [2021-11-25 19:18:14,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 19:18:14,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:18:14,531 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:18:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:18:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2031947779, now seen corresponding path program 1 times [2021-11-25 19:18:14,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:18:14,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528160538] [2021-11-25 19:18:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:18:14,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:18:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:18:17,016 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-25 19:18:17,016 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:18:17,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528160538] [2021-11-25 19:18:17,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528160538] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:18:17,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473337143] [2021-11-25 19:18:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:18:17,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:18:17,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:18:17,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:18:17,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 19:18:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:18:17,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 98 conjunts are in the unsatisfiable core [2021-11-25 19:18:17,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:18:17,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:18:17,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2021-11-25 19:18:17,353 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 14 treesize of output 12 [2021-11-25 19:18:17,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-11-25 19:18:17,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-11-25 19:18:18,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:18:18,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:18:18,218 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-25 19:18:18,218 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 39 treesize of output 38 [2021-11-25 19:18:18,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:18:18,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:18:18,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:18:18,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2021-11-25 19:18:18,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:18:18,709 INFO L354 Elim1Store]: treesize reduction 41, result has 45.3 percent of original size [2021-11-25 19:18:18,709 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 3 case distinctions, treesize of input 40 treesize of output 55 [2021-11-25 19:18:18,882 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:18:18,882 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2021-11-25 19:18:18,982 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-25 19:18:18,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:18:36,687 WARN L838 $PredicateComparison]: unable to prove that (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (+ (* |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 4) 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|))))) is different from false [2021-11-25 19:18:38,708 WARN L838 $PredicateComparison]: unable to prove that (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4))))) is different from false [2021-11-25 19:18:42,991 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:18:48,689 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:19:27,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| Int) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2661 Int) (v_ArrVal_2660 Int) (v_ArrVal_2664 Int) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| Int)) (or (< v_ArrVal_2664 2) (<= 1 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2658))) (let ((.cse1 (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2660)) .cse3 v_ArrVal_2661)))) (select (select (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse1 (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| .cse1) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))))) (< v_ArrVal_2660 1))) is different from false [2021-11-25 19:19:27,720 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| Int) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2661 Int) (v_ArrVal_2660 Int) (v_ArrVal_2664 Int) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| Int)) (or (< v_ArrVal_2664 2) (<= 1 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2658))) (let ((.cse1 (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2660)) .cse3 v_ArrVal_2661)))) (select (select (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse1 (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| .cse1) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4))))) (< v_ArrVal_2660 1))) is different from false [2021-11-25 19:19:27,793 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| Int) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2661 Int) (v_ArrVal_2660 Int) (v_ArrVal_2664 Int) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| Int)) (or (< v_ArrVal_2664 2) (<= 1 (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2658) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2660)) .cse2 v_ArrVal_2661)))) (select (store .cse0 (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| 4) 4) v_ArrVal_2664) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4))))) (< v_ArrVal_2660 1))) is different from false [2021-11-25 19:19:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 19:19:27,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473337143] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:19:27,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [329217707] [2021-11-25 19:19:27,798 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-25 19:19:27,798 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:19:27,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 16] total 52 [2021-11-25 19:19:27,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776085471] [2021-11-25 19:19:27,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:19:27,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-11-25 19:19:27,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:19:27,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-11-25 19:19:27,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2156, Unknown=25, NotChecked=490, Total=2862 [2021-11-25 19:19:27,802 INFO L87 Difference]: Start difference. First operand 5395 states and 15875 transitions. Second operand has 54 states, 53 states have (on average 1.830188679245283) internal successors, (97), 53 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:19:30,956 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|)) (.cse0 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (and (= (select .cse0 20) 0) (not (= |c_ULTIMATE.start_main_~#writer~0#1.base| |c_reader_twoThread1of1ForFork1_~r~2#1.base|)) (= (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 20)) 0) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| Int) (v_ArrVal_2661 Int) (v_ArrVal_2660 Int) (v_ArrVal_2664 Int) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| Int)) (or (<= 1 (let ((.cse1 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2660) (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 20) v_ArrVal_2661)))) (select (select (store .cse1 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select .cse1 |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ (* (select (select .cse1 |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_2660 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 2)))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (<= |c_~#mutex~0.offset| 0) (= (select .cse2 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 0 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (= (select .cse2 20) 0) (<= 0 |c_~#mutex~0.offset|) (= (select .cse0 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (not (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) is different from false [2021-11-25 19:19:32,659 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (<= 1 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))))) is different from false [2021-11-25 19:19:36,179 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base|)) (.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|)) (.cse0 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (and (= (select .cse0 20) 0) (= (select .cse1 20) 0) (not (= |c_ULTIMATE.start_main_~#writer~0#1.base| |c_reader_twoThread1of1ForFork1_~r~2#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0) (= (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 20)) 0) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| Int) (v_ArrVal_2661 Int) (v_ArrVal_2660 Int) (v_ArrVal_2664 Int) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| Int)) (or (<= 1 (let ((.cse2 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2660) (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 20) v_ArrVal_2661)))) (select (select (store .cse2 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select .cse2 |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ (* (select (select .cse2 |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_2660 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 2)))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (= |c_reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| 0) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (<= |c_~#mutex~0.offset| 0) (= (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 0 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (= (select .cse3 20) 0) (<= 0 |c_~#mutex~0.offset|) (= (select .cse0 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (not (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 0))) is different from false [2021-11-25 19:19:38,215 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base|)) (.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|)) (.cse0 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (and (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (= (select .cse0 20) 0) (= (select .cse1 20) 0) (not (= |c_ULTIMATE.start_main_~#writer~0#1.base| |c_reader_twoThread1of1ForFork1_~r~2#1.base|)) (= |c_writer_fnThread1of1ForFork0_~i~1#1| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| Int) (v_ArrVal_2661 Int) (v_ArrVal_2660 Int) (v_ArrVal_2664 Int) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| Int)) (or (<= 1 (let ((.cse2 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2660) (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 20) v_ArrVal_2661)))) (select (select (store .cse2 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select .cse2 |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset_347| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_421| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ (* (select (select .cse2 |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_2660 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 2)))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (= (select .cse1 |c_writer_fnThread1of1ForFork0_~r~1#1.offset|) 0) (= |c_reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| 0) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (<= |c_~#mutex~0.offset| 0) (= (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (= (select .cse3 20) 0) (<= 0 |c_~#mutex~0.offset|) (= (select .cse0 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (not (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 0))) is different from false [2021-11-25 19:19:40,215 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#mutex~0.offset| 4)) (.cse0 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (and (= (select .cse0 .cse1) 1) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (<= |c_~#mutex~0.offset| 0) (= (select .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.offset|) 0) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (or (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base|) (+ |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 20)) |c_reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1|) (<= .cse1 (* 4 (select .cse0 20)))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (<= 0 |c_~#mutex~0.offset|) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (<= 1 (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 0) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4))))))) is different from false [2021-11-25 19:19:41,371 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#mutex~0.offset| 4)) (.cse0 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (and (= (select .cse0 .cse1) 1) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (or (and (<= (div |c_reader_twoThread1of1ForFork1_ring_empty_#res#1| 256) 0) (<= 1 |c_reader_twoThread1of1ForFork1_ring_empty_#res#1|)) (<= .cse1 (* 4 (select .cse0 20)))) (<= |c_~#mutex~0.offset| 0) (= (select .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.offset|) 0) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (<= 0 |c_~#mutex~0.offset|) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (<= 1 (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4))))))) is different from false [2021-11-25 19:19:42,558 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#mutex~0.offset| 4)) (.cse0 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (let ((.cse2 (<= .cse1 (* 4 (select .cse0 20))))) (and (= (select .cse0 .cse1) 1) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (or (and (<= (div |c_reader_twoThread1of1ForFork1_ring_empty_#res#1| 256) 0) (<= 1 |c_reader_twoThread1of1ForFork1_ring_empty_#res#1|)) .cse2) (<= |c_~#mutex~0.offset| 0) (= (select .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.offset|) 0) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (or (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base|) (+ |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 20)) |c_reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1|) .cse2) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (<= 0 |c_~#mutex~0.offset|) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (<= 1 (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 0) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))))))) is different from false [2021-11-25 19:19:43,607 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1|)) (.cse1 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (and (= |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 0) (= 0 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) (= |c_~#mutex~0.offset| (+ .cse0 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)) (= (select .cse1 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) 0) (<= (+ .cse0 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) (* 4 (select .cse1 20))) (= |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)) (= |c_writer_fnThread1of1ForFork0_~r~1#1.base| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (<= 1 (select .cse1 (+ 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|))) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (= (select .cse1 (+ (* |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 4) 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)) 1) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (+ (* |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 4) 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|))))))) is different from false [2021-11-25 19:19:44,704 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (let ((.cse1 (+ |c_~#mutex~0.offset| 4)) (.cse3 (* 4 (select .cse0 20)))) (let ((.cse2 (* 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1|)) (.cse4 (<= .cse1 .cse3))) (and (= |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 0) (= (select .cse0 .cse1) 1) (= 0 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) (= |c_~#mutex~0.offset| (+ .cse2 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (= (select .cse0 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) 0) (<= (+ .cse2 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) .cse3) (= |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)) (= |c_writer_fnThread1of1ForFork0_~r~1#1.base| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (<= 1 (select .cse0 (+ 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|))) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (and (<= (div |c_reader_twoThread1of1ForFork1_ring_empty_#res#1| 256) 0) (<= 1 |c_reader_twoThread1of1ForFork1_ring_empty_#res#1|)) .cse4) (<= |c_~#mutex~0.offset| 0) (= (select .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.offset|) 0) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (or (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base|) (+ |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 20)) |c_reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1|) .cse4) (= (select .cse0 (+ (* |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 4) 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)) 1) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (<= 0 |c_~#mutex~0.offset|) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (<= 1 (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 0) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4))))))))) is different from false [2021-11-25 19:20:02,405 WARN L227 SmtUtils]: Spent 17.58s on a formula simplification. DAG size of input: 90 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 19:20:03,379 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (and (= 0 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) (= (select .cse0 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) 0) (= |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)) (= |c_writer_fnThread1of1ForFork0_~r~1#1.base| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (<= 1 (select .cse0 (+ 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|))) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (+ (* |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 4) 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|))))))) is different from false [2021-11-25 19:20:04,373 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (+ (* |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 4) 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (<= 1 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))))) is different from false [2021-11-25 19:20:05,747 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (let ((.cse1 (+ |c_~#mutex~0.offset| 4)) (.cse3 (* 4 (select .cse0 20)))) (let ((.cse2 (* 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1|)) (.cse4 (<= .cse1 .cse3))) (and (= |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 0) (= (select .cse0 .cse1) 1) (= 0 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) (= |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| 1) (= |c_~#mutex~0.offset| (+ .cse2 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (= (select .cse0 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) 0) (<= (+ .cse2 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) .cse3) (= |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)) (= |c_writer_fnThread1of1ForFork0_~r~1#1.base| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (<= 1 (select .cse0 (+ 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|))) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (and (<= (div |c_reader_twoThread1of1ForFork1_ring_empty_#res#1| 256) 0) (<= 1 |c_reader_twoThread1of1ForFork1_ring_empty_#res#1|)) .cse4) (<= |c_~#mutex~0.offset| 0) (= (select .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.offset|) 0) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (or (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base|) (+ |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 20)) |c_reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1|) .cse4) (= (select .cse0 (+ (* |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 4) 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)) 1) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (<= 0 |c_~#mutex~0.offset|) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (<= 1 (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 0) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4))))))))) is different from false [2021-11-25 19:20:06,763 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1|) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (+ (* |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| 4) 4 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (<= 1 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))))) is different from false [2021-11-25 19:20:08,017 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#mutex~0.offset| 4)) (.cse0 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (let ((.cse2 (<= .cse1 (* 4 (select .cse0 20))))) (and (= (select .cse0 .cse1) 1) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (or (and (<= (div |c_reader_twoThread1of1ForFork1_ring_empty_#res#1| 256) 0) (<= 1 |c_reader_twoThread1of1ForFork1_ring_empty_#res#1|)) .cse2) (<= |c_~#mutex~0.offset| 0) (= (select .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.offset|) 0) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (or (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base|) (+ |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 20)) |c_reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1|) .cse2) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (<= 0 |c_~#mutex~0.offset|) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (<= 1 (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))) (= |c_reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| 1) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| 0) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))))))) is different from false [2021-11-25 19:20:09,031 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (<= 1 |c_reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1|) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (<= 1 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_2664 Int)) (or (< v_ArrVal_2664 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 1 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_2664)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))))) is different from false [2021-11-25 19:20:21,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:21,242 INFO L93 Difference]: Finished difference Result 8524 states and 24958 transitions. [2021-11-25 19:20:21,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-11-25 19:20:21,242 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.830188679245283) internal successors, (97), 53 states have internal predecessors, (97), 0 states have call successors, (0), 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 33 [2021-11-25 19:20:21,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:21,260 INFO L225 Difference]: With dead ends: 8524 [2021-11-25 19:20:21,260 INFO L226 Difference]: Without dead ends: 8524 [2021-11-25 19:20:21,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 108 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 1904 ImplicationChecksByTransitivity, 118.5s TimeCoverageRelationStatistics Valid=852, Invalid=7194, Unknown=44, NotChecked=3900, Total=11990 [2021-11-25 19:20:21,261 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 573 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 3986 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 8194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4124 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:21,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 191 Invalid, 8194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3986 Invalid, 0 Unknown, 4124 Unchecked, 3.9s Time] [2021-11-25 19:20:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8524 states. [2021-11-25 19:20:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8524 to 5956. [2021-11-25 19:20:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5956 states, 5952 states have (on average 2.9469086021505375) internal successors, (17540), 5955 states have internal predecessors, (17540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:20:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5956 states to 5956 states and 17540 transitions. [2021-11-25 19:20:21,399 INFO L78 Accepts]: Start accepts. Automaton has 5956 states and 17540 transitions. Word has length 33 [2021-11-25 19:20:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:21,399 INFO L470 AbstractCegarLoop]: Abstraction has 5956 states and 17540 transitions. [2021-11-25 19:20:21,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.830188679245283) internal successors, (97), 53 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:20:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 5956 states and 17540 transitions. [2021-11-25 19:20:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-25 19:20:21,405 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:21,406 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, 1] [2021-11-25 19:20:21,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:21,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:20:21,606 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-25 19:20:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash -715790476, now seen corresponding path program 3 times [2021-11-25 19:20:21,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:20:21,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615610591] [2021-11-25 19:20:21,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:21,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:20:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:22,779 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-25 19:20:22,779 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:20:22,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615610591] [2021-11-25 19:20:22,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615610591] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:20:22,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025663974] [2021-11-25 19:20:22,779 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:20:22,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:20:22,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:20:22,780 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:20:22,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1fd4780-d2de-4adc-9227-b5f3cba0cf6c/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 19:20:23,016 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:20:23,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:20:23,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 106 conjunts are in the unsatisfiable core [2021-11-25 19:20:23,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:23,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:20:23,039 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2021-11-25 19:20:23,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:20:23,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-11-25 19:20:23,048 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 14 treesize of output 12 [2021-11-25 19:20:23,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-11-25 19:20:23,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:20:23,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:20:23,953 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-25 19:20:23,954 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 39 treesize of output 38 [2021-11-25 19:20:24,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:20:24,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:20:24,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:20:24,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2021-11-25 19:20:24,611 INFO L354 Elim1Store]: treesize reduction 93, result has 27.3 percent of original size [2021-11-25 19:20:24,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 61 [2021-11-25 19:20:24,703 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-25 19:20:24,703 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-25 19:20:24,787 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-25 19:20:24,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:21:49,577 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| Int) (v_ArrVal_2745 Int) (v_ArrVal_2747 Int)) (let ((.cse5 (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 20))) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 4) v_ArrVal_2745)))) (let ((.cse0 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse4 .cse5 v_ArrVal_2747)))) (let ((.cse1 (select .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (or (<= (select (select (store .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store .cse1 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| 4) 4) v_ArrVal_2749)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ (* (select (select .cse0 |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)) 8) (< |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1| v_ArrVal_2745) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| (select .cse1 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20))) (let ((.cse3 (+ (select .cse4 .cse5) 1))) (let ((.cse2 (mod .cse3 4))) (and (< v_ArrVal_2747 .cse2) (or (< (+ v_ArrVal_2747 4) .cse2) (= .cse2 0) (<= 0 .cse3))))))))))) is different from false [2021-11-25 19:22:18,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (v_ArrVal_2743 (Array Int Int)) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| Int) (v_ArrVal_2745 Int) (v_ArrVal_2747 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2743))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse11 (select .cse10 .cse7))) (let ((.cse3 (+ .cse11 1))) (let ((.cse2 (mod .cse3 4))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (.cse0 (= .cse2 0)) (.cse6 (store .cse10 (+ (* .cse11 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2745))) (or (and (not .cse0) (= (+ .cse1 4) .cse2) (< .cse3 0)) (let ((.cse5 (+ (select .cse6 .cse7) 1))) (let ((.cse4 (mod .cse5 4))) (and (< v_ArrVal_2747 .cse4) (or (= .cse4 0) (< (+ v_ArrVal_2747 4) .cse4) (<= 0 .cse5))))) (< 1 v_ArrVal_2745) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| v_ArrVal_2747) (and (= .cse1 .cse2) (or .cse0 (<= 0 .cse3))) (<= (let ((.cse9 (store .cse6 .cse7 v_ArrVal_2747))) (select (select (store .cse8 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse9 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| 4) 4) v_ArrVal_2749)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select (select (store .cse8 |c_ULTIMATE.start_main_~#r~3#1.base| .cse9) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4))) 8))))))))) is different from false [2021-11-25 19:22:54,722 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (v_ArrVal_2743 (Array Int Int)) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| Int) (v_ArrVal_2745 Int) (v_ArrVal_2747 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2743))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse11 (select .cse10 .cse7))) (let ((.cse3 (+ .cse11 1))) (let ((.cse2 (mod .cse3 4))) (let ((.cse6 (store .cse10 (+ (* .cse11 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2745)) (.cse1 (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (.cse0 (= .cse2 0))) (or (and (not .cse0) (= (+ .cse1 4) .cse2) (< .cse3 0)) (let ((.cse5 (+ (select .cse6 .cse7) 1))) (let ((.cse4 (mod .cse5 4))) (and (< v_ArrVal_2747 .cse4) (or (= .cse4 0) (< (+ v_ArrVal_2747 4) .cse4) (<= 0 .cse5))))) (<= (let ((.cse9 (store .cse6 .cse7 v_ArrVal_2747))) (select (select (store .cse8 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse9 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| 4) 4) v_ArrVal_2749)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select (select (store .cse8 |c_ULTIMATE.start_main_~#r~3#1.base| .cse9) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4))) 8) (< 1 v_ArrVal_2745) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| v_ArrVal_2747) (and (= .cse1 .cse2) (or .cse0 (<= 0 .cse3))))))))))) is different from false [2021-11-25 19:23:00,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (v_ArrVal_2743 (Array Int Int)) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| Int) (v_ArrVal_2745 Int) (v_ArrVal_2747 Int)) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2743) |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse10 (select .cse9 .cse6))) (let ((.cse3 (+ .cse10 1))) (let ((.cse2 (mod .cse3 4))) (let ((.cse5 (store .cse9 (+ (* .cse10 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_2745)) (.cse1 (select .cse9 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (.cse0 (= .cse2 0))) (or (and (not .cse0) (= (+ .cse1 4) .cse2) (< .cse3 0)) (<= (let ((.cse4 (store .cse5 .cse6 v_ArrVal_2747))) (select (store .cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| 4) 4) v_ArrVal_2749) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse4 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))) 8) (let ((.cse8 (+ (select .cse5 .cse6) 1))) (let ((.cse7 (mod .cse8 4))) (and (< v_ArrVal_2747 .cse7) (or (= .cse7 0) (< (+ v_ArrVal_2747 4) .cse7) (<= 0 .cse8))))) (< 1 v_ArrVal_2745) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_428| v_ArrVal_2747) (and (= .cse1 .cse2) (or .cse0 (<= 0 .cse3)))))))))) is different from false [2021-11-25 19:23:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 19:23:00,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025663974] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:23:00,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [622611802] [2021-11-25 19:23:00,421 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-25 19:23:00,422 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:23:00,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 56 [2021-11-25 19:23:00,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665595773] [2021-11-25 19:23:00,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:23:00,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-11-25 19:23:00,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:23:00,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-11-25 19:23:00,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2662, Unknown=36, NotChecked=428, Total=3306 [2021-11-25 19:23:00,424 INFO L87 Difference]: Start difference. First operand 5956 states and 17540 transitions. Second operand has 58 states, 57 states have (on average 1.736842105263158) internal successors, (99), 57 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)