./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb --- 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-2329fc7 [2022-12-13 20:16:40,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:16:40,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:16:40,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:16:40,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:16:40,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:16:40,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:16:40,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:16:40,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:16:40,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:16:40,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:16:40,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:16:40,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:16:40,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:16:40,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:16:40,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:16:40,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:16:40,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:16:40,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:16:40,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:16:40,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:16:40,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:16:40,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:16:40,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:16:40,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:16:40,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:16:40,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:16:40,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:16:40,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:16:40,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:16:40,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:16:40,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:16:40,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:16:40,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:16:40,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:16:40,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:16:40,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:16:40,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:16:40,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:16:40,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:16:40,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:16:40,922 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-12-13 20:16:40,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:16:40,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:16:40,943 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:16:40,944 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:16:40,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:16:40,944 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:16:40,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:16:40,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:16:40,945 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:16:40,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:16:40,946 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:16:40,946 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:16:40,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:16:40,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:16:40,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:16:40,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:16:40,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:16:40,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:16:40,947 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-13 20:16:40,947 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:16:40,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:16:40,947 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:16:40,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:16:40,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:16:40,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:16:40,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:16:40,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:16:40,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:16:40,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:16:40,949 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:16:40,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:16:40,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:16:40,949 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:16:40,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:16:40,950 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:16:40,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:16:40,950 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:16:40,950 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8 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 -> Automizer 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 -> 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb [2022-12-13 20:16:41,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:16:41,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:16:41,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:16:41,153 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:16:41,153 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:16:41,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-12-13 20:16:43,826 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:16:44,020 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:16:44,021 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-12-13 20:16:44,030 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/data/936d27a4e/d87bad65ac674a76a7b58f6e55782b1a/FLAG91c1cc5c1 [2022-12-13 20:16:44,040 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/data/936d27a4e/d87bad65ac674a76a7b58f6e55782b1a [2022-12-13 20:16:44,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:16:44,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:16:44,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:16:44,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:16:44,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:16:44,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b446cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44, skipping insertion in model container [2022-12-13 20:16:44,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:16:44,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:16:44,225 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 20:16:44,379 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-12-13 20:16:44,391 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-12-13 20:16:44,406 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-12-13 20:16:44,407 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-12-13 20:16:44,409 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-12-13 20:16:44,410 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-12-13 20:16:44,411 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-12-13 20:16:44,413 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-12-13 20:16:44,415 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-12-13 20:16:44,415 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-12-13 20:16:44,416 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-12-13 20:16:44,418 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-12-13 20:16:44,426 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-12-13 20:16:44,427 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-12-13 20:16:44,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:16:44,439 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:16:44,450 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 20:16:44,470 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-12-13 20:16:44,474 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-12-13 20:16:44,481 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-12-13 20:16:44,482 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-12-13 20:16:44,484 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-12-13 20:16:44,485 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-12-13 20:16:44,486 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-12-13 20:16:44,488 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-12-13 20:16:44,489 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-12-13 20:16:44,490 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-12-13 20:16:44,491 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-12-13 20:16:44,492 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-12-13 20:16:44,500 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-12-13 20:16:44,501 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_97f73f79-704c-4722-ad8c-502fc1cd6d8a/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-12-13 20:16:44,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:16:44,544 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:16:44,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44 WrapperNode [2022-12-13 20:16:44,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:16:44,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:16:44,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:16:44,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:16:44,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,615 INFO L138 Inliner]: procedures = 174, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 805 [2022-12-13 20:16:44,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:16:44,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:16:44,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:16:44,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:16:44,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,702 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:16:44,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:16:44,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:16:44,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:16:44,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (1/1) ... [2022-12-13 20:16:44,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:16:44,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:16:44,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:16:44,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:16:44,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:16:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:16:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 20:16:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-12-13 20:16:44,777 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-12-13 20:16:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:16:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 20:16:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:16:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 20:16:44,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:16:44,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:16:44,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:16:44,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:16:44,779 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 20:16:44,905 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:16:44,907 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:16:45,771 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:16:45,781 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:16:45,781 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-12-13 20:16:45,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:16:45 BoogieIcfgContainer [2022-12-13 20:16:45,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:16:45,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:16:45,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:16:45,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:16:45,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:16:44" (1/3) ... [2022-12-13 20:16:45,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be18134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:16:45, skipping insertion in model container [2022-12-13 20:16:45,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:16:44" (2/3) ... [2022-12-13 20:16:45,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be18134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:16:45, skipping insertion in model container [2022-12-13 20:16:45,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:16:45" (3/3) ... [2022-12-13 20:16:45,790 INFO L112 eAbstractionObserver]: Analyzing ICFG one_time_barrier_twice_2t.i [2022-12-13 20:16:45,796 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 20:16:45,804 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:16:45,804 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2022-12-13 20:16:45,804 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 20:16:45,917 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-13 20:16:45,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 868 places, 928 transitions, 1864 flow [2022-12-13 20:16:46,489 INFO L130 PetriNetUnfolder]: 95/1352 cut-off events. [2022-12-13 20:16:46,490 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 20:16:46,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 1352 events. 95/1352 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4538 event pairs, 0 based on Foata normal form. 0/1139 useless extension candidates. Maximal degree in co-relation 794. Up to 4 conditions per place. [2022-12-13 20:16:46,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 868 places, 928 transitions, 1864 flow [2022-12-13 20:16:46,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 868 places, 928 transitions, 1864 flow [2022-12-13 20:16:46,558 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 20:16:46,568 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 868 places, 928 transitions, 1864 flow [2022-12-13 20:16:46,570 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 868 places, 928 transitions, 1864 flow [2022-12-13 20:16:46,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 868 places, 928 transitions, 1864 flow [2022-12-13 20:16:46,938 INFO L130 PetriNetUnfolder]: 95/1352 cut-off events. [2022-12-13 20:16:46,938 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 20:16:46,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 1352 events. 95/1352 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4538 event pairs, 0 based on Foata normal form. 0/1139 useless extension candidates. Maximal degree in co-relation 794. Up to 4 conditions per place. [2022-12-13 20:16:47,006 INFO L119 LiptonReduction]: Number of co-enabled transitions 313900 [2022-12-13 20:17:17,901 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 111 DAG size of output: 109 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:17:25,493 WARN L233 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 115 DAG size of output: 107 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:17:34,009 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 115 DAG size of output: 107 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:17:52,932 WARN L233 SmtUtils]: Spent 17.00s on a formula simplification. DAG size of input: 138 DAG size of output: 136 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:18:18,385 WARN L233 SmtUtils]: Spent 21.67s on a formula simplification. DAG size of input: 150 DAG size of output: 146 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:19:24,238 WARN L233 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 179 DAG size of output: 175 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:19:43,926 WARN L233 SmtUtils]: Spent 19.69s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:21:02,105 WARN L233 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 188 DAG size of output: 184 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:21:27,211 WARN L233 SmtUtils]: Spent 25.10s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 20:21:27,236 INFO L134 LiptonReduction]: Checked pairs total: 2029241 [2022-12-13 20:21:27,236 INFO L136 LiptonReduction]: Total number of compositions: 590 [2022-12-13 20:21:27,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:21:27,249 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=PETRI_NET, 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;@5e5c3fd0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:21:27,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 113 error locations. [2022-12-13 20:21:27,251 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2022-12-13 20:21:27,251 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:21:27,252 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:21:27,252 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 20:21:27,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:21:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash 99434, now seen corresponding path program 1 times [2022-12-13 20:21:27,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:27,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378352881] [2022-12-13 20:21:27,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:27,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:27,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:27,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378352881] [2022-12-13 20:21:27,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378352881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:27,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:27,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:21:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788172099] [2022-12-13 20:21:27,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:27,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 20:21:27,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:27,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 20:21:27,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 20:21:27,412 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 882 out of 1518 [2022-12-13 20:21:27,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 488 transitions, 984 flow. Second operand has 2 states, 2 states have (on average 883.0) internal successors, (1766), 2 states have internal predecessors, (1766), 0 states have call successors, (0), 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-12-13 20:21:27,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:21:27,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 882 of 1518 [2022-12-13 20:21:27,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:21:30,723 INFO L130 PetriNetUnfolder]: 5723/20252 cut-off events. [2022-12-13 20:21:30,724 INFO L131 PetriNetUnfolder]: For 3/5 co-relation queries the response was YES. [2022-12-13 20:21:30,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30742 conditions, 20252 events. 5723/20252 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 199087 event pairs, 4550 based on Foata normal form. 1170/18972 useless extension candidates. Maximal degree in co-relation 30408. Up to 10482 conditions per place. [2022-12-13 20:21:30,800 INFO L137 encePairwiseOnDemand]: 1491/1518 looper letters, 158 selfloop transitions, 0 changer transitions 0/455 dead transitions. [2022-12-13 20:21:30,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 455 transitions, 1234 flow [2022-12-13 20:21:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 20:21:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 20:21:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1949 transitions. [2022-12-13 20:21:30,818 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6419631093544137 [2022-12-13 20:21:30,819 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1949 transitions. [2022-12-13 20:21:30,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1949 transitions. [2022-12-13 20:21:30,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:21:30,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1949 transitions. [2022-12-13 20:21:30,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 974.5) internal successors, (1949), 2 states have internal predecessors, (1949), 0 states have call successors, (0), 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-12-13 20:21:30,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 1518.0) internal successors, (4554), 3 states have internal predecessors, (4554), 0 states have call successors, (0), 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-12-13 20:21:30,845 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 1518.0) internal successors, (4554), 3 states have internal predecessors, (4554), 0 states have call successors, (0), 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-12-13 20:21:30,847 INFO L175 Difference]: Start difference. First operand has 452 places, 488 transitions, 984 flow. Second operand 2 states and 1949 transitions. [2022-12-13 20:21:30,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 455 transitions, 1234 flow [2022-12-13 20:21:30,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 455 transitions, 1234 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:21:30,860 INFO L231 Difference]: Finished difference. Result has 440 places, 455 transitions, 918 flow [2022-12-13 20:21:30,863 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=918, PETRI_PLACES=440, PETRI_TRANSITIONS=455} [2022-12-13 20:21:30,866 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, -12 predicate places. [2022-12-13 20:21:30,866 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 455 transitions, 918 flow [2022-12-13 20:21:30,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 883.0) internal successors, (1766), 2 states have internal predecessors, (1766), 0 states have call successors, (0), 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-12-13 20:21:30,867 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:21:30,868 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2022-12-13 20:21:30,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:21:30,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:21:30,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1442309663, now seen corresponding path program 1 times [2022-12-13 20:21:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:30,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688215070] [2022-12-13 20:21:30,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:30,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:21:31,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:31,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688215070] [2022-12-13 20:21:31,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688215070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:31,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:31,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:21:31,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555928677] [2022-12-13 20:21:31,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:31,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:31,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:31,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:31,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:31,099 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 878 out of 1518 [2022-12-13 20:21:31,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 455 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 879.6666666666666) internal successors, (2639), 3 states have internal predecessors, (2639), 0 states have call successors, (0), 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-12-13 20:21:31,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:21:31,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 878 of 1518 [2022-12-13 20:21:31,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:21:34,507 INFO L130 PetriNetUnfolder]: 5723/20253 cut-off events. [2022-12-13 20:21:34,507 INFO L131 PetriNetUnfolder]: For 3/5 co-relation queries the response was YES. [2022-12-13 20:21:34,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30745 conditions, 20253 events. 5723/20253 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 198937 event pairs, 4550 based on Foata normal form. 0/17803 useless extension candidates. Maximal degree in co-relation 30741. Up to 10482 conditions per place. [2022-12-13 20:21:34,575 INFO L137 encePairwiseOnDemand]: 1515/1518 looper letters, 157 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2022-12-13 20:21:34,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 456 transitions, 1238 flow [2022-12-13 20:21:34,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:21:34,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2794 transitions. [2022-12-13 20:21:34,581 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6135265700483091 [2022-12-13 20:21:34,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2794 transitions. [2022-12-13 20:21:34,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2794 transitions. [2022-12-13 20:21:34,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:21:34,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2794 transitions. [2022-12-13 20:21:34,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 931.3333333333334) internal successors, (2794), 3 states have internal predecessors, (2794), 0 states have call successors, (0), 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-12-13 20:21:34,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:21:34,595 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:21:34,596 INFO L175 Difference]: Start difference. First operand has 440 places, 455 transitions, 918 flow. Second operand 3 states and 2794 transitions. [2022-12-13 20:21:34,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 456 transitions, 1238 flow [2022-12-13 20:21:34,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 456 transitions, 1238 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:21:34,603 INFO L231 Difference]: Finished difference. Result has 443 places, 456 transitions, 930 flow [2022-12-13 20:21:34,604 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=443, PETRI_TRANSITIONS=456} [2022-12-13 20:21:34,605 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, -9 predicate places. [2022-12-13 20:21:34,605 INFO L495 AbstractCegarLoop]: Abstraction has has 443 places, 456 transitions, 930 flow [2022-12-13 20:21:34,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 879.6666666666666) internal successors, (2639), 3 states have internal predecessors, (2639), 0 states have call successors, (0), 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-12-13 20:21:34,606 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:21:34,606 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-13 20:21:34,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:21:34,606 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:21:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:34,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1920962304, now seen corresponding path program 1 times [2022-12-13 20:21:34,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:34,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766579271] [2022-12-13 20:21:34,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:34,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:21:34,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:34,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766579271] [2022-12-13 20:21:34,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766579271] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:21:34,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634429911] [2022-12-13 20:21:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:34,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:21:34,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:21:34,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:21:34,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:21:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:34,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:21:34,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:21:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:21:34,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:21:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:21:34,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634429911] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:21:34,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:21:34,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-13 20:21:34,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60074159] [2022-12-13 20:21:34,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:21:34,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:21:34,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:34,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:21:34,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:21:35,026 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 877 out of 1518 [2022-12-13 20:21:35,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 456 transitions, 930 flow. Second operand has 5 states, 5 states have (on average 878.6) internal successors, (4393), 5 states have internal predecessors, (4393), 0 states have call successors, (0), 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-12-13 20:21:35,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:21:35,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 877 of 1518 [2022-12-13 20:21:35,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:21:39,698 INFO L130 PetriNetUnfolder]: 5723/20254 cut-off events. [2022-12-13 20:21:39,698 INFO L131 PetriNetUnfolder]: For 3/5 co-relation queries the response was YES. [2022-12-13 20:21:39,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30755 conditions, 20254 events. 5723/20254 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 199015 event pairs, 4550 based on Foata normal form. 0/17804 useless extension candidates. Maximal degree in co-relation 30749. Up to 10482 conditions per place. [2022-12-13 20:21:39,749 INFO L137 encePairwiseOnDemand]: 1515/1518 looper letters, 157 selfloop transitions, 3 changer transitions 0/457 dead transitions. [2022-12-13 20:21:39,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 457 transitions, 1254 flow [2022-12-13 20:21:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:21:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:21:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3669 transitions. [2022-12-13 20:21:39,754 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6042490118577075 [2022-12-13 20:21:39,755 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3669 transitions. [2022-12-13 20:21:39,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3669 transitions. [2022-12-13 20:21:39,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:21:39,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3669 transitions. [2022-12-13 20:21:39,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 917.25) internal successors, (3669), 4 states have internal predecessors, (3669), 0 states have call successors, (0), 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-12-13 20:21:39,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1518.0) internal successors, (7590), 5 states have internal predecessors, (7590), 0 states have call successors, (0), 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-12-13 20:21:39,769 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1518.0) internal successors, (7590), 5 states have internal predecessors, (7590), 0 states have call successors, (0), 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-12-13 20:21:39,769 INFO L175 Difference]: Start difference. First operand has 443 places, 456 transitions, 930 flow. Second operand 4 states and 3669 transitions. [2022-12-13 20:21:39,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 457 transitions, 1254 flow [2022-12-13 20:21:39,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 457 transitions, 1250 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 20:21:39,775 INFO L231 Difference]: Finished difference. Result has 446 places, 457 transitions, 942 flow [2022-12-13 20:21:39,775 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=942, PETRI_PLACES=446, PETRI_TRANSITIONS=457} [2022-12-13 20:21:39,776 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, -6 predicate places. [2022-12-13 20:21:39,776 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 457 transitions, 942 flow [2022-12-13 20:21:39,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 878.6) internal successors, (4393), 5 states have internal predecessors, (4393), 0 states have call successors, (0), 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-12-13 20:21:39,777 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:21:39,778 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-12-13 20:21:39,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:21:39,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:21:39,980 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:21:39,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:39,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1191789119, now seen corresponding path program 2 times [2022-12-13 20:21:39,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:39,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759531619] [2022-12-13 20:21:39,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:39,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:21:40,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:40,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759531619] [2022-12-13 20:21:40,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759531619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:21:40,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254307543] [2022-12-13 20:21:40,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:21:40,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:21:40,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:21:40,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:21:40,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:21:40,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:21:40,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:21:40,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:21:40,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:21:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:21:40,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:21:40,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254307543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:40,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:21:40,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 20:21:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149657222] [2022-12-13 20:21:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:40,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:21:40,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:40,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:21:40,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:21:40,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 877 out of 1518 [2022-12-13 20:21:40,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 457 transitions, 942 flow. Second operand has 4 states, 4 states have (on average 878.75) internal successors, (3515), 4 states have internal predecessors, (3515), 0 states have call successors, (0), 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-12-13 20:21:40,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:21:40,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 877 of 1518 [2022-12-13 20:21:40,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:21:44,894 INFO L130 PetriNetUnfolder]: 5650/19945 cut-off events. [2022-12-13 20:21:44,894 INFO L131 PetriNetUnfolder]: For 3/8 co-relation queries the response was YES. [2022-12-13 20:21:44,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30309 conditions, 19945 events. 5650/19945 cut-off events. For 3/8 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 195967 event pairs, 4352 based on Foata normal form. 0/17602 useless extension candidates. Maximal degree in co-relation 30302. Up to 10264 conditions per place. [2022-12-13 20:21:44,940 INFO L137 encePairwiseOnDemand]: 1514/1518 looper letters, 231 selfloop transitions, 3 changer transitions 0/530 dead transitions. [2022-12-13 20:21:44,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 530 transitions, 1554 flow [2022-12-13 20:21:44,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:21:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:21:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3741 transitions. [2022-12-13 20:21:44,946 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.616106719367589 [2022-12-13 20:21:44,946 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3741 transitions. [2022-12-13 20:21:44,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3741 transitions. [2022-12-13 20:21:44,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:21:44,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3741 transitions. [2022-12-13 20:21:44,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 935.25) internal successors, (3741), 4 states have internal predecessors, (3741), 0 states have call successors, (0), 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-12-13 20:21:44,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1518.0) internal successors, (7590), 5 states have internal predecessors, (7590), 0 states have call successors, (0), 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-12-13 20:21:44,959 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1518.0) internal successors, (7590), 5 states have internal predecessors, (7590), 0 states have call successors, (0), 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-12-13 20:21:44,959 INFO L175 Difference]: Start difference. First operand has 446 places, 457 transitions, 942 flow. Second operand 4 states and 3741 transitions. [2022-12-13 20:21:44,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 530 transitions, 1554 flow [2022-12-13 20:21:44,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 530 transitions, 1542 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 20:21:44,965 INFO L231 Difference]: Finished difference. Result has 446 places, 457 transitions, 943 flow [2022-12-13 20:21:44,965 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=943, PETRI_PLACES=446, PETRI_TRANSITIONS=457} [2022-12-13 20:21:44,966 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, -6 predicate places. [2022-12-13 20:21:44,966 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 457 transitions, 943 flow [2022-12-13 20:21:44,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 878.75) internal successors, (3515), 4 states have internal predecessors, (3515), 0 states have call successors, (0), 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-12-13 20:21:44,967 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:21:44,967 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:21:44,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:21:45,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:21:45,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:21:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:45,170 INFO L85 PathProgramCache]: Analyzing trace with hash -365901085, now seen corresponding path program 1 times [2022-12-13 20:21:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:45,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539329244] [2022-12-13 20:21:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:21:45,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:45,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539329244] [2022-12-13 20:21:45,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539329244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:45,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:45,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:45,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210001024] [2022-12-13 20:21:45,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:45,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:45,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:45,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:45,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:45,275 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 878 out of 1518 [2022-12-13 20:21:45,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 457 transitions, 943 flow. Second operand has 3 states, 3 states have (on average 879.3333333333334) internal successors, (2638), 3 states have internal predecessors, (2638), 0 states have call successors, (0), 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-12-13 20:21:45,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:21:45,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 878 of 1518 [2022-12-13 20:21:45,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:21:48,292 INFO L130 PetriNetUnfolder]: 5641/19836 cut-off events. [2022-12-13 20:21:48,292 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-12-13 20:21:48,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30325 conditions, 19836 events. 5641/19836 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 194387 event pairs, 4352 based on Foata normal form. 1/17493 useless extension candidates. Maximal degree in co-relation 30317. Up to 10199 conditions per place. [2022-12-13 20:21:48,347 INFO L137 encePairwiseOnDemand]: 1515/1518 looper letters, 231 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2022-12-13 20:21:48,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 529 transitions, 1549 flow [2022-12-13 20:21:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:21:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2866 transitions. [2022-12-13 20:21:48,351 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.629336846728151 [2022-12-13 20:21:48,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2866 transitions. [2022-12-13 20:21:48,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2866 transitions. [2022-12-13 20:21:48,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:21:48,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2866 transitions. [2022-12-13 20:21:48,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 955.3333333333334) internal successors, (2866), 3 states have internal predecessors, (2866), 0 states have call successors, (0), 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-12-13 20:21:48,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:21:48,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:21:48,360 INFO L175 Difference]: Start difference. First operand has 446 places, 457 transitions, 943 flow. Second operand 3 states and 2866 transitions. [2022-12-13 20:21:48,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 529 transitions, 1549 flow [2022-12-13 20:21:48,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 529 transitions, 1546 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:21:48,364 INFO L231 Difference]: Finished difference. Result has 446 places, 456 transitions, 938 flow [2022-12-13 20:21:48,365 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=938, PETRI_PLACES=446, PETRI_TRANSITIONS=456} [2022-12-13 20:21:48,365 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, -6 predicate places. [2022-12-13 20:21:48,365 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 456 transitions, 938 flow [2022-12-13 20:21:48,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 879.3333333333334) internal successors, (2638), 3 states have internal predecessors, (2638), 0 states have call successors, (0), 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-12-13 20:21:48,366 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:21:48,366 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:21:48,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:21:48,366 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:21:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1449558150, now seen corresponding path program 1 times [2022-12-13 20:21:48,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:48,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487996012] [2022-12-13 20:21:48,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:48,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:21:48,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:48,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487996012] [2022-12-13 20:21:48,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487996012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:48,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:48,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:21:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521121052] [2022-12-13 20:21:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:48,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:21:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:21:48,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:21:50,585 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 821 out of 1518 [2022-12-13 20:21:50,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 456 transitions, 938 flow. Second operand has 6 states, 6 states have (on average 822.8333333333334) internal successors, (4937), 6 states have internal predecessors, (4937), 0 states have call successors, (0), 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-12-13 20:21:50,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:21:50,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 821 of 1518 [2022-12-13 20:21:50,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:21:56,642 INFO L130 PetriNetUnfolder]: 7902/25483 cut-off events. [2022-12-13 20:21:56,643 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2022-12-13 20:21:56,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40399 conditions, 25483 events. 7902/25483 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 247014 event pairs, 5607 based on Foata normal form. 0/22579 useless extension candidates. Maximal degree in co-relation 40391. Up to 13614 conditions per place. [2022-12-13 20:21:56,728 INFO L137 encePairwiseOnDemand]: 1498/1518 looper letters, 470 selfloop transitions, 58 changer transitions 0/802 dead transitions. [2022-12-13 20:21:56,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 802 transitions, 2714 flow [2022-12-13 20:21:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:21:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 20:21:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5453 transitions. [2022-12-13 20:21:56,734 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5987044356609574 [2022-12-13 20:21:56,734 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 5453 transitions. [2022-12-13 20:21:56,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 5453 transitions. [2022-12-13 20:21:56,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:21:56,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 5453 transitions. [2022-12-13 20:21:56,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 908.8333333333334) internal successors, (5453), 6 states have internal predecessors, (5453), 0 states have call successors, (0), 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-12-13 20:21:56,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1518.0) internal successors, (10626), 7 states have internal predecessors, (10626), 0 states have call successors, (0), 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-12-13 20:21:56,748 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1518.0) internal successors, (10626), 7 states have internal predecessors, (10626), 0 states have call successors, (0), 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-12-13 20:21:56,748 INFO L175 Difference]: Start difference. First operand has 446 places, 456 transitions, 938 flow. Second operand 6 states and 5453 transitions. [2022-12-13 20:21:56,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 802 transitions, 2714 flow [2022-12-13 20:21:56,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 802 transitions, 2702 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:21:56,755 INFO L231 Difference]: Finished difference. Result has 454 places, 513 transitions, 1318 flow [2022-12-13 20:21:56,755 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1318, PETRI_PLACES=454, PETRI_TRANSITIONS=513} [2022-12-13 20:21:56,756 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, 2 predicate places. [2022-12-13 20:21:56,756 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 513 transitions, 1318 flow [2022-12-13 20:21:56,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 822.8333333333334) internal successors, (4937), 6 states have internal predecessors, (4937), 0 states have call successors, (0), 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-12-13 20:21:56,757 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:21:56,757 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:21:56,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:21:56,757 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:21:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1238821298, now seen corresponding path program 1 times [2022-12-13 20:21:56,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:56,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233558883] [2022-12-13 20:21:56,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:56,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 20:21:57,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:57,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233558883] [2022-12-13 20:21:57,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233558883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:57,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:57,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:21:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95343664] [2022-12-13 20:21:57,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:57,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:21:57,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:57,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:21:57,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:21:58,937 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 820 out of 1518 [2022-12-13 20:21:58,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 513 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 822.0) internal successors, (4932), 6 states have internal predecessors, (4932), 0 states have call successors, (0), 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-12-13 20:21:58,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:21:58,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 820 of 1518 [2022-12-13 20:21:58,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:05,023 INFO L130 PetriNetUnfolder]: 8242/27081 cut-off events. [2022-12-13 20:22:05,024 INFO L131 PetriNetUnfolder]: For 1526/1630 co-relation queries the response was YES. [2022-12-13 20:22:05,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44522 conditions, 27081 events. 8242/27081 cut-off events. For 1526/1630 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 266401 event pairs, 5594 based on Foata normal form. 46/24088 useless extension candidates. Maximal degree in co-relation 44510. Up to 14361 conditions per place. [2022-12-13 20:22:05,123 INFO L137 encePairwiseOnDemand]: 1498/1518 looper letters, 512 selfloop transitions, 62 changer transitions 0/851 dead transitions. [2022-12-13 20:22:05,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 851 transitions, 3168 flow [2022-12-13 20:22:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:22:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 20:22:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5439 transitions. [2022-12-13 20:22:05,129 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.597167325428195 [2022-12-13 20:22:05,129 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 5439 transitions. [2022-12-13 20:22:05,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 5439 transitions. [2022-12-13 20:22:05,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:05,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 5439 transitions. [2022-12-13 20:22:05,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 906.5) internal successors, (5439), 6 states have internal predecessors, (5439), 0 states have call successors, (0), 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-12-13 20:22:05,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1518.0) internal successors, (10626), 7 states have internal predecessors, (10626), 0 states have call successors, (0), 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-12-13 20:22:05,142 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1518.0) internal successors, (10626), 7 states have internal predecessors, (10626), 0 states have call successors, (0), 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-12-13 20:22:05,142 INFO L175 Difference]: Start difference. First operand has 454 places, 513 transitions, 1318 flow. Second operand 6 states and 5439 transitions. [2022-12-13 20:22:05,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 851 transitions, 3168 flow [2022-12-13 20:22:05,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 851 transitions, 3168 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:22:05,154 INFO L231 Difference]: Finished difference. Result has 464 places, 570 transitions, 1736 flow [2022-12-13 20:22:05,154 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1736, PETRI_PLACES=464, PETRI_TRANSITIONS=570} [2022-12-13 20:22:05,155 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, 12 predicate places. [2022-12-13 20:22:05,155 INFO L495 AbstractCegarLoop]: Abstraction has has 464 places, 570 transitions, 1736 flow [2022-12-13 20:22:05,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 822.0) internal successors, (4932), 6 states have internal predecessors, (4932), 0 states have call successors, (0), 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-12-13 20:22:05,156 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:05,156 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:22:05,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:22:05,156 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:22:05,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:05,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2131923494, now seen corresponding path program 1 times [2022-12-13 20:22:05,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:05,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874308997] [2022-12-13 20:22:05,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:05,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:22:05,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:05,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874308997] [2022-12-13 20:22:05,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874308997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:05,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:05,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:22:05,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8398471] [2022-12-13 20:22:05,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:05,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:22:05,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:05,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:22:05,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:22:05,791 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 1518 [2022-12-13 20:22:05,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 570 transitions, 1736 flow. Second operand has 3 states, 3 states have (on average 664.6666666666666) internal successors, (1994), 3 states have internal predecessors, (1994), 0 states have call successors, (0), 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-12-13 20:22:05,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:05,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 1518 [2022-12-13 20:22:05,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:15,397 INFO L130 PetriNetUnfolder]: 29368/66915 cut-off events. [2022-12-13 20:22:15,397 INFO L131 PetriNetUnfolder]: For 10569/10845 co-relation queries the response was YES. [2022-12-13 20:22:15,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133555 conditions, 66915 events. 29368/66915 cut-off events. For 10569/10845 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 571077 event pairs, 24525 based on Foata normal form. 6/61198 useless extension candidates. Maximal degree in co-relation 133538. Up to 55902 conditions per place. [2022-12-13 20:22:15,699 INFO L137 encePairwiseOnDemand]: 1418/1518 looper letters, 520 selfloop transitions, 105 changer transitions 0/741 dead transitions. [2022-12-13 20:22:15,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 741 transitions, 3381 flow [2022-12-13 20:22:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:22:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:22:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2489 transitions. [2022-12-13 20:22:15,703 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.54655248133509 [2022-12-13 20:22:15,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2489 transitions. [2022-12-13 20:22:15,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2489 transitions. [2022-12-13 20:22:15,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:15,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2489 transitions. [2022-12-13 20:22:15,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 829.6666666666666) internal successors, (2489), 3 states have internal predecessors, (2489), 0 states have call successors, (0), 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-12-13 20:22:15,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:22:15,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:22:15,711 INFO L175 Difference]: Start difference. First operand has 464 places, 570 transitions, 1736 flow. Second operand 3 states and 2489 transitions. [2022-12-13 20:22:15,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 741 transitions, 3381 flow [2022-12-13 20:22:15,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 741 transitions, 3381 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:22:15,727 INFO L231 Difference]: Finished difference. Result has 467 places, 669 transitions, 2493 flow [2022-12-13 20:22:15,728 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2493, PETRI_PLACES=467, PETRI_TRANSITIONS=669} [2022-12-13 20:22:15,729 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, 15 predicate places. [2022-12-13 20:22:15,729 INFO L495 AbstractCegarLoop]: Abstraction has has 467 places, 669 transitions, 2493 flow [2022-12-13 20:22:15,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.6666666666666) internal successors, (1994), 3 states have internal predecessors, (1994), 0 states have call successors, (0), 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-12-13 20:22:15,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:15,729 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:22:15,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:22:15,730 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:22:15,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:15,730 INFO L85 PathProgramCache]: Analyzing trace with hash -895868573, now seen corresponding path program 1 times [2022-12-13 20:22:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:15,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377454145] [2022-12-13 20:22:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 20:22:15,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:15,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377454145] [2022-12-13 20:22:15,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377454145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:15,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:15,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:22:15,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58817462] [2022-12-13 20:22:15,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:15,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:22:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:15,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:22:15,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:22:16,234 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 1518 [2022-12-13 20:22:16,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 669 transitions, 2493 flow. Second operand has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 0 states have call successors, (0), 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-12-13 20:22:16,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:16,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 1518 [2022-12-13 20:22:16,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:27,274 INFO L130 PetriNetUnfolder]: 29613/67398 cut-off events. [2022-12-13 20:22:27,274 INFO L131 PetriNetUnfolder]: For 23915/24263 co-relation queries the response was YES. [2022-12-13 20:22:27,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151195 conditions, 67398 events. 29613/67398 cut-off events. For 23915/24263 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 575472 event pairs, 24433 based on Foata normal form. 2/61632 useless extension candidates. Maximal degree in co-relation 151176. Up to 56304 conditions per place. [2022-12-13 20:22:27,585 INFO L137 encePairwiseOnDemand]: 1424/1518 looper letters, 615 selfloop transitions, 101 changer transitions 0/832 dead transitions. [2022-12-13 20:22:27,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 832 transitions, 4305 flow [2022-12-13 20:22:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:22:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:22:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2478 transitions. [2022-12-13 20:22:27,590 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.544137022397892 [2022-12-13 20:22:27,590 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2478 transitions. [2022-12-13 20:22:27,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2478 transitions. [2022-12-13 20:22:27,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:27,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2478 transitions. [2022-12-13 20:22:27,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 826.0) internal successors, (2478), 3 states have internal predecessors, (2478), 0 states have call successors, (0), 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-12-13 20:22:27,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:22:27,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:22:27,600 INFO L175 Difference]: Start difference. First operand has 467 places, 669 transitions, 2493 flow. Second operand 3 states and 2478 transitions. [2022-12-13 20:22:27,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 832 transitions, 4305 flow [2022-12-13 20:22:27,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 832 transitions, 4164 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-13 20:22:27,693 INFO L231 Difference]: Finished difference. Result has 469 places, 762 transitions, 3077 flow [2022-12-13 20:22:27,693 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=2354, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3077, PETRI_PLACES=469, PETRI_TRANSITIONS=762} [2022-12-13 20:22:27,694 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, 17 predicate places. [2022-12-13 20:22:27,694 INFO L495 AbstractCegarLoop]: Abstraction has has 469 places, 762 transitions, 3077 flow [2022-12-13 20:22:27,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 0 states have call successors, (0), 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-12-13 20:22:27,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:27,695 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:22:27,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:22:27,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:22:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2016703523, now seen corresponding path program 1 times [2022-12-13 20:22:27,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:27,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022773903] [2022-12-13 20:22:27,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 20:22:28,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:28,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022773903] [2022-12-13 20:22:28,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022773903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:28,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:28,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:22:28,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030815233] [2022-12-13 20:22:28,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:28,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:22:28,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:28,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:22:28,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:22:29,160 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 1518 [2022-12-13 20:22:29,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 762 transitions, 3077 flow. Second operand has 7 states, 7 states have (on average 653.4285714285714) internal successors, (4574), 7 states have internal predecessors, (4574), 0 states have call successors, (0), 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-12-13 20:22:29,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:29,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 1518 [2022-12-13 20:22:29,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:42,622 INFO L130 PetriNetUnfolder]: 29617/67048 cut-off events. [2022-12-13 20:22:42,622 INFO L131 PetriNetUnfolder]: For 34704/35080 co-relation queries the response was YES. [2022-12-13 20:22:42,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166970 conditions, 67048 events. 29617/67048 cut-off events. For 34704/35080 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 589601 event pairs, 1271 based on Foata normal form. 30/61245 useless extension candidates. Maximal degree in co-relation 166950. Up to 55462 conditions per place. [2022-12-13 20:22:42,925 INFO L137 encePairwiseOnDemand]: 1427/1518 looper letters, 949 selfloop transitions, 109 changer transitions 5/1179 dead transitions. [2022-12-13 20:22:42,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 1179 transitions, 6581 flow [2022-12-13 20:22:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 20:22:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 20:22:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6041 transitions. [2022-12-13 20:22:42,933 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4974472990777339 [2022-12-13 20:22:42,933 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6041 transitions. [2022-12-13 20:22:42,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6041 transitions. [2022-12-13 20:22:42,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:42,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6041 transitions. [2022-12-13 20:22:42,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 755.125) internal successors, (6041), 8 states have internal predecessors, (6041), 0 states have call successors, (0), 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-12-13 20:22:42,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 1518.0) internal successors, (13662), 9 states have internal predecessors, (13662), 0 states have call successors, (0), 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-12-13 20:22:42,949 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 1518.0) internal successors, (13662), 9 states have internal predecessors, (13662), 0 states have call successors, (0), 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-12-13 20:22:42,949 INFO L175 Difference]: Start difference. First operand has 469 places, 762 transitions, 3077 flow. Second operand 8 states and 6041 transitions. [2022-12-13 20:22:42,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 1179 transitions, 6581 flow [2022-12-13 20:22:42,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 1179 transitions, 6447 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-13 20:22:43,002 INFO L231 Difference]: Finished difference. Result has 476 places, 773 transitions, 3343 flow [2022-12-13 20:22:43,002 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=2944, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=762, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3343, PETRI_PLACES=476, PETRI_TRANSITIONS=773} [2022-12-13 20:22:43,003 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, 24 predicate places. [2022-12-13 20:22:43,003 INFO L495 AbstractCegarLoop]: Abstraction has has 476 places, 773 transitions, 3343 flow [2022-12-13 20:22:43,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 653.4285714285714) internal successors, (4574), 7 states have internal predecessors, (4574), 0 states have call successors, (0), 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-12-13 20:22:43,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:43,003 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:22:43,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:22:43,004 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:22:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash -802260288, now seen corresponding path program 1 times [2022-12-13 20:22:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:43,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300646947] [2022-12-13 20:22:43,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:22:43,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:43,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300646947] [2022-12-13 20:22:43,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300646947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:22:43,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601309348] [2022-12-13 20:22:43,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:43,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:22:43,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:22:43,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:22:43,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:22:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:43,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 20:22:43,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:22:43,512 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:22:43,513 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 24 treesize of output 26 [2022-12-13 20:22:43,603 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-12-13 20:22:43,623 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 16 treesize of output 18 [2022-12-13 20:22:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:22:43,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:22:43,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601309348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:43,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:22:43,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2022-12-13 20:22:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881847162] [2022-12-13 20:22:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:43,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:22:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:43,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:22:43,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-13 20:22:45,116 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 1518 [2022-12-13 20:22:45,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 773 transitions, 3343 flow. Second operand has 8 states, 8 states have (on average 657.125) internal successors, (5257), 8 states have internal predecessors, (5257), 0 states have call successors, (0), 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-12-13 20:22:45,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:45,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 1518 [2022-12-13 20:22:45,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:59,968 INFO L130 PetriNetUnfolder]: 29632/67557 cut-off events. [2022-12-13 20:22:59,968 INFO L131 PetriNetUnfolder]: For 40690/41124 co-relation queries the response was YES. [2022-12-13 20:23:00,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169405 conditions, 67557 events. 29632/67557 cut-off events. For 40690/41124 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 578631 event pairs, 21385 based on Foata normal form. 20/62002 useless extension candidates. Maximal degree in co-relation 169384. Up to 55799 conditions per place. [2022-12-13 20:23:00,343 INFO L137 encePairwiseOnDemand]: 1432/1518 looper letters, 1123 selfloop transitions, 103 changer transitions 10/1352 dead transitions. [2022-12-13 20:23:00,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 1352 transitions, 7757 flow [2022-12-13 20:23:00,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 20:23:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 20:23:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6231 transitions. [2022-12-13 20:23:00,351 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.513092885375494 [2022-12-13 20:23:00,352 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6231 transitions. [2022-12-13 20:23:00,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6231 transitions. [2022-12-13 20:23:00,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:23:00,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6231 transitions. [2022-12-13 20:23:00,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 778.875) internal successors, (6231), 8 states have internal predecessors, (6231), 0 states have call successors, (0), 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-12-13 20:23:00,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 1518.0) internal successors, (13662), 9 states have internal predecessors, (13662), 0 states have call successors, (0), 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-12-13 20:23:00,366 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 1518.0) internal successors, (13662), 9 states have internal predecessors, (13662), 0 states have call successors, (0), 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-12-13 20:23:00,366 INFO L175 Difference]: Start difference. First operand has 476 places, 773 transitions, 3343 flow. Second operand 8 states and 6231 transitions. [2022-12-13 20:23:00,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 1352 transitions, 7757 flow [2022-12-13 20:23:00,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 1352 transitions, 7754 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 20:23:00,409 INFO L231 Difference]: Finished difference. Result has 483 places, 782 transitions, 3706 flow [2022-12-13 20:23:00,410 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=3340, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3706, PETRI_PLACES=483, PETRI_TRANSITIONS=782} [2022-12-13 20:23:00,410 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, 31 predicate places. [2022-12-13 20:23:00,410 INFO L495 AbstractCegarLoop]: Abstraction has has 483 places, 782 transitions, 3706 flow [2022-12-13 20:23:00,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 657.125) internal successors, (5257), 8 states have internal predecessors, (5257), 0 states have call successors, (0), 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-12-13 20:23:00,411 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:23:00,411 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:23:00,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:23:00,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 20:23:00,612 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting worker_fnErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:23:00,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:23:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1819148590, now seen corresponding path program 1 times [2022-12-13 20:23:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:23:00,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236081626] [2022-12-13 20:23:00,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:23:00,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:23:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:23:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:23:00,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:23:00,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236081626] [2022-12-13 20:23:00,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236081626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:23:00,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:23:00,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:23:00,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146873583] [2022-12-13 20:23:00,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:23:00,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:23:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:23:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:23:00,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:23:01,360 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 822 out of 1518 [2022-12-13 20:23:01,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 782 transitions, 3706 flow. Second operand has 3 states, 3 states have (on average 826.3333333333334) internal successors, (2479), 3 states have internal predecessors, (2479), 0 states have call successors, (0), 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-12-13 20:23:01,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:23:01,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 822 of 1518 [2022-12-13 20:23:01,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:23:07,079 INFO L130 PetriNetUnfolder]: 9100/29510 cut-off events. [2022-12-13 20:23:07,079 INFO L131 PetriNetUnfolder]: For 22749/23180 co-relation queries the response was YES. [2022-12-13 20:23:07,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65031 conditions, 29510 events. 9100/29510 cut-off events. For 22749/23180 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 290996 event pairs, 5756 based on Foata normal form. 84/26466 useless extension candidates. Maximal degree in co-relation 65009. Up to 15807 conditions per place. [2022-12-13 20:23:07,231 INFO L137 encePairwiseOnDemand]: 1501/1518 looper letters, 406 selfloop transitions, 18 changer transitions 0/872 dead transitions. [2022-12-13 20:23:07,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 872 transitions, 4834 flow [2022-12-13 20:23:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:23:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:23:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2731 transitions. [2022-12-13 20:23:07,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5996925779534475 [2022-12-13 20:23:07,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2731 transitions. [2022-12-13 20:23:07,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2731 transitions. [2022-12-13 20:23:07,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:23:07,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2731 transitions. [2022-12-13 20:23:07,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 910.3333333333334) internal successors, (2731), 3 states have internal predecessors, (2731), 0 states have call successors, (0), 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-12-13 20:23:07,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:23:07,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:23:07,241 INFO L175 Difference]: Start difference. First operand has 483 places, 782 transitions, 3706 flow. Second operand 3 states and 2731 transitions. [2022-12-13 20:23:07,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 872 transitions, 4834 flow [2022-12-13 20:23:07,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 872 transitions, 4830 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 20:23:07,275 INFO L231 Difference]: Finished difference. Result has 486 places, 798 transitions, 3914 flow [2022-12-13 20:23:07,275 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=3702, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3914, PETRI_PLACES=486, PETRI_TRANSITIONS=798} [2022-12-13 20:23:07,275 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, 34 predicate places. [2022-12-13 20:23:07,276 INFO L495 AbstractCegarLoop]: Abstraction has has 486 places, 798 transitions, 3914 flow [2022-12-13 20:23:07,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 826.3333333333334) internal successors, (2479), 3 states have internal predecessors, (2479), 0 states have call successors, (0), 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-12-13 20:23:07,276 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:23:07,276 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:23:07,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 20:23:07,276 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:23:07,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:23:07,276 INFO L85 PathProgramCache]: Analyzing trace with hash 135917176, now seen corresponding path program 1 times [2022-12-13 20:23:07,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:23:07,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993168908] [2022-12-13 20:23:07,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:23:07,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:23:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:23:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 20:23:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:23:07,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993168908] [2022-12-13 20:23:07,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993168908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:23:07,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:23:07,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:23:07,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641820821] [2022-12-13 20:23:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:23:07,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:23:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:23:07,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:23:07,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:23:07,823 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 821 out of 1518 [2022-12-13 20:23:07,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 798 transitions, 3914 flow. Second operand has 3 states, 3 states have (on average 825.6666666666666) internal successors, (2477), 3 states have internal predecessors, (2477), 0 states have call successors, (0), 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-12-13 20:23:07,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:23:07,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 821 of 1518 [2022-12-13 20:23:07,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:23:14,940 INFO L130 PetriNetUnfolder]: 9595/30900 cut-off events. [2022-12-13 20:23:14,940 INFO L131 PetriNetUnfolder]: For 28377/28940 co-relation queries the response was YES. [2022-12-13 20:23:15,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69900 conditions, 30900 events. 9595/30900 cut-off events. For 28377/28940 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 305772 event pairs, 5671 based on Foata normal form. 143/27638 useless extension candidates. Maximal degree in co-relation 69876. Up to 16351 conditions per place. [2022-12-13 20:23:15,090 INFO L137 encePairwiseOnDemand]: 1500/1518 looper letters, 424 selfloop transitions, 19 changer transitions 0/890 dead transitions. [2022-12-13 20:23:15,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 890 transitions, 5085 flow [2022-12-13 20:23:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:23:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:23:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2729 transitions. [2022-12-13 20:23:15,093 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5992534036012297 [2022-12-13 20:23:15,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2729 transitions. [2022-12-13 20:23:15,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2729 transitions. [2022-12-13 20:23:15,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:23:15,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2729 transitions. [2022-12-13 20:23:15,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 909.6666666666666) internal successors, (2729), 3 states have internal predecessors, (2729), 0 states have call successors, (0), 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-12-13 20:23:15,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:23:15,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1518.0) internal successors, (6072), 4 states have internal predecessors, (6072), 0 states have call successors, (0), 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-12-13 20:23:15,100 INFO L175 Difference]: Start difference. First operand has 486 places, 798 transitions, 3914 flow. Second operand 3 states and 2729 transitions. [2022-12-13 20:23:15,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 890 transitions, 5085 flow [2022-12-13 20:23:15,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 890 transitions, 5017 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 20:23:15,159 INFO L231 Difference]: Finished difference. Result has 488 places, 815 transitions, 4068 flow [2022-12-13 20:23:15,159 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=3850, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=798, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4068, PETRI_PLACES=488, PETRI_TRANSITIONS=815} [2022-12-13 20:23:15,160 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, 36 predicate places. [2022-12-13 20:23:15,160 INFO L495 AbstractCegarLoop]: Abstraction has has 488 places, 815 transitions, 4068 flow [2022-12-13 20:23:15,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 825.6666666666666) internal successors, (2477), 3 states have internal predecessors, (2477), 0 states have call successors, (0), 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-12-13 20:23:15,160 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:23:15,161 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:23:15,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 20:23:15,161 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:23:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:23:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1403500114, now seen corresponding path program 1 times [2022-12-13 20:23:15,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:23:15,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102630002] [2022-12-13 20:23:15,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:23:15,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:23:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:23:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 20:23:15,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:23:15,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102630002] [2022-12-13 20:23:15,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102630002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:23:15,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:23:15,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 20:23:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390899856] [2022-12-13 20:23:15,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:23:15,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 20:23:15,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:23:15,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 20:23:15,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:23:19,294 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 1518 [2022-12-13 20:23:19,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 815 transitions, 4068 flow. Second operand has 10 states, 10 states have (on average 815.6) internal successors, (8156), 10 states have internal predecessors, (8156), 0 states have call successors, (0), 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-12-13 20:23:19,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:23:19,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 1518 [2022-12-13 20:23:19,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:23:29,054 INFO L130 PetriNetUnfolder]: 10925/35482 cut-off events. [2022-12-13 20:23:29,054 INFO L131 PetriNetUnfolder]: For 37353/38517 co-relation queries the response was YES. [2022-12-13 20:23:29,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82873 conditions, 35482 events. 10925/35482 cut-off events. For 37353/38517 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 365574 event pairs, 729 based on Foata normal form. 442/32310 useless extension candidates. Maximal degree in co-relation 82848. Up to 15072 conditions per place. [2022-12-13 20:23:29,282 INFO L137 encePairwiseOnDemand]: 1496/1518 looper letters, 774 selfloop transitions, 112 changer transitions 5/1331 dead transitions. [2022-12-13 20:23:29,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 1331 transitions, 7458 flow [2022-12-13 20:23:29,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:23:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 20:23:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8025 transitions. [2022-12-13 20:23:29,291 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5873956960913482 [2022-12-13 20:23:29,291 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 8025 transitions. [2022-12-13 20:23:29,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 8025 transitions. [2022-12-13 20:23:29,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:23:29,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 8025 transitions. [2022-12-13 20:23:29,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 891.6666666666666) internal successors, (8025), 9 states have internal predecessors, (8025), 0 states have call successors, (0), 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-12-13 20:23:29,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1518.0) internal successors, (15180), 10 states have internal predecessors, (15180), 0 states have call successors, (0), 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-12-13 20:23:29,307 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1518.0) internal successors, (15180), 10 states have internal predecessors, (15180), 0 states have call successors, (0), 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-12-13 20:23:29,307 INFO L175 Difference]: Start difference. First operand has 488 places, 815 transitions, 4068 flow. Second operand 9 states and 8025 transitions. [2022-12-13 20:23:29,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 1331 transitions, 7458 flow [2022-12-13 20:23:29,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 1331 transitions, 7346 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-13 20:23:29,385 INFO L231 Difference]: Finished difference. Result has 499 places, 859 transitions, 4840 flow [2022-12-13 20:23:29,386 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=1518, PETRI_DIFFERENCE_MINUEND_FLOW=4004, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4840, PETRI_PLACES=499, PETRI_TRANSITIONS=859} [2022-12-13 20:23:29,386 INFO L288 CegarLoopForPetriNet]: 452 programPoint places, 47 predicate places. [2022-12-13 20:23:29,386 INFO L495 AbstractCegarLoop]: Abstraction has has 499 places, 859 transitions, 4840 flow [2022-12-13 20:23:29,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 815.6) internal successors, (8156), 10 states have internal predecessors, (8156), 0 states have call successors, (0), 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-12-13 20:23:29,387 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:23:29,387 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:23:29,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 20:23:29,387 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-12-13 20:23:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:23:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash -474112886, now seen corresponding path program 1 times [2022-12-13 20:23:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:23:29,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135350940] [2022-12-13 20:23:29,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:23:29,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:23:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:23:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:23:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:23:30,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135350940] [2022-12-13 20:23:30,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135350940] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:23:30,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222114788] [2022-12-13 20:23:30,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:23:30,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:23:30,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:23:30,524 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:23:30,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97f73f79-704c-4722-ad8c-502fc1cd6d8a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:23:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:23:30,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-13 20:23:30,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:23:30,718 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:23:30,718 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 19 treesize of output 19 [2022-12-13 20:23:30,793 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-12-13 20:23:30,809 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-12-13 20:23:30,835 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-12-13 20:23:30,851 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-12-13 20:23:30,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:30,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:30,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:30,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:30,939 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-12-13 20:23:30,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:30,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:30,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:30,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:30,980 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-12-13 20:23:30,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:30,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:30,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:30,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:31,000 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-12-13 20:23:31,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:31,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:31,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:31,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:31,021 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-12-13 20:23:39,178 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 61 treesize of output 53 [2022-12-13 20:23:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:23:47,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:23:47,274 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2492 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (forall ((v_ArrVal_2492 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2492 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2492 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-12-13 20:23:48,559 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))))) is different from false [2022-12-13 20:23:50,689 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse2 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse2))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse2) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse2) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse2))))))) is different from false [2022-12-13 20:23:50,983 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0) .cse3 0)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0))))))) is different from false [2022-12-13 20:23:51,861 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0) .cse4 0) .cse3 0)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0)))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| Int)) (or (forall ((v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2492 (Array Int Int))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 8) v_ArrVal_2485) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 10) v_ArrVal_2488) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2492) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5) 0)) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_48| .cse0))))))) is different from false [2022-12-13 20:23:52,149 INFO L321 Elim1Store]: treesize reduction 632, result has 21.1 percent of original size [2022-12-13 20:23:52,150 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 181 [2022-12-13 20:23:52,165 INFO L321 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2022-12-13 20:23:52,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 174 treesize of output 132 [2022-12-13 20:23:52,204 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-12-13 20:23:52,256 INFO L321 Elim1Store]: treesize reduction 800, result has 0.1 percent of original size [2022-12-13 20:23:52,257 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-12-13 20:23:52,390 INFO L321 Elim1Store]: treesize reduction 720, result has 10.1 percent of original size [2022-12-13 20:23:52,391 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 93 [2022-12-13 20:23:52,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:23:52,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 24 [2022-12-13 20:23:52,458 INFO L321 Elim1Store]: treesize reduction 800, result has 0.1 percent of original size [2022-12-13 20:23:52,459 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-12-13 20:23:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-12-13 20:23:52,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222114788] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:23:52,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:23:52,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 32 [2022-12-13 20:23:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128740818] [2022-12-13 20:23:52,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:23:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 20:23:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:23:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 20:23:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=642, Unknown=41, NotChecked=290, Total=1122 [2022-12-13 20:23:53,434 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 1518 [2022-12-13 20:23:53,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 859 transitions, 4840 flow. Second operand has 34 states, 34 states have (on average 474.5882352941176) internal successors, (16136), 34 states have internal predecessors, (16136), 0 states have call successors, (0), 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-12-13 20:23:53,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:23:53,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 1518 [2022-12-13 20:23:53,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:24:00,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:24:03,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:24:12,936 WARN L233 SmtUtils]: Spent 8.64s on a formula simplification. DAG size of input: 79 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:24:26,597 WARN L233 SmtUtils]: Spent 12.13s on a formula simplification. DAG size of input: 75 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:24:57,592 WARN L233 SmtUtils]: Spent 12.43s on a formula simplification. DAG size of input: 81 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:25:12,468 WARN L233 SmtUtils]: Spent 12.45s on a formula simplification. DAG size of input: 77 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:25:27,772 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-12-13 20:25:30,243 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-12-13 20:25:32,628 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-12-13 20:25:34,674 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-12-13 20:25:36,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-12-13 20:25:39,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-12-13 20:25:41,136 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-12-13 20:25:43,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-12-13 20:25:49,745 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-12-13 20:25:51,753 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-12-13 20:25:54,129 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-12-13 20:25:56,872 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-12-13 20:25:59,903 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-12-13 20:26:12,323 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-12-13 20:26:15,218 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-12-13 20:26:17,258 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-12-13 20:26:19,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-12-13 20:26:21,347 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-12-13 20:26:24,125 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-12-13 20:26:26,134 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-12-13 20:26:28,142 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-12-13 20:26:30,150 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-12-13 20:26:32,361 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-12-13 20:26:35,380 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-12-13 20:26:37,390 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-12-13 20:26:39,401 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-12-13 20:26:41,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-12-13 20:26:43,421 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-12-13 20:26:45,697 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-12-13 20:26:47,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-12-13 20:26:50,682 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 [1] [2022-12-13 20:26:52,694 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 [1] [2022-12-13 20:26:54,702 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 [1] [2022-12-13 20:26:56,712 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 [1] [2022-12-13 20:26:58,716 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 [1] [2022-12-13 20:27:00,726 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 [1] [2022-12-13 20:27:02,731 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 [1] [2022-12-13 20:27:04,742 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 [1] [2022-12-13 20:27:06,751 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, 1] [2022-12-13 20:27:08,755 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 [1] [2022-12-13 20:27:10,765 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 [1] [2022-12-13 20:27:12,774 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 [1] [2022-12-13 20:27:14,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 [1] [2022-12-13 20:27:16,784 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 [1] [2022-12-13 20:27:18,794 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 [1] [2022-12-13 20:27:23,179 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-12-13 20:27:27,337 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-12-13 20:27:29,383 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-12-13 20:27:31,813 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 [1] [2022-12-13 20:27:33,828 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 [1] [2022-12-13 20:27:35,836 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, 1] [2022-12-13 20:27:37,845 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 [1] [2022-12-13 20:27:39,850 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 [1] [2022-12-13 20:27:41,859 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 [1] [2022-12-13 20:27:43,868 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 [1] [2022-12-13 20:27:45,876 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-12-13 20:27:47,880 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-12-13 20:27:50,523 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-12-13 20:27:52,569 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-12-13 20:27:55,152 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-12-13 20:27:57,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-12-13 20:27:59,891 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-12-13 20:28:01,898 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-12-13 20:28:06,384 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-12-13 20:28:08,421 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-12-13 20:28:10,460 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-12-13 20:28:13,149 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-12-13 20:28:15,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-12-13 20:28:17,166 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-12-13 20:28:19,714 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-12-13 20:28:21,729 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-12-13 20:28:23,736 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-12-13 20:28:25,774 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-12-13 20:28:28,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-12-13 20:28:31,207 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-12-13 20:28:35,301 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-12-13 20:28:37,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-12-13 20:28:39,947 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-12-13 20:28:41,956 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-12-13 20:28:44,745 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-12-13 20:28:46,755 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-12-13 20:29: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 [1] [2022-12-13 20:29:07,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 [1] [2022-12-13 20:29:09,741 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 [1] [2022-12-13 20:29:11,747 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 [1] [2022-12-13 20:29:13,751 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 [1] [2022-12-13 20:29:15,762 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 [1] [2022-12-13 20:29:17,770 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 [1] [2022-12-13 20:29:19,783 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 [1] [2022-12-13 20:29:21,788 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, 1] [2022-12-13 20:29:23,800 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 [1] [2022-12-13 20:29:25,811 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 [1] [2022-12-13 20:29:27,821 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 [1] [2022-12-13 20:29:29,833 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 [1] [2022-12-13 20:29:31,838 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 [1] [2022-12-13 20:29:33,853 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 [1] [2022-12-13 20:29:35,861 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 [1] [2022-12-13 20:29:39,187 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 [1] [2022-12-13 20:29:41,198 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 [1] [2022-12-13 20:29:43,201 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 [1] [2022-12-13 20:29:45,213 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 [1] [2022-12-13 20:29:47,217 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 [1] [2022-12-13 20:29:49,230 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 [1] [2022-12-13 20:29:51,238 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 [1] [2022-12-13 20:29:53,250 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 [1] [2022-12-13 20:29:55,259 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, 1] [2022-12-13 20:29:57,271 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 [1] [2022-12-13 20:29:59,276 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 [1] [2022-12-13 20:30:01,280 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 [1] [2022-12-13 20:30:03,291 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 [1] [2022-12-13 20:30:05,298 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 [1] [2022-12-13 20:30:07,302 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 [1] [2022-12-13 20:30:09,312 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 [1] [2022-12-13 20:30:11,322 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 [1] [2022-12-13 20:30:13,332 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 [1] [2022-12-13 20:30:15,336 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 [1] [2022-12-13 20:30:17,343 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 [1] [2022-12-13 20:30:19,349 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 [1] [2022-12-13 20:30:21,354 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 [1] [2022-12-13 20:30:23,360 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 [1] [2022-12-13 20:30:25,364 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, 1] [2022-12-13 20:30:27,369 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 [1] [2022-12-13 20:30:29,375 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 [1] [2022-12-13 20:30:31,385 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 [1] [2022-12-13 20:30:33,392 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 [1] [2022-12-13 20:30:35,400 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 [1] [2022-12-13 20:30:37,405 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 [1] [2022-12-13 20:30:41,140 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 [1] [2022-12-13 20:30:43,147 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 [1] [2022-12-13 20:30:45,152 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 [1] [2022-12-13 20:30:47,157 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 [1] [2022-12-13 20:30:49,162 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 [1] [2022-12-13 20:30:51,168 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, 1] [2022-12-13 20:30:53,173 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 [1] [2022-12-13 20:30:55,178 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 [1] [2022-12-13 20:30:57,183 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 [1] [2022-12-13 20:30:59,190 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 [1] [2022-12-13 20:31:01,198 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 [1] [2022-12-13 20:31:03,209 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 [1] [2022-12-13 20:31:05,217 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 [1] [2022-12-13 20:31:07,225 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 [1] [2022-12-13 20:31:09,236 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 [1]