./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16b049fb81e05ec2192b5dc6cabf7c8b89c1486d4e623332a0a01a89383c6c7d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 22:33:54,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:33:54,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:33:54,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:33:54,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:33:54,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:33:54,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:33:54,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:33:54,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:33:54,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:33:54,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:33:54,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:33:54,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:33:54,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:33:54,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:33:54,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:33:54,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:33:54,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:33:54,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:33:54,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:33:54,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:33:54,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:33:54,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:33:54,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:33:54,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:33:54,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:33:54,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:33:54,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:33:54,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:33:54,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:33:54,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:33:54,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:33:54,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:33:54,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:33:54,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:33:54,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:33:54,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:33:54,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:33:54,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:33:54,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:33:54,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:33:54,598 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-25 22:33:54,620 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:33:54,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:33:54,621 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:33:54,621 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:33:54,622 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:33:54,622 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:33:54,622 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:33:54,623 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:33:54,623 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:33:54,623 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:33:54,623 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:33:54,624 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:33:54,624 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:33:54,624 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:33:54,624 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:33:54,625 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:33:54,625 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:33:54,625 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:33:54,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:33:54,626 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:33:54,626 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:33:54,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:33:54,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:33:54,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:33:54,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:33:54,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:33:54,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:33:54,628 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-25 22:33:54,628 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:33:54,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:33:54,628 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:33:54,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:33:54,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:33:54,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:33:54,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:33:54,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:33:54,630 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:33:54,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:33:54,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:33:54,630 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:33:54,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:33:54,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:33:54,631 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:33:54,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/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_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur 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 ! data-race) ) 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 -> 16b049fb81e05ec2192b5dc6cabf7c8b89c1486d4e623332a0a01a89383c6c7d [2022-11-25 22:33:54,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:33:54,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:33:54,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:33:54,914 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:33:54,915 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:33:54,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i [2022-11-25 22:33:58,026 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:33:58,337 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:33:58,337 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i [2022-11-25 22:33:58,350 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/data/0fcb9e7d3/c6840a0b23c349bcb19ceab4dd847376/FLAGfe935bd41 [2022-11-25 22:33:58,365 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/data/0fcb9e7d3/c6840a0b23c349bcb19ceab4dd847376 [2022-11-25 22:33:58,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:33:58,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:33:58,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:33:58,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:33:58,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:33:58,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:33:58" (1/1) ... [2022-11-25 22:33:58,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb30fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:58, skipping insertion in model container [2022-11-25 22:33:58,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:33:58" (1/1) ... [2022-11-25 22:33:58,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:33:58,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:33:58,562 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 22:33:58,810 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30448,30461] [2022-11-25 22:33:58,823 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30811,30824] [2022-11-25 22:33:58,847 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31483,31496] [2022-11-25 22:33:58,850 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31534,31547] [2022-11-25 22:33:58,858 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31683,31696] [2022-11-25 22:33:58,863 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31760,31773] [2022-11-25 22:33:58,867 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31807,31820] [2022-11-25 22:33:58,871 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31916,31929] [2022-11-25 22:33:58,875 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32035,32048] [2022-11-25 22:33:58,877 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32083,32096] [2022-11-25 22:33:58,882 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32160,32173] [2022-11-25 22:33:58,884 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32286,32299] [2022-11-25 22:33:58,894 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32869,32882] [2022-11-25 22:33:58,899 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32946,32959] [2022-11-25 22:33:58,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:33:58,916 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:33:58,937 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 22:33:58,972 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30448,30461] [2022-11-25 22:33:58,979 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30811,30824] [2022-11-25 22:33:58,989 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31483,31496] [2022-11-25 22:33:58,998 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31534,31547] [2022-11-25 22:33:59,001 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31683,31696] [2022-11-25 22:33:59,005 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31760,31773] [2022-11-25 22:33:59,007 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31807,31820] [2022-11-25 22:33:59,010 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31916,31929] [2022-11-25 22:33:59,015 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32035,32048] [2022-11-25 22:33:59,017 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32083,32096] [2022-11-25 22:33:59,019 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32160,32173] [2022-11-25 22:33:59,023 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32286,32299] [2022-11-25 22:33:59,033 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32869,32882] [2022-11-25 22:33:59,043 WARN L237 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_5fab0d63-8f19-4436-a405-0df40112155d/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32946,32959] [2022-11-25 22:33:59,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:33:59,096 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:33:59,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59 WrapperNode [2022-11-25 22:33:59,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:33:59,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:33:59,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:33:59,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:33:59,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (1/1) ... [2022-11-25 22:33:59,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (1/1) ... [2022-11-25 22:33:59,223 INFO L138 Inliner]: procedures = 174, calls = 70, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 781 [2022-11-25 22:33:59,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:33:59,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:33:59,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:33:59,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:33:59,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (1/1) ... [2022-11-25 22:33:59,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (1/1) ... [2022-11-25 22:33:59,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (1/1) ... [2022-11-25 22:33:59,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (1/1) ... [2022-11-25 22:33:59,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (1/1) ... [2022-11-25 22:33:59,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (1/1) ... [2022-11-25 22:33:59,368 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (1/1) ... [2022-11-25 22:33:59,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (1/1) ... [2022-11-25 22:33:59,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:33:59,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:33:59,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:33:59,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:33:59,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (1/1) ... [2022-11-25 22:33:59,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:33:59,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:59,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:33:59,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:33:59,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 22:33:59,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 22:33:59,473 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 22:33:59,473 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-11-25 22:33:59,474 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-11-25 22:33:59,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:33:59,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:33:59,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:33:59,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:33:59,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:33:59,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:33:59,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:33:59,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:33:59,478 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 22:33:59,701 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:33:59,705 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:34:01,063 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:34:01,089 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:34:01,089 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-11-25 22:34:01,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:34:01 BoogieIcfgContainer [2022-11-25 22:34:01,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:34:01,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:34:01,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:34:01,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:34:01,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:33:58" (1/3) ... [2022-11-25 22:34:01,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be1e377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:34:01, skipping insertion in model container [2022-11-25 22:34:01,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:59" (2/3) ... [2022-11-25 22:34:01,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be1e377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:34:01, skipping insertion in model container [2022-11-25 22:34:01,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:34:01" (3/3) ... [2022-11-25 22:34:01,101 INFO L112 eAbstractionObserver]: Analyzing ICFG one_time_barrier_2t.i [2022-11-25 22:34:01,110 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 22:34:01,121 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:34:01,121 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2022-11-25 22:34:01,121 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 22:34:01,386 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-25 22:34:01,458 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 22:34:01,484 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 839 places, 898 transitions, 1804 flow [2022-11-25 22:34:01,487 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 839 places, 898 transitions, 1804 flow [2022-11-25 22:34:01,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 839 places, 898 transitions, 1804 flow [2022-11-25 22:34:02,201 INFO L130 PetriNetUnfolder]: 94/1320 cut-off events. [2022-11-25 22:34:02,203 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 22:34:02,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1320 events. 94/1320 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4488 event pairs, 0 based on Foata normal form. 0/1110 useless extension candidates. Maximal degree in co-relation 792. Up to 4 conditions per place. [2022-11-25 22:34:02,413 INFO L119 LiptonReduction]: Number of co-enabled transitions 312440 [2022-11-25 22:34:48,838 WARN L233 SmtUtils]: Spent 7.76s on a formula simplification. DAG size of input: 120 DAG size of output: 118 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:34:59,637 WARN L233 SmtUtils]: Spent 8.81s on a formula simplification. DAG size of input: 129 DAG size of output: 125 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:35:09,583 INFO L134 LiptonReduction]: Checked pairs total: 5093793 [2022-11-25 22:35:09,584 INFO L136 LiptonReduction]: Total number of compositions: 616 [2022-11-25 22:35:09,593 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 437 places, 472 transitions, 952 flow [2022-11-25 22:35:10,655 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45720 states, 44278 states have (on average 2.2235647499887077) internal successors, (98455), 45719 states have internal predecessors, (98455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:10,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:35:10,687 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@411ab2c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:35:10,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 111 error locations. [2022-11-25 22:35:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 45720 states, 44278 states have (on average 2.2235647499887077) internal successors, (98455), 45719 states have internal predecessors, (98455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-25 22:35:10,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:10,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-25 22:35:10,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:10,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash 97698, now seen corresponding path program 1 times [2022-11-25 22:35:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:10,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810329900] [2022-11-25 22:35:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:10,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:35:11,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:11,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810329900] [2022-11-25 22:35:11,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810329900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:11,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:11,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:35:11,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870350671] [2022-11-25 22:35:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:11,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 22:35:11,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:11,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 22:35:11,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 22:35:11,136 INFO L87 Difference]: Start difference. First operand has 45720 states, 44278 states have (on average 2.2235647499887077) internal successors, (98455), 45719 states have internal predecessors, (98455), 0 states have call successors, (0), 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, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:12,208 INFO L93 Difference]: Finished difference Result 45715 states and 94411 transitions. [2022-11-25 22:35:12,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 22:35:12,210 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-25 22:35:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:12,613 INFO L225 Difference]: With dead ends: 45715 [2022-11-25 22:35:12,614 INFO L226 Difference]: Without dead ends: 45713 [2022-11-25 22:35:12,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 22:35:12,618 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:12,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:35:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45713 states. [2022-11-25 22:35:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45713 to 45713. [2022-11-25 22:35:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45713 states, 44278 states have (on average 2.132164957766837) internal successors, (94408), 45712 states have internal predecessors, (94408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45713 states to 45713 states and 94408 transitions. [2022-11-25 22:35:14,212 INFO L78 Accepts]: Start accepts. Automaton has 45713 states and 94408 transitions. Word has length 2 [2022-11-25 22:35:14,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:14,212 INFO L495 AbstractCegarLoop]: Abstraction has 45713 states and 94408 transitions. [2022-11-25 22:35:14,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:14,213 INFO L276 IsEmpty]: Start isEmpty. Operand 45713 states and 94408 transitions. [2022-11-25 22:35:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:35:14,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:14,214 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-11-25 22:35:14,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:35:14,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:14,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash -374250033, now seen corresponding path program 1 times [2022-11-25 22:35:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:14,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525989409] [2022-11-25 22:35:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:14,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:35:14,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:14,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525989409] [2022-11-25 22:35:14,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525989409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:14,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:14,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:35:14,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684439771] [2022-11-25 22:35:14,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:14,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:35:14,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:14,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:35:14,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:35:14,550 INFO L87 Difference]: Start difference. First operand 45713 states and 94408 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:15,689 INFO L93 Difference]: Finished difference Result 45714 states and 94409 transitions. [2022-11-25 22:35:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:35:15,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 22:35:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:16,137 INFO L225 Difference]: With dead ends: 45714 [2022-11-25 22:35:16,138 INFO L226 Difference]: Without dead ends: 45714 [2022-11-25 22:35:16,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:35:16,143 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:16,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 22:35:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45714 states. [2022-11-25 22:35:17,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45714 to 45714. [2022-11-25 22:35:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45714 states, 44279 states have (on average 2.1321393888750877) internal successors, (94409), 45713 states have internal predecessors, (94409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45714 states to 45714 states and 94409 transitions. [2022-11-25 22:35:18,087 INFO L78 Accepts]: Start accepts. Automaton has 45714 states and 94409 transitions. Word has length 7 [2022-11-25 22:35:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:18,087 INFO L495 AbstractCegarLoop]: Abstraction has 45714 states and 94409 transitions. [2022-11-25 22:35:18,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 45714 states and 94409 transitions. [2022-11-25 22:35:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:35:18,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:18,088 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:18,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:35:18,089 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash 878781449, now seen corresponding path program 1 times [2022-11-25 22:35:18,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:18,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108006086] [2022-11-25 22:35:18,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:18,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:35:18,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:18,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108006086] [2022-11-25 22:35:18,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108006086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:35:18,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130741170] [2022-11-25 22:35:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:18,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:35:18,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:35:18,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:35:18,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 22:35:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:18,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:35:18,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:35:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:35:18,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:35:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:35:18,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130741170] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:35:18,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1859798532] [2022-11-25 22:35:18,691 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-25 22:35:18,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:35:18,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-11-25 22:35:18,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904498409] [2022-11-25 22:35:18,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:35:18,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:35:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:18,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:35:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:35:18,695 INFO L87 Difference]: Start difference. First operand 45714 states and 94409 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:19,855 INFO L93 Difference]: Finished difference Result 45715 states and 94410 transitions. [2022-11-25 22:35:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:35:19,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 22:35:19,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:20,007 INFO L225 Difference]: With dead ends: 45715 [2022-11-25 22:35:20,007 INFO L226 Difference]: Without dead ends: 45715 [2022-11-25 22:35:20,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:35:20,009 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 0 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:20,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 879 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 22:35:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45715 states. [2022-11-25 22:35:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45715 to 45715. [2022-11-25 22:35:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45715 states, 44280 states have (on average 2.1321138211382116) internal successors, (94410), 45714 states have internal predecessors, (94410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45715 states to 45715 states and 94410 transitions. [2022-11-25 22:35:21,510 INFO L78 Accepts]: Start accepts. Automaton has 45715 states and 94410 transitions. Word has length 8 [2022-11-25 22:35:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:21,510 INFO L495 AbstractCegarLoop]: Abstraction has 45715 states and 94410 transitions. [2022-11-25 22:35:21,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 45715 states and 94410 transitions. [2022-11-25 22:35:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:35:21,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:21,512 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-25 22:35:21,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 22:35:21,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:35:21,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:21,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1068051727, now seen corresponding path program 2 times [2022-11-25 22:35:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:21,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172606435] [2022-11-25 22:35:21,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:35:21,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:21,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172606435] [2022-11-25 22:35:21,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172606435] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:35:21,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275941583] [2022-11-25 22:35:21,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:35:21,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:35:21,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:35:21,842 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:35:21,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 22:35:22,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 22:35:22,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:35:22,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:35:22,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:35:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:35:22,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:35:22,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275941583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:22,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 22:35:22,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-25 22:35:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466258977] [2022-11-25 22:35:22,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:22,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:35:22,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:22,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:35:22,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:35:22,151 INFO L87 Difference]: Start difference. First operand 45715 states and 94410 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:23,133 INFO L93 Difference]: Finished difference Result 45307 states and 93580 transitions. [2022-11-25 22:35:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:35:23,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 22:35:23,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:23,267 INFO L225 Difference]: With dead ends: 45307 [2022-11-25 22:35:23,267 INFO L226 Difference]: Without dead ends: 45307 [2022-11-25 22:35:23,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:35:23,269 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 881 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:23,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 572 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 22:35:23,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45307 states. [2022-11-25 22:35:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45307 to 45307. [2022-11-25 22:35:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45307 states, 43907 states have (on average 2.131323023663653) internal successors, (93580), 45306 states have internal predecessors, (93580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45307 states to 45307 states and 93580 transitions. [2022-11-25 22:35:24,660 INFO L78 Accepts]: Start accepts. Automaton has 45307 states and 93580 transitions. Word has length 9 [2022-11-25 22:35:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:24,661 INFO L495 AbstractCegarLoop]: Abstraction has 45307 states and 93580 transitions. [2022-11-25 22:35:24,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 45307 states and 93580 transitions. [2022-11-25 22:35:24,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 22:35:24,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:24,661 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:24,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:35:24,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:35:24,862 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:24,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:24,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1100684935, now seen corresponding path program 1 times [2022-11-25 22:35:24,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:24,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148758740] [2022-11-25 22:35:24,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:35:24,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:24,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148758740] [2022-11-25 22:35:24,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148758740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:24,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:24,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:35:24,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753493356] [2022-11-25 22:35:24,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:24,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:35:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:35:24,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:35:24,957 INFO L87 Difference]: Start difference. First operand 45307 states and 93580 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:25,703 INFO L93 Difference]: Finished difference Result 45105 states and 93369 transitions. [2022-11-25 22:35:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:35:25,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 22:35:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:25,826 INFO L225 Difference]: With dead ends: 45105 [2022-11-25 22:35:25,826 INFO L226 Difference]: Without dead ends: 45105 [2022-11-25 22:35:25,827 INFO L412 NwaCegarLoop]: 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 [2022-11-25 22:35:25,828 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 213 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:25,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 584 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:35:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45105 states. [2022-11-25 22:35:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45105 to 45105. [2022-11-25 22:35:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45105 states, 43739 states have (on average 2.1346852923020645) internal successors, (93369), 45104 states have internal predecessors, (93369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45105 states to 45105 states and 93369 transitions. [2022-11-25 22:35:27,106 INFO L78 Accepts]: Start accepts. Automaton has 45105 states and 93369 transitions. Word has length 10 [2022-11-25 22:35:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:27,107 INFO L495 AbstractCegarLoop]: Abstraction has 45105 states and 93369 transitions. [2022-11-25 22:35:27,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 45105 states and 93369 transitions. [2022-11-25 22:35:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 22:35:27,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:27,108 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:27,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 22:35:27,108 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:27,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:27,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2121179805, now seen corresponding path program 1 times [2022-11-25 22:35:27,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:27,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838088378] [2022-11-25 22:35:27,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:27,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:35:27,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:27,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838088378] [2022-11-25 22:35:27,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838088378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:27,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:27,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:35:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409233049] [2022-11-25 22:35:27,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:27,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:35:27,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:27,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:35:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:35:27,575 INFO L87 Difference]: Start difference. First operand 45105 states and 93369 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:30,974 INFO L93 Difference]: Finished difference Result 46361 states and 95929 transitions. [2022-11-25 22:35:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:35:30,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 22:35:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:31,075 INFO L225 Difference]: With dead ends: 46361 [2022-11-25 22:35:31,075 INFO L226 Difference]: Without dead ends: 46361 [2022-11-25 22:35:31,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:35:31,076 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 536 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:31,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 402 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-25 22:35:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46361 states. [2022-11-25 22:35:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46361 to 45939. [2022-11-25 22:35:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45939 states, 44574 states have (on average 2.132835285143806) internal successors, (95069), 45938 states have internal predecessors, (95069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45939 states to 45939 states and 95069 transitions. [2022-11-25 22:35:32,178 INFO L78 Accepts]: Start accepts. Automaton has 45939 states and 95069 transitions. Word has length 12 [2022-11-25 22:35:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:32,179 INFO L495 AbstractCegarLoop]: Abstraction has 45939 states and 95069 transitions. [2022-11-25 22:35:32,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 45939 states and 95069 transitions. [2022-11-25 22:35:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:35:32,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:32,181 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:32,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 22:35:32,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:32,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:32,182 INFO L85 PathProgramCache]: Analyzing trace with hash -865569314, now seen corresponding path program 1 times [2022-11-25 22:35:32,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:32,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623307625] [2022-11-25 22:35:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 22:35:32,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:32,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623307625] [2022-11-25 22:35:32,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623307625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:32,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:32,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:35:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808387581] [2022-11-25 22:35:32,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:32,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:35:32,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:32,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:35:32,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:35:32,595 INFO L87 Difference]: Start difference. First operand 45939 states and 95069 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:36,114 INFO L93 Difference]: Finished difference Result 47101 states and 97435 transitions. [2022-11-25 22:35:36,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:35:36,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have 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 [2022-11-25 22:35:36,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:36,241 INFO L225 Difference]: With dead ends: 47101 [2022-11-25 22:35:36,241 INFO L226 Difference]: Without dead ends: 47101 [2022-11-25 22:35:36,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:35:36,243 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 480 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2660 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 2660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:36,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 413 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 2660 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-25 22:35:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47101 states. [2022-11-25 22:35:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47101 to 46711. [2022-11-25 22:35:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46711 states, 45346 states have (on average 2.131191284788074) internal successors, (96641), 46710 states have internal predecessors, (96641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46711 states to 46711 states and 96641 transitions. [2022-11-25 22:35:37,143 INFO L78 Accepts]: Start accepts. Automaton has 46711 states and 96641 transitions. Word has length 13 [2022-11-25 22:35:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:37,144 INFO L495 AbstractCegarLoop]: Abstraction has 46711 states and 96641 transitions. [2022-11-25 22:35:37,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 46711 states and 96641 transitions. [2022-11-25 22:35:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 22:35:37,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:37,145 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:37,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 22:35:37,146 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:37,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash -191721250, now seen corresponding path program 1 times [2022-11-25 22:35:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:37,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749778809] [2022-11-25 22:35:37,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:37,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:35:37,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:37,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749778809] [2022-11-25 22:35:37,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749778809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:37,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:37,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:35:37,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361567024] [2022-11-25 22:35:37,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:37,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:35:37,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:37,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:35:37,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:35:37,272 INFO L87 Difference]: Start difference. First operand 46711 states and 96641 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:38,886 INFO L93 Difference]: Finished difference Result 46924 states and 97075 transitions. [2022-11-25 22:35:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:35:38,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 22:35:38,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:39,006 INFO L225 Difference]: With dead ends: 46924 [2022-11-25 22:35:39,006 INFO L226 Difference]: Without dead ends: 46924 [2022-11-25 22:35:39,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:35:39,007 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 132 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:39,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 327 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 22:35:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46924 states. [2022-11-25 22:35:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46924 to 46924. [2022-11-25 22:35:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46924 states, 45559 states have (on average 2.1307535283917556) internal successors, (97075), 46923 states have internal predecessors, (97075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46924 states to 46924 states and 97075 transitions. [2022-11-25 22:35:40,409 INFO L78 Accepts]: Start accepts. Automaton has 46924 states and 97075 transitions. Word has length 15 [2022-11-25 22:35:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:40,409 INFO L495 AbstractCegarLoop]: Abstraction has 46924 states and 97075 transitions. [2022-11-25 22:35:40,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 46924 states and 97075 transitions. [2022-11-25 22:35:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 22:35:40,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:40,424 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:40,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 22:35:40,425 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:40,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:40,425 INFO L85 PathProgramCache]: Analyzing trace with hash 840248528, now seen corresponding path program 1 times [2022-11-25 22:35:40,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:40,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219787972] [2022-11-25 22:35:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 22:35:40,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:40,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219787972] [2022-11-25 22:35:40,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219787972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:40,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:40,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:35:40,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053677022] [2022-11-25 22:35:40,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:40,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:35:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:40,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:35:40,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:35:40,594 INFO L87 Difference]: Start difference. First operand 46924 states and 97075 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:41,884 INFO L93 Difference]: Finished difference Result 47118 states and 97470 transitions. [2022-11-25 22:35:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:35:41,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 22:35:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:41,979 INFO L225 Difference]: With dead ends: 47118 [2022-11-25 22:35:41,979 INFO L226 Difference]: Without dead ends: 47118 [2022-11-25 22:35:41,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:35:41,979 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:41,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 323 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 22:35:42,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47118 states. [2022-11-25 22:35:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47118 to 47118. [2022-11-25 22:35:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47118 states, 45754 states have (on average 2.130305547055995) internal successors, (97470), 47117 states have internal predecessors, (97470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47118 states to 47118 states and 97470 transitions. [2022-11-25 22:35:42,963 INFO L78 Accepts]: Start accepts. Automaton has 47118 states and 97470 transitions. Word has length 16 [2022-11-25 22:35:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:42,963 INFO L495 AbstractCegarLoop]: Abstraction has 47118 states and 97470 transitions. [2022-11-25 22:35:42,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 47118 states and 97470 transitions. [2022-11-25 22:35:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 22:35:42,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:42,965 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:42,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 22:35:42,966 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:42,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:42,967 INFO L85 PathProgramCache]: Analyzing trace with hash 25922394, now seen corresponding path program 1 times [2022-11-25 22:35:42,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:42,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771361086] [2022-11-25 22:35:42,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:42,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:35:43,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:43,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771361086] [2022-11-25 22:35:43,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771361086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:43,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:43,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 22:35:43,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668250943] [2022-11-25 22:35:43,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:43,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 22:35:43,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:43,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 22:35:43,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:35:43,424 INFO L87 Difference]: Start difference. First operand 47118 states and 97470 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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) [2022-11-25 22:35:46,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:46,511 INFO L93 Difference]: Finished difference Result 47125 states and 97484 transitions. [2022-11-25 22:35:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:35:46,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 18 [2022-11-25 22:35:46,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:46,608 INFO L225 Difference]: With dead ends: 47125 [2022-11-25 22:35:46,608 INFO L226 Difference]: Without dead ends: 47125 [2022-11-25 22:35:46,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-25 22:35:46,609 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 2313 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2313 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:46,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2313 Valid, 744 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-25 22:35:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47125 states. [2022-11-25 22:35:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47125 to 47123. [2022-11-25 22:35:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47123 states, 45759 states have (on average 2.130291308813567) internal successors, (97480), 47122 states have internal predecessors, (97480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47123 states to 47123 states and 97480 transitions. [2022-11-25 22:35:47,806 INFO L78 Accepts]: Start accepts. Automaton has 47123 states and 97480 transitions. Word has length 18 [2022-11-25 22:35:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:47,806 INFO L495 AbstractCegarLoop]: Abstraction has 47123 states and 97480 transitions. [2022-11-25 22:35:47,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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) [2022-11-25 22:35:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 47123 states and 97480 transitions. [2022-11-25 22:35:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 22:35:47,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:47,808 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:47,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 22:35:47,809 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash 36589494, now seen corresponding path program 2 times [2022-11-25 22:35:47,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:47,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751675644] [2022-11-25 22:35:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:35:48,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:48,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751675644] [2022-11-25 22:35:48,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751675644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:48,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:48,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 22:35:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166177811] [2022-11-25 22:35:48,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:48,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 22:35:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:48,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 22:35:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:35:48,318 INFO L87 Difference]: Start difference. First operand 47123 states and 97480 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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) [2022-11-25 22:35:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:51,604 INFO L93 Difference]: Finished difference Result 47127 states and 97488 transitions. [2022-11-25 22:35:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:35:51,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 18 [2022-11-25 22:35:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:51,715 INFO L225 Difference]: With dead ends: 47127 [2022-11-25 22:35:51,715 INFO L226 Difference]: Without dead ends: 47127 [2022-11-25 22:35:51,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-11-25 22:35:51,716 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 2517 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2517 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:51,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2517 Valid, 1184 Invalid, 2700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2686 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-25 22:35:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47127 states. [2022-11-25 22:35:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47127 to 47102. [2022-11-25 22:35:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47102 states, 45739 states have (on average 2.1303045541004395) internal successors, (97438), 47101 states have internal predecessors, (97438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47102 states to 47102 states and 97438 transitions. [2022-11-25 22:35:52,765 INFO L78 Accepts]: Start accepts. Automaton has 47102 states and 97438 transitions. Word has length 18 [2022-11-25 22:35:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:52,766 INFO L495 AbstractCegarLoop]: Abstraction has 47102 states and 97438 transitions. [2022-11-25 22:35:52,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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) [2022-11-25 22:35:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 47102 states and 97438 transitions. [2022-11-25 22:35:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 22:35:52,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:52,767 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:52,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 22:35:52,767 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash -630003435, now seen corresponding path program 1 times [2022-11-25 22:35:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:52,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316432863] [2022-11-25 22:35:52,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 22:35:53,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:53,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316432863] [2022-11-25 22:35:53,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316432863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:53,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:53,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:35:53,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858731505] [2022-11-25 22:35:53,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:53,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:35:53,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:53,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:35:53,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:35:53,036 INFO L87 Difference]: Start difference. First operand 47102 states and 97438 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) 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) [2022-11-25 22:35:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:55,902 INFO L93 Difference]: Finished difference Result 47106 states and 97446 transitions. [2022-11-25 22:35:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:35:55,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) 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 18 [2022-11-25 22:35:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:55,993 INFO L225 Difference]: With dead ends: 47106 [2022-11-25 22:35:55,993 INFO L226 Difference]: Without dead ends: 47106 [2022-11-25 22:35:55,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:35:55,994 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 1656 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:55,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 739 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-25 22:35:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47106 states. [2022-11-25 22:35:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47106 to 47086. [2022-11-25 22:35:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47086 states, 45724 states have (on average 2.1303035604933953) internal successors, (97406), 47085 states have internal predecessors, (97406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47086 states to 47086 states and 97406 transitions. [2022-11-25 22:35:56,981 INFO L78 Accepts]: Start accepts. Automaton has 47086 states and 97406 transitions. Word has length 18 [2022-11-25 22:35:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:56,981 INFO L495 AbstractCegarLoop]: Abstraction has 47086 states and 97406 transitions. [2022-11-25 22:35:56,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) 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) [2022-11-25 22:35:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 47086 states and 97406 transitions. [2022-11-25 22:35:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 22:35:56,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:56,982 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:56,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 22:35:56,982 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting worker_fnErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:56,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash 762453373, now seen corresponding path program 1 times [2022-11-25 22:35:56,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:56,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141995056] [2022-11-25 22:35:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:56,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:35:57,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:57,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141995056] [2022-11-25 22:35:57,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141995056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:57,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:57,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:35:57,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816106385] [2022-11-25 22:35:57,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:57,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:35:57,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:57,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:35:57,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:35:57,087 INFO L87 Difference]: Start difference. First operand 47086 states and 97406 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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) [2022-11-25 22:35:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:58,324 INFO L93 Difference]: Finished difference Result 48121 states and 99516 transitions. [2022-11-25 22:35:58,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:35:58,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 18 [2022-11-25 22:35:58,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:58,420 INFO L225 Difference]: With dead ends: 48121 [2022-11-25 22:35:58,420 INFO L226 Difference]: Without dead ends: 48121 [2022-11-25 22:35:58,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:35:58,421 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 135 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:58,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 323 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 22:35:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48121 states. [2022-11-25 22:35:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48121 to 47279. [2022-11-25 22:35:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47279 states, 45919 states have (on average 2.129837322241338) internal successors, (97800), 47278 states have internal predecessors, (97800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47279 states to 47279 states and 97800 transitions. [2022-11-25 22:35:59,662 INFO L78 Accepts]: Start accepts. Automaton has 47279 states and 97800 transitions. Word has length 18 [2022-11-25 22:35:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:59,662 INFO L495 AbstractCegarLoop]: Abstraction has 47279 states and 97800 transitions. [2022-11-25 22:35:59,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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) [2022-11-25 22:35:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 47279 states and 97800 transitions. [2022-11-25 22:35:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 22:35:59,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:59,663 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:59,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 22:35:59,663 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:35:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash 803559570, now seen corresponding path program 1 times [2022-11-25 22:35:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:59,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160180561] [2022-11-25 22:35:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:59,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 22:35:59,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:59,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160180561] [2022-11-25 22:35:59,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160180561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:59,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:59,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:35:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213011692] [2022-11-25 22:35:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:59,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:35:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:59,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:35:59,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:35:59,794 INFO L87 Difference]: Start difference. First operand 47279 states and 97800 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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) [2022-11-25 22:36:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:01,188 INFO L93 Difference]: Finished difference Result 48228 states and 99733 transitions. [2022-11-25 22:36:01,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:36:01,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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 19 [2022-11-25 22:36:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:01,300 INFO L225 Difference]: With dead ends: 48228 [2022-11-25 22:36:01,301 INFO L226 Difference]: Without dead ends: 48228 [2022-11-25 22:36:01,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:36:01,301 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 123 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:01,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 320 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 22:36:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48228 states. [2022-11-25 22:36:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48228 to 47454. [2022-11-25 22:36:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47454 states, 46097 states have (on average 2.1293576588498166) internal successors, (98157), 47453 states have internal predecessors, (98157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:36:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47454 states to 47454 states and 98157 transitions. [2022-11-25 22:36:02,450 INFO L78 Accepts]: Start accepts. Automaton has 47454 states and 98157 transitions. Word has length 19 [2022-11-25 22:36:02,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:02,451 INFO L495 AbstractCegarLoop]: Abstraction has 47454 states and 98157 transitions. [2022-11-25 22:36:02,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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) [2022-11-25 22:36:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 47454 states and 98157 transitions. [2022-11-25 22:36:02,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 22:36:02,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:02,452 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:02,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 22:36:02,452 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:36:02,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:02,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1244141987, now seen corresponding path program 1 times [2022-11-25 22:36:02,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:02,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755918303] [2022-11-25 22:36:02,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:36:03,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:03,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755918303] [2022-11-25 22:36:03,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755918303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:36:03,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505128842] [2022-11-25 22:36:03,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:03,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:36:03,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:36:03,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:36:03,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 22:36:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:03,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 22:36:03,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:03,627 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:36:03,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:36:03,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:36:03,779 INFO L350 Elim1Store]: Elim1 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 22 [2022-11-25 22:36:03,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:03,827 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:36:03,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:03,882 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 46 [2022-11-25 22:36:03,946 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 39 [2022-11-25 22:36:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:36:03,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:36:04,030 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1639) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1639) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1639) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1639) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-11-25 22:36:04,262 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (and (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1639) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1639) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1639) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0))))) is different from false [2022-11-25 22:36:04,300 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse1 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0) .cse1 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (and (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1639) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1639) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1639) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0))))) is different from false [2022-11-25 22:36:04,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:04,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2022-11-25 22:36:04,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:04,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2022-11-25 22:36:04,352 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-25 22:36:04,353 INFO L350 Elim1Store]: Elim1 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 4 case distinctions, treesize of input 37 treesize of output 1 [2022-11-25 22:36:04,364 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-25 22:36:04,364 INFO L350 Elim1Store]: Elim1 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 4 case distinctions, treesize of input 37 treesize of output 1 [2022-11-25 22:36:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:36:04,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505128842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:36:04,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [617038462] [2022-11-25 22:36:04,391 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-25 22:36:04,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:36:04,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-11-25 22:36:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634537767] [2022-11-25 22:36:04,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:36:04,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 22:36:04,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:04,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 22:36:04,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=285, Unknown=16, NotChecked=114, Total=506 [2022-11-25 22:36:04,399 INFO L87 Difference]: Start difference. First operand 47454 states and 98157 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:36:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:14,932 INFO L93 Difference]: Finished difference Result 60333 states and 124649 transitions. [2022-11-25 22:36:14,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 22:36:14,933 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 22:36:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:15,055 INFO L225 Difference]: With dead ends: 60333 [2022-11-25 22:36:15,055 INFO L226 Difference]: Without dead ends: 60333 [2022-11-25 22:36:15,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=312, Invalid=734, Unknown=22, NotChecked=192, Total=1260 [2022-11-25 22:36:15,057 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 5481 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 5759 mSolverCounterSat, 1006 mSolverCounterUnsat, 262 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5481 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 11258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1006 IncrementalHoareTripleChecker+Valid, 5759 IncrementalHoareTripleChecker+Invalid, 262 IncrementalHoareTripleChecker+Unknown, 4231 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:15,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5481 Valid, 951 Invalid, 11258 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1006 Valid, 5759 Invalid, 262 Unknown, 4231 Unchecked, 9.4s Time] [2022-11-25 22:36:15,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60333 states. [2022-11-25 22:36:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60333 to 47459. [2022-11-25 22:36:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47459 states, 46102 states have (on average 2.1296689948375342) internal successors, (98182), 47458 states have internal predecessors, (98182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:36:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47459 states to 47459 states and 98182 transitions. [2022-11-25 22:36:15,937 INFO L78 Accepts]: Start accepts. Automaton has 47459 states and 98182 transitions. Word has length 21 [2022-11-25 22:36:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:15,938 INFO L495 AbstractCegarLoop]: Abstraction has 47459 states and 98182 transitions. [2022-11-25 22:36:15,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:36:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 47459 states and 98182 transitions. [2022-11-25 22:36:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 22:36:15,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:15,939 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:15,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:16,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 22:36:16,140 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:36:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash -337992205, now seen corresponding path program 2 times [2022-11-25 22:36:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:16,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067808437] [2022-11-25 22:36:16,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:36:16,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:16,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067808437] [2022-11-25 22:36:16,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067808437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:36:16,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470332312] [2022-11-25 22:36:16,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:36:16,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:36:16,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:36:16,735 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:36:16,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 22:36:17,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 22:36:17,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:36:17,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 22:36:17,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:17,487 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:36:17,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:36:17,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:36:17,636 INFO L350 Elim1Store]: Elim1 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 22 [2022-11-25 22:36:17,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:17,679 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:36:17,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:17,728 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 46 [2022-11-25 22:36:17,797 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 39 [2022-11-25 22:36:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:36:17,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:17,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470332312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:17,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 22:36:17,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 18 [2022-11-25 22:36:17,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190472691] [2022-11-25 22:36:17,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:17,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 22:36:17,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:17,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 22:36:17,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-11-25 22:36:17,833 INFO L87 Difference]: Start difference. First operand 47459 states and 98182 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:36:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:23,277 INFO L93 Difference]: Finished difference Result 54537 states and 112802 transitions. [2022-11-25 22:36:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 22:36:23,277 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 22:36:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:23,392 INFO L225 Difference]: With dead ends: 54537 [2022-11-25 22:36:23,392 INFO L226 Difference]: Without dead ends: 54537 [2022-11-25 22:36:23,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2022-11-25 22:36:23,393 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 2187 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 3893 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 4477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 3893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:23,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2187 Valid, 958 Invalid, 4477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 3893 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-25 22:36:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54537 states. [2022-11-25 22:36:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54537 to 47264. [2022-11-25 22:36:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47264 states, 45912 states have (on average 2.129552186792124) internal successors, (97772), 47263 states have internal predecessors, (97772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:36:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47264 states to 47264 states and 97772 transitions. [2022-11-25 22:36:24,388 INFO L78 Accepts]: Start accepts. Automaton has 47264 states and 97772 transitions. Word has length 21 [2022-11-25 22:36:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:24,388 INFO L495 AbstractCegarLoop]: Abstraction has 47264 states and 97772 transitions. [2022-11-25 22:36:24,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:36:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 47264 states and 97772 transitions. [2022-11-25 22:36:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 22:36:24,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:24,390 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:24,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:24,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 22:36:24,591 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:36:24,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash 443545191, now seen corresponding path program 1 times [2022-11-25 22:36:24,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:24,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440003407] [2022-11-25 22:36:24,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:24,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:36:26,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:26,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440003407] [2022-11-25 22:36:26,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440003407] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:36:26,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951140170] [2022-11-25 22:36:26,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:26,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:36:26,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:36:26,507 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:36:26,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 22:36:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:26,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-25 22:36:26,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:26,844 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:36:26,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-25 22:36:26,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:36:27,044 INFO L350 Elim1Store]: Elim1 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 22 [2022-11-25 22:36:27,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:36:27,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:36:27,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-11-25 22:36:27,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-11-25 22:36:27,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-11-25 22:36:27,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:27,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-11-25 22:36:33,635 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 46 [2022-11-25 22:36:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:36:39,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:36:39,743 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2121 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2121) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_2121 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2121) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_2121 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2121) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_2121 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2121) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0))) is different from false [2022-11-25 22:37:24,054 WARN L233 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 59 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:37:24,497 INFO L321 Elim1Store]: treesize reduction 590, result has 26.3 percent of original size [2022-11-25 22:37:24,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 223 [2022-11-25 22:37:24,520 INFO L321 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-11-25 22:37:24,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 206 treesize of output 170 [2022-11-25 22:37:24,612 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-25 22:37:24,697 INFO L321 Elim1Store]: treesize reduction 800, result has 0.1 percent of original size [2022-11-25 22:37:24,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2022-11-25 22:37:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:37:26,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951140170] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:37:26,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [89375414] [2022-11-25 22:37:26,287 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-25 22:37:26,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:37:26,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 36 [2022-11-25 22:37:26,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140221660] [2022-11-25 22:37:26,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:37:26,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 22:37:26,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:37:26,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 22:37:26,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1090, Unknown=55, NotChecked=70, Total=1406 [2022-11-25 22:37:26,291 INFO L87 Difference]: Start difference. First operand 47264 states and 97772 transitions. Second operand has 38 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 37 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:37:28,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:37:30,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:37:33,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:37:36,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:37:48,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:37:51,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:04,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:07,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:10,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:12,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:14,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:18,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:20,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:22,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:25,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:28,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:30,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:42,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:44,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:48,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:50,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:52,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:54,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:56,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:38:58,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:01,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:03,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:05,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:07,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:09,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:13,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:15,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:17,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:19,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:22,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:27,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:29,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:31,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:33,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:35,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:37,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:40,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:42,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:44,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:47,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:49,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:51,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:54,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:39:59,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:01,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:04,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:06,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:08,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:11,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:13,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:15,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:18,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:23,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:25,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:29,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:31,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:33,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:36,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:38,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:44,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:46,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:51,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:56,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:58,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:01,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:07,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:09,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:13,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:22,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:24,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:26,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:30,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:40,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:42,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:47,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:49,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:52,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:54,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:59,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:01,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:03,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:05,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:07,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:12,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:18,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:20,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:23,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:25,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:28,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:31,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:33,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:35,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:41,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:43,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:46,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:52,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:54,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:42:57,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:03,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:05,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:09,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:15,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:18,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:25,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:27,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:30,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:36,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:38,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:41,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:50,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:53,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:55,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:58,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:06,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:08,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:12,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:15,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:17,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:22,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:24,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:26,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:37,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:39,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:43,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:45,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:48,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:50,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:52,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:54,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:44:56,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:45:00,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:45:02,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:45:05,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:45:07,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:45:09,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:45:12,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:45:14,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:45:16,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:45:19,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:45:21,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:45:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:21,549 INFO L93 Difference]: Finished difference Result 56010 states and 115776 transitions. [2022-11-25 22:45:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 22:45:21,549 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 37 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 22:45:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:21,663 INFO L225 Difference]: With dead ends: 56010 [2022-11-25 22:45:21,663 INFO L226 Difference]: Without dead ends: 56010 [2022-11-25 22:45:21,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 82.1s TimeCoverageRelationStatistics Valid=445, Invalid=1659, Unknown=62, NotChecked=90, Total=2256 [2022-11-25 22:45:21,664 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 5188 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 17608 mSolverCounterSat, 872 mSolverCounterUnsat, 148 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 444.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5188 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 19640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 872 IncrementalHoareTripleChecker+Valid, 17608 IncrementalHoareTripleChecker+Invalid, 148 IncrementalHoareTripleChecker+Unknown, 1012 IncrementalHoareTripleChecker+Unchecked, 450.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:21,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5188 Valid, 1987 Invalid, 19640 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [872 Valid, 17608 Invalid, 148 Unknown, 1012 Unchecked, 450.2s Time] [2022-11-25 22:45:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56010 states. [2022-11-25 22:45:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56010 to 47074. [2022-11-25 22:45:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47074 states, 45727 states have (on average 2.1297482887571895) internal successors, (97387), 47073 states have internal predecessors, (97387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47074 states to 47074 states and 97387 transitions. [2022-11-25 22:45:22,443 INFO L78 Accepts]: Start accepts. Automaton has 47074 states and 97387 transitions. Word has length 21 [2022-11-25 22:45:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:22,444 INFO L495 AbstractCegarLoop]: Abstraction has 47074 states and 97387 transitions. [2022-11-25 22:45:22,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 37 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 47074 states and 97387 transitions. [2022-11-25 22:45:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 22:45:22,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:22,445 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:45:22,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:22,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fab0d63-8f19-4436-a405-0df40112155d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 22:45:22,647 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting worker_fnErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:45:22,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:22,647 INFO L85 PathProgramCache]: Analyzing trace with hash -916334540, now seen corresponding path program 1 times [2022-11-25 22:45:22,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:45:22,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26439504] [2022-11-25 22:45:22,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:22,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:45:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:45:22,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:45:22,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26439504] [2022-11-25 22:45:22,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26439504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:45:22,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:45:22,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:45:22,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546686191] [2022-11-25 22:45:22,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:45:22,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:45:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:45:22,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:45:22,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:45:22,738 INFO L87 Difference]: Start difference. First operand 47074 states and 97387 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:23,763 INFO L93 Difference]: Finished difference Result 49045 states and 101401 transitions. [2022-11-25 22:45:23,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:45:23,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 22:45:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:23,868 INFO L225 Difference]: With dead ends: 49045 [2022-11-25 22:45:23,868 INFO L226 Difference]: Without dead ends: 49045 [2022-11-25 22:45:23,869 INFO L412 NwaCegarLoop]: 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 [2022-11-25 22:45:23,869 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 235 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:23,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 725 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 22:45:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49045 states. [2022-11-25 22:45:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49045 to 47296. [2022-11-25 22:45:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47296 states, 45949 states have (on average 2.129295523297569) internal successors, (97839), 47295 states have internal predecessors, (97839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47296 states to 47296 states and 97839 transitions. [2022-11-25 22:45:24,627 INFO L78 Accepts]: Start accepts. Automaton has 47296 states and 97839 transitions. Word has length 21 [2022-11-25 22:45:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:24,627 INFO L495 AbstractCegarLoop]: Abstraction has 47296 states and 97839 transitions. [2022-11-25 22:45:24,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 47296 states and 97839 transitions. [2022-11-25 22:45:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 22:45:24,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:24,628 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:45:24,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 22:45:24,629 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting worker_fnErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:45:24,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1811724925, now seen corresponding path program 1 times [2022-11-25 22:45:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:45:24,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296308287] [2022-11-25 22:45:24,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:24,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:45:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:45:24,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:45:24,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296308287] [2022-11-25 22:45:24,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296308287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:45:24,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:45:24,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:45:24,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602377604] [2022-11-25 22:45:24,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:45:24,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:45:24,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:45:24,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:45:24,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:45:24,752 INFO L87 Difference]: Start difference. First operand 47296 states and 97839 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:26,313 INFO L93 Difference]: Finished difference Result 47491 states and 98237 transitions. [2022-11-25 22:45:26,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:45:26,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 22:45:26,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:26,405 INFO L225 Difference]: With dead ends: 47491 [2022-11-25 22:45:26,405 INFO L226 Difference]: Without dead ends: 47491 [2022-11-25 22:45:26,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:45:26,406 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 131 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:26,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 325 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-25 22:45:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47491 states. [2022-11-25 22:45:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47491 to 47491. [2022-11-25 22:45:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47491 states, 46146 states have (on average 2.128830234473194) internal successors, (98237), 47490 states have internal predecessors, (98237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47491 states to 47491 states and 98237 transitions. [2022-11-25 22:45:27,379 INFO L78 Accepts]: Start accepts. Automaton has 47491 states and 98237 transitions. Word has length 21 [2022-11-25 22:45:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:27,379 INFO L495 AbstractCegarLoop]: Abstraction has 47491 states and 98237 transitions. [2022-11-25 22:45:27,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 47491 states and 98237 transitions. [2022-11-25 22:45:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 22:45:27,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:27,380 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:45:27,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 22:45:27,381 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:45:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1301859917, now seen corresponding path program 1 times [2022-11-25 22:45:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:45:27,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001315985] [2022-11-25 22:45:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:45:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 22:45:27,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:45:27,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001315985] [2022-11-25 22:45:27,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001315985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:45:27,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:45:27,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:45:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952336821] [2022-11-25 22:45:27,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:45:27,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:45:27,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:45:27,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:45:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:45:27,504 INFO L87 Difference]: Start difference. First operand 47491 states and 98237 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:29,259 INFO L93 Difference]: Finished difference Result 47669 states and 98600 transitions. [2022-11-25 22:45:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:45:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 22:45:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:29,353 INFO L225 Difference]: With dead ends: 47669 [2022-11-25 22:45:29,353 INFO L226 Difference]: Without dead ends: 47669 [2022-11-25 22:45:29,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:45:29,354 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 119 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:29,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 322 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 22:45:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47669 states. [2022-11-25 22:45:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47669 to 47669. [2022-11-25 22:45:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47669 states, 46327 states have (on average 2.128348479288536) internal successors, (98600), 47668 states have internal predecessors, (98600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47669 states to 47669 states and 98600 transitions. [2022-11-25 22:45:30,200 INFO L78 Accepts]: Start accepts. Automaton has 47669 states and 98600 transitions. Word has length 22 [2022-11-25 22:45:30,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:30,201 INFO L495 AbstractCegarLoop]: Abstraction has 47669 states and 98600 transitions. [2022-11-25 22:45:30,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 47669 states and 98600 transitions. [2022-11-25 22:45:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 22:45:30,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:30,202 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:45:30,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 22:45:30,202 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-25 22:45:30,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:30,203 INFO L85 PathProgramCache]: Analyzing trace with hash -328729529, now seen corresponding path program 1 times [2022-11-25 22:45:30,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:45:30,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865981905] [2022-11-25 22:45:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:30,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:45:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 22:45:30,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:45:30,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865981905] [2022-11-25 22:45:30,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865981905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:45:30,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:45:30,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:45:30,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652831171] [2022-11-25 22:45:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:45:30,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:45:30,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:45:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:45:30,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:45:30,305 INFO L87 Difference]: Start difference. First operand 47669 states and 98600 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:45:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:31,307 INFO L93 Difference]: Finished difference Result 49681 states and 102694 transitions. [2022-11-25 22:45:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:45:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 22:45:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:31,431 INFO L225 Difference]: With dead ends: 49681 [2022-11-25 22:45:31,431 INFO L226 Difference]: Without dead ends: 49681 [2022-11-25 22:45:31,431 INFO L412 NwaCegarLoop]: 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 [2022-11-25 22:45:31,432 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 217 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:31,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 713 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 22:45:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49681 states.