./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc --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 362fd638a164593c63fbfc307f633b7ac4c475762218e6a2237e90d5b6553a84 --- 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-5e519f3 [2022-11-02 21:05:44,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:05:44,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:05:44,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:05:44,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:05:44,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:05:44,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:05:44,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:05:44,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:05:44,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:05:44,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:05:44,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:05:44,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:05:44,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:05:44,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:05:44,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:05:44,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:05:44,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:05:44,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:05:44,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:05:44,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:05:44,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:05:44,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:05:44,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:05:44,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:05:44,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:05:44,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:05:44,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:05:44,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:05:44,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:05:44,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:05:44,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:05:44,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:05:44,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:05:44,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:05:44,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:05:44,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:05:44,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:05:44,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:05:44,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:05:44,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:05:44,914 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 21:05:44,948 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:05:44,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:05:44,952 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:05:44,952 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:05:44,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:05:44,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:05:44,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:05:44,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:05:44,955 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:05:44,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:05:44,957 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:05:44,957 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:05:44,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:05:44,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:05:44,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:05:44,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:05:44,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:05:44,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:05:44,959 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 21:05:44,959 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:05:44,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:05:44,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:05:44,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:05:44,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:05:44,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:05:44,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:05:44,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:05:44,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:05:44,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:05:44,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:05:44,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:05:44,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:05:44,963 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:05:44,964 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:05:44,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:05:44,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/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_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc 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 -> 362fd638a164593c63fbfc307f633b7ac4c475762218e6a2237e90d5b6553a84 [2022-11-02 21:05:45,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:05:45,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:05:45,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:05:45,351 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:05:45,352 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:05:45,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2022-11-02 21:05:45,412 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/data/f028cb1f8/fa2e33ac1b9b4578abf509a00acfe7b5/FLAG857aab9db [2022-11-02 21:05:45,923 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:05:45,924 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2022-11-02 21:05:45,931 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/data/f028cb1f8/fa2e33ac1b9b4578abf509a00acfe7b5/FLAG857aab9db [2022-11-02 21:05:46,388 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/data/f028cb1f8/fa2e33ac1b9b4578abf509a00acfe7b5 [2022-11-02 21:05:46,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:05:46,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:05:46,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:05:46,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:05:46,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:05:46,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e8102d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46, skipping insertion in model container [2022-11-02 21:05:46,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:05:46,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:05:46,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-11-02 21:05:46,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:05:46,709 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:05:46,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-11-02 21:05:46,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:05:46,801 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:05:46,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46 WrapperNode [2022-11-02 21:05:46,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:05:46,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:05:46,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:05:46,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:05:46,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,882 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 173 [2022-11-02 21:05:46,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:05:46,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:05:46,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:05:46,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:05:46,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,953 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:05:46,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:05:46,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:05:46,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:05:46,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (1/1) ... [2022-11-02 21:05:46,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:05:46,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:47,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:05:47,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4419a34f-6daf-4db1-a1ea-8bb8f06bedf5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:05:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:05:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 21:05:47,064 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 21:05:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 21:05:47,064 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 21:05:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 21:05:47,067 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 21:05:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:05:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:05:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:05:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:05:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:05:47,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:05:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:05:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:05:47,070 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 21:05:47,205 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:05:47,207 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:05:47,912 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:05:47,922 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:05:47,929 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 21:05:47,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:47 BoogieIcfgContainer [2022-11-02 21:05:47,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:05:47,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:05:47,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:05:47,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:05:47,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:05:46" (1/3) ... [2022-11-02 21:05:47,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7df2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:47, skipping insertion in model container [2022-11-02 21:05:47,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:46" (2/3) ... [2022-11-02 21:05:47,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7df2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:47, skipping insertion in model container [2022-11-02 21:05:47,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:47" (3/3) ... [2022-11-02 21:05:47,944 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2022-11-02 21:05:47,953 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:05:47,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:05:47,965 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-02 21:05:47,965 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:05:48,142 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 21:05:48,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 360 transitions, 744 flow [2022-11-02 21:05:48,352 INFO L130 PetriNetUnfolder]: 17/357 cut-off events. [2022-11-02 21:05:48,353 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:05:48,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 357 events. 17/357 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 718 event pairs, 0 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 247. Up to 2 conditions per place. [2022-11-02 21:05:48,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 360 transitions, 744 flow [2022-11-02 21:05:48,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 329 places, 334 transitions, 686 flow [2022-11-02 21:05:48,403 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:05:48,412 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;@6c6f4c4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:05:48,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-02 21:05:48,425 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-02 21:05:48,425 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:05:48,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:48,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:48,427 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:05:48,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1188555669, now seen corresponding path program 1 times [2022-11-02 21:05:48,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:48,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915917176] [2022-11-02 21:05:48,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:48,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:48,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915917176] [2022-11-02 21:05:48,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915917176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:48,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:48,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:05:48,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244103479] [2022-11-02 21:05:48,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:48,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:48,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:48,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:48,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:48,822 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 360 [2022-11-02 21:05:48,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 334 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:48,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:48,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 360 [2022-11-02 21:05:48,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:49,218 INFO L130 PetriNetUnfolder]: 73/865 cut-off events. [2022-11-02 21:05:49,218 INFO L131 PetriNetUnfolder]: For 81/93 co-relation queries the response was YES. [2022-11-02 21:05:49,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 865 events. 73/865 cut-off events. For 81/93 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4717 event pairs, 39 based on Foata normal form. 34/720 useless extension candidates. Maximal degree in co-relation 760. Up to 99 conditions per place. [2022-11-02 21:05:49,233 INFO L137 encePairwiseOnDemand]: 350/360 looper letters, 21 selfloop transitions, 2 changer transitions 3/326 dead transitions. [2022-11-02 21:05:49,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 326 transitions, 716 flow [2022-11-02 21:05:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:05:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2022-11-02 21:05:49,257 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.937037037037037 [2022-11-02 21:05:49,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1012 transitions. [2022-11-02 21:05:49,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1012 transitions. [2022-11-02 21:05:49,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:49,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1012 transitions. [2022-11-02 21:05:49,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:49,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:49,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:49,288 INFO L175 Difference]: Start difference. First operand has 329 places, 334 transitions, 686 flow. Second operand 3 states and 1012 transitions. [2022-11-02 21:05:49,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 326 transitions, 716 flow [2022-11-02 21:05:49,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 326 transitions, 704 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 21:05:49,309 INFO L231 Difference]: Finished difference. Result has 324 places, 323 transitions, 656 flow [2022-11-02 21:05:49,311 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=324, PETRI_TRANSITIONS=323} [2022-11-02 21:05:49,315 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -5 predicate places. [2022-11-02 21:05:49,315 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 323 transitions, 656 flow [2022-11-02 21:05:49,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:49,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:49,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:49,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:05:49,319 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:05:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1627143012, now seen corresponding path program 1 times [2022-11-02 21:05:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:49,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979631986] [2022-11-02 21:05:49,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:49,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:49,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979631986] [2022-11-02 21:05:49,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979631986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:49,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:49,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:05:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841178246] [2022-11-02 21:05:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:49,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:49,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:49,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:49,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:49,448 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 360 [2022-11-02 21:05:49,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 323 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:49,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:49,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 360 [2022-11-02 21:05:49,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:49,710 INFO L130 PetriNetUnfolder]: 47/734 cut-off events. [2022-11-02 21:05:49,710 INFO L131 PetriNetUnfolder]: For 9/26 co-relation queries the response was YES. [2022-11-02 21:05:49,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 734 events. 47/734 cut-off events. For 9/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3653 event pairs, 21 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 789. Up to 74 conditions per place. [2022-11-02 21:05:49,721 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 21 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2022-11-02 21:05:49,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 322 transitions, 700 flow [2022-11-02 21:05:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:05:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2022-11-02 21:05:49,726 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9305555555555556 [2022-11-02 21:05:49,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1005 transitions. [2022-11-02 21:05:49,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1005 transitions. [2022-11-02 21:05:49,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:49,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1005 transitions. [2022-11-02 21:05:49,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:49,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:49,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:49,734 INFO L175 Difference]: Start difference. First operand has 324 places, 323 transitions, 656 flow. Second operand 3 states and 1005 transitions. [2022-11-02 21:05:49,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 322 transitions, 700 flow [2022-11-02 21:05:49,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 322 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:05:49,745 INFO L231 Difference]: Finished difference. Result has 320 places, 322 transitions, 654 flow [2022-11-02 21:05:49,746 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=320, PETRI_TRANSITIONS=322} [2022-11-02 21:05:49,747 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -9 predicate places. [2022-11-02 21:05:49,747 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 322 transitions, 654 flow [2022-11-02 21:05:49,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:49,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:49,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:49,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:05:49,748 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:05:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:49,749 INFO L85 PathProgramCache]: Analyzing trace with hash -916769013, now seen corresponding path program 1 times [2022-11-02 21:05:49,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:49,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143062393] [2022-11-02 21:05:49,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:49,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143062393] [2022-11-02 21:05:49,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143062393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:49,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:49,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:05:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029375953] [2022-11-02 21:05:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:49,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:49,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:49,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:49,831 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 360 [2022-11-02 21:05:49,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 322 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:49,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:49,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 360 [2022-11-02 21:05:49,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:50,004 INFO L130 PetriNetUnfolder]: 35/667 cut-off events. [2022-11-02 21:05:50,005 INFO L131 PetriNetUnfolder]: For 8/17 co-relation queries the response was YES. [2022-11-02 21:05:50,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 667 events. 35/667 cut-off events. For 8/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3098 event pairs, 12 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 685. Up to 46 conditions per place. [2022-11-02 21:05:50,018 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 15 selfloop transitions, 1 changer transitions 0/318 dead transitions. [2022-11-02 21:05:50,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 318 transitions, 678 flow [2022-11-02 21:05:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:05:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2022-11-02 21:05:50,021 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9351851851851852 [2022-11-02 21:05:50,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1010 transitions. [2022-11-02 21:05:50,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1010 transitions. [2022-11-02 21:05:50,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:50,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1010 transitions. [2022-11-02 21:05:50,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:50,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:50,031 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:50,031 INFO L175 Difference]: Start difference. First operand has 320 places, 322 transitions, 654 flow. Second operand 3 states and 1010 transitions. [2022-11-02 21:05:50,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 318 transitions, 678 flow [2022-11-02 21:05:50,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 318 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:05:50,038 INFO L231 Difference]: Finished difference. Result has 316 places, 318 transitions, 644 flow [2022-11-02 21:05:50,039 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=316, PETRI_TRANSITIONS=318} [2022-11-02 21:05:50,041 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -13 predicate places. [2022-11-02 21:05:50,042 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 318 transitions, 644 flow [2022-11-02 21:05:50,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:50,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:50,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:50,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:05:50,043 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:05:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1123061542, now seen corresponding path program 1 times [2022-11-02 21:05:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:50,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128873977] [2022-11-02 21:05:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:50,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:50,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:50,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128873977] [2022-11-02 21:05:50,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128873977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:50,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:50,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:05:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911154663] [2022-11-02 21:05:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:50,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:50,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:50,197 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 360 [2022-11-02 21:05:50,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 318 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:50,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:50,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 360 [2022-11-02 21:05:50,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:51,504 INFO L130 PetriNetUnfolder]: 1052/5356 cut-off events. [2022-11-02 21:05:51,504 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-11-02 21:05:51,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6822 conditions, 5356 events. 1052/5356 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 52195 event pairs, 720 based on Foata normal form. 0/4187 useless extension candidates. Maximal degree in co-relation 6781. Up to 1404 conditions per place. [2022-11-02 21:05:51,589 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 27 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2022-11-02 21:05:51,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 317 transitions, 700 flow [2022-11-02 21:05:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:05:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2022-11-02 21:05:51,592 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9194444444444444 [2022-11-02 21:05:51,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 993 transitions. [2022-11-02 21:05:51,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 993 transitions. [2022-11-02 21:05:51,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:51,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 993 transitions. [2022-11-02 21:05:51,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:51,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:51,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:51,605 INFO L175 Difference]: Start difference. First operand has 316 places, 318 transitions, 644 flow. Second operand 3 states and 993 transitions. [2022-11-02 21:05:51,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 317 transitions, 700 flow [2022-11-02 21:05:51,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 317 transitions, 699 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:05:51,612 INFO L231 Difference]: Finished difference. Result has 316 places, 317 transitions, 645 flow [2022-11-02 21:05:51,614 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=316, PETRI_TRANSITIONS=317} [2022-11-02 21:05:51,615 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -13 predicate places. [2022-11-02 21:05:51,615 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 317 transitions, 645 flow [2022-11-02 21:05:51,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:51,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:51,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:51,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:05:51,617 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:05:51,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash 758191315, now seen corresponding path program 1 times [2022-11-02 21:05:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:51,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606901273] [2022-11-02 21:05:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:51,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:52,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:52,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606901273] [2022-11-02 21:05:52,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606901273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:52,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:52,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:05:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048690019] [2022-11-02 21:05:52,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:52,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:52,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:52,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:52,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:52,332 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 360 [2022-11-02 21:05:52,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 317 transitions, 645 flow. Second operand has 6 states, 6 states have (on average 275.8333333333333) internal successors, (1655), 6 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:52,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:52,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 360 [2022-11-02 21:05:52,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:16,433 INFO L130 PetriNetUnfolder]: 48809/124317 cut-off events. [2022-11-02 21:06:16,433 INFO L131 PetriNetUnfolder]: For 349/581 co-relation queries the response was YES. [2022-11-02 21:06:17,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188283 conditions, 124317 events. 48809/124317 cut-off events. For 349/581 co-relation queries the response was YES. Maximal size of possible extension queue 3063. Compared 1639097 event pairs, 42984 based on Foata normal form. 0/100417 useless extension candidates. Maximal degree in co-relation 188243. Up to 63773 conditions per place. [2022-11-02 21:06:17,886 INFO L137 encePairwiseOnDemand]: 354/360 looper letters, 71 selfloop transitions, 5 changer transitions 0/316 dead transitions. [2022-11-02 21:06:17,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 316 transitions, 795 flow [2022-11-02 21:06:17,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:06:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:06:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1721 transitions. [2022-11-02 21:06:17,894 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7967592592592593 [2022-11-02 21:06:17,895 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1721 transitions. [2022-11-02 21:06:17,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1721 transitions. [2022-11-02 21:06:17,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:17,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1721 transitions. [2022-11-02 21:06:17,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 286.8333333333333) internal successors, (1721), 6 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:17,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:17,907 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:17,907 INFO L175 Difference]: Start difference. First operand has 316 places, 317 transitions, 645 flow. Second operand 6 states and 1721 transitions. [2022-11-02 21:06:17,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 316 transitions, 795 flow [2022-11-02 21:06:17,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 316 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:17,915 INFO L231 Difference]: Finished difference. Result has 318 places, 316 transitions, 649 flow [2022-11-02 21:06:17,915 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=649, PETRI_PLACES=318, PETRI_TRANSITIONS=316} [2022-11-02 21:06:17,918 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -11 predicate places. [2022-11-02 21:06:17,919 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 316 transitions, 649 flow [2022-11-02 21:06:17,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.8333333333333) internal successors, (1655), 6 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:17,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:17,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:17,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:06:17,921 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:17,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:17,923 INFO L85 PathProgramCache]: Analyzing trace with hash 136869463, now seen corresponding path program 1 times [2022-11-02 21:06:17,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:17,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223345434] [2022-11-02 21:06:17,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:17,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:17,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:17,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223345434] [2022-11-02 21:06:17,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223345434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:17,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:17,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131154518] [2022-11-02 21:06:17,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:17,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:17,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:17,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:18,001 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 360 [2022-11-02 21:06:18,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 316 transitions, 649 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:18,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 360 [2022-11-02 21:06:18,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:18,095 INFO L130 PetriNetUnfolder]: 25/420 cut-off events. [2022-11-02 21:06:18,095 INFO L131 PetriNetUnfolder]: For 4/7 co-relation queries the response was YES. [2022-11-02 21:06:18,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 420 events. 25/420 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1491 event pairs, 12 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 473. Up to 46 conditions per place. [2022-11-02 21:06:18,101 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 18 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2022-11-02 21:06:18,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 315 transitions, 687 flow [2022-11-02 21:06:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2022-11-02 21:06:18,105 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9361111111111111 [2022-11-02 21:06:18,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2022-11-02 21:06:18,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2022-11-02 21:06:18,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:18,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2022-11-02 21:06:18,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,112 INFO L175 Difference]: Start difference. First operand has 318 places, 316 transitions, 649 flow. Second operand 3 states and 1011 transitions. [2022-11-02 21:06:18,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 315 transitions, 687 flow [2022-11-02 21:06:18,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 677 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 21:06:18,119 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 641 flow [2022-11-02 21:06:18,119 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2022-11-02 21:06:18,120 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -15 predicate places. [2022-11-02 21:06:18,120 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 641 flow [2022-11-02 21:06:18,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:18,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:18,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:06:18,122 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:18,122 INFO L85 PathProgramCache]: Analyzing trace with hash -487923768, now seen corresponding path program 1 times [2022-11-02 21:06:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:18,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625626216] [2022-11-02 21:06:18,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:18,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:18,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:18,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625626216] [2022-11-02 21:06:18,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625626216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:18,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:18,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:18,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940589455] [2022-11-02 21:06:18,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:18,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:18,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:18,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:18,384 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 360 [2022-11-02 21:06:18,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:18,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 360 [2022-11-02 21:06:18,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:18,476 INFO L130 PetriNetUnfolder]: 25/421 cut-off events. [2022-11-02 21:06:18,477 INFO L131 PetriNetUnfolder]: For 10/13 co-relation queries the response was YES. [2022-11-02 21:06:18,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 421 events. 25/421 cut-off events. For 10/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1434 event pairs, 12 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 442. Up to 46 conditions per place. [2022-11-02 21:06:18,483 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 18 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2022-11-02 21:06:18,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 314 transitions, 679 flow [2022-11-02 21:06:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2022-11-02 21:06:18,487 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9361111111111111 [2022-11-02 21:06:18,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2022-11-02 21:06:18,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2022-11-02 21:06:18,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:18,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2022-11-02 21:06:18,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,494 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,494 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 641 flow. Second operand 3 states and 1011 transitions. [2022-11-02 21:06:18,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 314 transitions, 679 flow [2022-11-02 21:06:18,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 314 transitions, 675 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:18,500 INFO L231 Difference]: Finished difference. Result has 313 places, 314 transitions, 639 flow [2022-11-02 21:06:18,501 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=313, PETRI_TRANSITIONS=314} [2022-11-02 21:06:18,502 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -16 predicate places. [2022-11-02 21:06:18,502 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 314 transitions, 639 flow [2022-11-02 21:06:18,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:18,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:18,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:06:18,503 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:18,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1516141392, now seen corresponding path program 1 times [2022-11-02 21:06:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:18,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380114576] [2022-11-02 21:06:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:18,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:18,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:18,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380114576] [2022-11-02 21:06:18,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380114576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:18,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:18,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:18,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049420491] [2022-11-02 21:06:18,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:18,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:18,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:18,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:18,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:18,560 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 360 [2022-11-02 21:06:18,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 314 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:18,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 360 [2022-11-02 21:06:18,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:18,639 INFO L130 PetriNetUnfolder]: 25/418 cut-off events. [2022-11-02 21:06:18,639 INFO L131 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2022-11-02 21:06:18,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 418 events. 25/418 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1381 event pairs, 12 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 432. Up to 45 conditions per place. [2022-11-02 21:06:18,644 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 17 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2022-11-02 21:06:18,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 313 transitions, 675 flow [2022-11-02 21:06:18,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2022-11-02 21:06:18,647 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9351851851851852 [2022-11-02 21:06:18,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1010 transitions. [2022-11-02 21:06:18,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1010 transitions. [2022-11-02 21:06:18,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:18,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1010 transitions. [2022-11-02 21:06:18,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,656 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,657 INFO L175 Difference]: Start difference. First operand has 313 places, 314 transitions, 639 flow. Second operand 3 states and 1010 transitions. [2022-11-02 21:06:18,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 313 transitions, 675 flow [2022-11-02 21:06:18,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 313 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:18,663 INFO L231 Difference]: Finished difference. Result has 312 places, 313 transitions, 637 flow [2022-11-02 21:06:18,664 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=312, PETRI_TRANSITIONS=313} [2022-11-02 21:06:18,666 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -17 predicate places. [2022-11-02 21:06:18,666 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 313 transitions, 637 flow [2022-11-02 21:06:18,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:18,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:18,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:06:18,668 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1492661848, now seen corresponding path program 1 times [2022-11-02 21:06:18,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:18,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549761031] [2022-11-02 21:06:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:18,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:18,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:18,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549761031] [2022-11-02 21:06:18,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549761031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:18,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:18,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:18,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596194442] [2022-11-02 21:06:18,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:18,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:18,715 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 360 [2022-11-02 21:06:18,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 313 transitions, 637 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:18,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 360 [2022-11-02 21:06:18,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:18,832 INFO L130 PetriNetUnfolder]: 48/713 cut-off events. [2022-11-02 21:06:18,832 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-11-02 21:06:18,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 713 events. 48/713 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3449 event pairs, 20 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 740. Up to 56 conditions per place. [2022-11-02 21:06:18,840 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 15 selfloop transitions, 1 changer transitions 0/309 dead transitions. [2022-11-02 21:06:18,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 309 transitions, 661 flow [2022-11-02 21:06:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2022-11-02 21:06:18,844 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9351851851851852 [2022-11-02 21:06:18,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1010 transitions. [2022-11-02 21:06:18,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1010 transitions. [2022-11-02 21:06:18,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:18,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1010 transitions. [2022-11-02 21:06:18,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,850 INFO L175 Difference]: Start difference. First operand has 312 places, 313 transitions, 637 flow. Second operand 3 states and 1010 transitions. [2022-11-02 21:06:18,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 309 transitions, 661 flow [2022-11-02 21:06:18,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 309 transitions, 657 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:18,856 INFO L231 Difference]: Finished difference. Result has 308 places, 309 transitions, 627 flow [2022-11-02 21:06:18,857 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=308, PETRI_TRANSITIONS=309} [2022-11-02 21:06:18,858 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -21 predicate places. [2022-11-02 21:06:18,858 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 309 transitions, 627 flow [2022-11-02 21:06:18,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:18,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:18,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:06:18,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:18,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash -547532303, now seen corresponding path program 1 times [2022-11-02 21:06:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:18,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545244861] [2022-11-02 21:06:18,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:18,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:18,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:18,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545244861] [2022-11-02 21:06:18,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545244861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:18,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:18,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:18,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034655639] [2022-11-02 21:06:18,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:18,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:18,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:18,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:18,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:18,905 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 360 [2022-11-02 21:06:18,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 309 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:18,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 360 [2022-11-02 21:06:18,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:18,979 INFO L130 PetriNetUnfolder]: 23/408 cut-off events. [2022-11-02 21:06:18,979 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-11-02 21:06:18,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 408 events. 23/408 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1429 event pairs, 6 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 424. Up to 25 conditions per place. [2022-11-02 21:06:18,985 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 14 selfloop transitions, 3 changer transitions 0/309 dead transitions. [2022-11-02 21:06:18,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 663 flow [2022-11-02 21:06:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2022-11-02 21:06:18,988 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9425925925925925 [2022-11-02 21:06:18,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1018 transitions. [2022-11-02 21:06:18,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1018 transitions. [2022-11-02 21:06:18,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:18,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1018 transitions. [2022-11-02 21:06:18,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,994 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:18,995 INFO L175 Difference]: Start difference. First operand has 308 places, 309 transitions, 627 flow. Second operand 3 states and 1018 transitions. [2022-11-02 21:06:18,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 663 flow [2022-11-02 21:06:18,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 309 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:06:19,001 INFO L231 Difference]: Finished difference. Result has 307 places, 307 transitions, 628 flow [2022-11-02 21:06:19,002 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=307, PETRI_TRANSITIONS=307} [2022-11-02 21:06:19,002 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -22 predicate places. [2022-11-02 21:06:19,002 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 307 transitions, 628 flow [2022-11-02 21:06:19,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:19,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:19,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:19,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:06:19,004 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1830243669, now seen corresponding path program 1 times [2022-11-02 21:06:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:19,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332401159] [2022-11-02 21:06:19,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:19,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:19,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:19,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332401159] [2022-11-02 21:06:19,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332401159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:19,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:19,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:19,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187233901] [2022-11-02 21:06:19,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:19,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:19,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:19,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:19,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:19,052 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 360 [2022-11-02 21:06:19,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 307 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:19,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:19,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 360 [2022-11-02 21:06:19,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:19,568 INFO L130 PetriNetUnfolder]: 460/3136 cut-off events. [2022-11-02 21:06:19,568 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-11-02 21:06:19,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 3136 events. 460/3136 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 27856 event pairs, 172 based on Foata normal form. 0/2702 useless extension candidates. Maximal degree in co-relation 3747. Up to 577 conditions per place. [2022-11-02 21:06:19,601 INFO L137 encePairwiseOnDemand]: 351/360 looper letters, 25 selfloop transitions, 3 changer transitions 0/309 dead transitions. [2022-11-02 21:06:19,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 309 transitions, 693 flow [2022-11-02 21:06:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2022-11-02 21:06:19,604 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9314814814814815 [2022-11-02 21:06:19,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1006 transitions. [2022-11-02 21:06:19,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1006 transitions. [2022-11-02 21:06:19,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:19,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1006 transitions. [2022-11-02 21:06:19,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:19,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:19,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:19,613 INFO L175 Difference]: Start difference. First operand has 307 places, 307 transitions, 628 flow. Second operand 3 states and 1006 transitions. [2022-11-02 21:06:19,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 309 transitions, 693 flow [2022-11-02 21:06:19,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 309 transitions, 687 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:19,620 INFO L231 Difference]: Finished difference. Result has 302 places, 304 transitions, 631 flow [2022-11-02 21:06:19,621 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=302, PETRI_TRANSITIONS=304} [2022-11-02 21:06:19,621 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -27 predicate places. [2022-11-02 21:06:19,622 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 304 transitions, 631 flow [2022-11-02 21:06:19,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:19,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:19,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:19,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:06:19,624 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2071444295, now seen corresponding path program 1 times [2022-11-02 21:06:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:19,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630764894] [2022-11-02 21:06:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:19,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:19,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630764894] [2022-11-02 21:06:19,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630764894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:19,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:19,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:19,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417228321] [2022-11-02 21:06:19,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:19,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:19,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:19,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:19,684 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 360 [2022-11-02 21:06:19,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 304 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 333.6666666666667) internal successors, (1001), 3 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:19,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:19,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 360 [2022-11-02 21:06:19,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:19,853 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([944] thread3EXIT-->L89-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][294], [Black: 399#true, 404#true, 366#(= |#race~N~0| 0), 393#(= |#race~M~0| 0), 401#(= |#race~A~0| 0), 311#L89-7true]) [2022-11-02 21:06:19,854 INFO L383 tUnfolder$Statistics]: this new event has 260 ancestors and is cut-off event [2022-11-02 21:06:19,854 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-11-02 21:06:19,854 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-11-02 21:06:19,854 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-02 21:06:19,854 INFO L130 PetriNetUnfolder]: 69/803 cut-off events. [2022-11-02 21:06:19,854 INFO L131 PetriNetUnfolder]: For 13/44 co-relation queries the response was YES. [2022-11-02 21:06:19,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 803 events. 69/803 cut-off events. For 13/44 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3951 event pairs, 17 based on Foata normal form. 3/717 useless extension candidates. Maximal degree in co-relation 916. Up to 65 conditions per place. [2022-11-02 21:06:19,869 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 16 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2022-11-02 21:06:19,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 305 transitions, 671 flow [2022-11-02 21:06:19,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2022-11-02 21:06:19,873 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.937037037037037 [2022-11-02 21:06:19,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1012 transitions. [2022-11-02 21:06:19,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1012 transitions. [2022-11-02 21:06:19,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:19,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1012 transitions. [2022-11-02 21:06:19,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:19,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:19,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:19,879 INFO L175 Difference]: Start difference. First operand has 302 places, 304 transitions, 631 flow. Second operand 3 states and 1012 transitions. [2022-11-02 21:06:19,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 305 transitions, 671 flow [2022-11-02 21:06:20,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 305 transitions, 671 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:06:20,015 INFO L231 Difference]: Finished difference. Result has 303 places, 303 transitions, 633 flow [2022-11-02 21:06:20,016 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=303, PETRI_TRANSITIONS=303} [2022-11-02 21:06:20,016 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -26 predicate places. [2022-11-02 21:06:20,016 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 303 transitions, 633 flow [2022-11-02 21:06:20,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.6666666666667) internal successors, (1001), 3 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:20,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:20,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:20,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:06:20,017 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:20,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:20,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1539628518, now seen corresponding path program 1 times [2022-11-02 21:06:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:20,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320408644] [2022-11-02 21:06:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:20,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320408644] [2022-11-02 21:06:20,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320408644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:20,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:20,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262358997] [2022-11-02 21:06:20,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:20,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:20,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:20,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:20,079 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 360 [2022-11-02 21:06:20,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 303 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:20,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:20,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 360 [2022-11-02 21:06:20,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:20,355 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([944] thread3EXIT-->L89-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][293], [408#true, Black: 399#true, 404#true, 366#(= |#race~N~0| 0), 393#(= |#race~M~0| 0), 311#L89-7true, 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:20,355 INFO L383 tUnfolder$Statistics]: this new event has 260 ancestors and is cut-off event [2022-11-02 21:06:20,355 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-11-02 21:06:20,355 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-11-02 21:06:20,356 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-02 21:06:20,356 INFO L130 PetriNetUnfolder]: 90/897 cut-off events. [2022-11-02 21:06:20,356 INFO L131 PetriNetUnfolder]: For 37/60 co-relation queries the response was YES. [2022-11-02 21:06:20,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 897 events. 90/897 cut-off events. For 37/60 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4726 event pairs, 18 based on Foata normal form. 3/800 useless extension candidates. Maximal degree in co-relation 1040. Up to 72 conditions per place. [2022-11-02 21:06:20,377 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 14 selfloop transitions, 3 changer transitions 0/303 dead transitions. [2022-11-02 21:06:20,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 303 transitions, 669 flow [2022-11-02 21:06:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2022-11-02 21:06:20,381 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9425925925925925 [2022-11-02 21:06:20,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1018 transitions. [2022-11-02 21:06:20,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1018 transitions. [2022-11-02 21:06:20,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:20,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1018 transitions. [2022-11-02 21:06:20,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:20,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:20,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:20,389 INFO L175 Difference]: Start difference. First operand has 303 places, 303 transitions, 633 flow. Second operand 3 states and 1018 transitions. [2022-11-02 21:06:20,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 303 transitions, 669 flow [2022-11-02 21:06:20,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 303 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:20,397 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 631 flow [2022-11-02 21:06:20,398 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2022-11-02 21:06:20,398 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -28 predicate places. [2022-11-02 21:06:20,399 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 631 flow [2022-11-02 21:06:20,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:20,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:20,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:20,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:06:20,400 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1750803332, now seen corresponding path program 1 times [2022-11-02 21:06:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:20,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618133748] [2022-11-02 21:06:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:20,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:20,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618133748] [2022-11-02 21:06:20,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618133748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:20,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:20,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:06:20,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702435085] [2022-11-02 21:06:20,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:20,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:06:20,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:20,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:06:20,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:06:20,594 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 360 [2022-11-02 21:06:20,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 631 flow. Second operand has 7 states, 7 states have (on average 305.7142857142857) internal successors, (2140), 7 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:20,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:20,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 360 [2022-11-02 21:06:20,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:21,193 INFO L130 PetriNetUnfolder]: 368/1814 cut-off events. [2022-11-02 21:06:21,194 INFO L131 PetriNetUnfolder]: For 42/313 co-relation queries the response was YES. [2022-11-02 21:06:21,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2560 conditions, 1814 events. 368/1814 cut-off events. For 42/313 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 12036 event pairs, 157 based on Foata normal form. 2/1489 useless extension candidates. Maximal degree in co-relation 2517. Up to 503 conditions per place. [2022-11-02 21:06:21,224 INFO L137 encePairwiseOnDemand]: 351/360 looper letters, 64 selfloop transitions, 8 changer transitions 0/326 dead transitions. [2022-11-02 21:06:21,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 326 transitions, 833 flow [2022-11-02 21:06:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:06:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-02 21:06:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2497 transitions. [2022-11-02 21:06:21,231 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8670138888888889 [2022-11-02 21:06:21,232 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2497 transitions. [2022-11-02 21:06:21,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2497 transitions. [2022-11-02 21:06:21,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:21,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2497 transitions. [2022-11-02 21:06:21,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 312.125) internal successors, (2497), 8 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:21,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 360.0) internal successors, (3240), 9 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:21,249 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 360.0) internal successors, (3240), 9 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:21,249 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 631 flow. Second operand 8 states and 2497 transitions. [2022-11-02 21:06:21,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 326 transitions, 833 flow [2022-11-02 21:06:21,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 326 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:21,258 INFO L231 Difference]: Finished difference. Result has 309 places, 304 transitions, 661 flow [2022-11-02 21:06:21,259 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=661, PETRI_PLACES=309, PETRI_TRANSITIONS=304} [2022-11-02 21:06:21,259 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -20 predicate places. [2022-11-02 21:06:21,260 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 304 transitions, 661 flow [2022-11-02 21:06:21,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 305.7142857142857) internal successors, (2140), 7 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:21,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:21,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:21,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:06:21,262 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:21,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash -824846610, now seen corresponding path program 1 times [2022-11-02 21:06:21,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:21,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778254783] [2022-11-02 21:06:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:21,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:21,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:21,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778254783] [2022-11-02 21:06:21,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778254783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:21,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:21,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:21,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265914743] [2022-11-02 21:06:21,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:21,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:21,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:21,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:21,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:21,328 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 360 [2022-11-02 21:06:21,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 304 transitions, 661 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:21,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:21,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 360 [2022-11-02 21:06:21,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:21,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([944] thread3EXIT-->L89-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][295], [Black: 399#true, 420#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 431#true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), 401#(= |#race~A~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 311#L89-7true]) [2022-11-02 21:06:21,709 INFO L383 tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event [2022-11-02 21:06:21,709 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:21,709 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:21,710 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 21:06:21,710 INFO L130 PetriNetUnfolder]: 142/1406 cut-off events. [2022-11-02 21:06:21,710 INFO L131 PetriNetUnfolder]: For 66/108 co-relation queries the response was YES. [2022-11-02 21:06:21,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 1406 events. 142/1406 cut-off events. For 66/108 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8934 event pairs, 36 based on Foata normal form. 2/1261 useless extension candidates. Maximal degree in co-relation 1670. Up to 142 conditions per place. [2022-11-02 21:06:21,739 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 16 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2022-11-02 21:06:21,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 305 transitions, 701 flow [2022-11-02 21:06:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2022-11-02 21:06:21,743 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.937037037037037 [2022-11-02 21:06:21,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1012 transitions. [2022-11-02 21:06:21,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1012 transitions. [2022-11-02 21:06:21,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:21,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1012 transitions. [2022-11-02 21:06:21,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:21,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:21,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:21,750 INFO L175 Difference]: Start difference. First operand has 309 places, 304 transitions, 661 flow. Second operand 3 states and 1012 transitions. [2022-11-02 21:06:21,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 305 transitions, 701 flow [2022-11-02 21:06:21,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 305 transitions, 691 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 21:06:21,759 INFO L231 Difference]: Finished difference. Result has 306 places, 303 transitions, 653 flow [2022-11-02 21:06:21,760 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=306, PETRI_TRANSITIONS=303} [2022-11-02 21:06:21,760 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -23 predicate places. [2022-11-02 21:06:21,760 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 303 transitions, 653 flow [2022-11-02 21:06:21,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:21,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:21,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:21,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:06:21,762 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:21,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1796443614, now seen corresponding path program 1 times [2022-11-02 21:06:21,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:21,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737518836] [2022-11-02 21:06:21,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:21,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:21,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737518836] [2022-11-02 21:06:21,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737518836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:21,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:21,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:21,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825710019] [2022-11-02 21:06:21,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:21,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:21,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:21,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:21,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:21,826 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 360 [2022-11-02 21:06:21,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 303 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:21,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:21,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 360 [2022-11-02 21:06:21,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:22,198 INFO L130 PetriNetUnfolder]: 161/1350 cut-off events. [2022-11-02 21:06:22,198 INFO L131 PetriNetUnfolder]: For 110/131 co-relation queries the response was YES. [2022-11-02 21:06:22,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 1350 events. 161/1350 cut-off events. For 110/131 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 8805 event pairs, 31 based on Foata normal form. 8/1220 useless extension candidates. Maximal degree in co-relation 1616. Up to 134 conditions per place. [2022-11-02 21:06:22,220 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 12 selfloop transitions, 2 changer transitions 9/303 dead transitions. [2022-11-02 21:06:22,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 303 transitions, 687 flow [2022-11-02 21:06:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2022-11-02 21:06:22,224 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2022-11-02 21:06:22,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1017 transitions. [2022-11-02 21:06:22,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1017 transitions. [2022-11-02 21:06:22,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:22,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1017 transitions. [2022-11-02 21:06:22,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:22,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:22,230 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:22,231 INFO L175 Difference]: Start difference. First operand has 306 places, 303 transitions, 653 flow. Second operand 3 states and 1017 transitions. [2022-11-02 21:06:22,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 303 transitions, 687 flow [2022-11-02 21:06:22,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 303 transitions, 683 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:22,238 INFO L231 Difference]: Finished difference. Result has 304 places, 292 transitions, 630 flow [2022-11-02 21:06:22,239 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=304, PETRI_TRANSITIONS=292} [2022-11-02 21:06:22,240 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -25 predicate places. [2022-11-02 21:06:22,240 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 292 transitions, 630 flow [2022-11-02 21:06:22,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:22,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:22,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:22,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:06:22,241 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1057160726, now seen corresponding path program 1 times [2022-11-02 21:06:22,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:22,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031660615] [2022-11-02 21:06:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031660615] [2022-11-02 21:06:22,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031660615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:22,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:22,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:06:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251131553] [2022-11-02 21:06:22,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:22,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:22,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:22,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:22,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:22,757 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 360 [2022-11-02 21:06:22,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 292 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:22,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:22,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 360 [2022-11-02 21:06:22,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:39,281 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([852] L56-4-->L56-5: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][211], [435#true, 34#L48-5true, Black: 399#true, 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 228#L85-4true, Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0), 439#true]) [2022-11-02 21:06:39,281 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-02 21:06:39,282 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 21:06:39,282 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-02 21:06:39,282 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-02 21:06:39,930 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 62#L87-7true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:39,930 INFO L383 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-11-02 21:06:39,930 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-02 21:06:39,930 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-02 21:06:39,930 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-02 21:06:39,931 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 21#L88-2true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:39,931 INFO L383 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-11-02 21:06:39,931 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 21:06:39,931 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 21:06:39,931 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-02 21:06:40,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0), 258#L88-3true]) [2022-11-02 21:06:40,189 INFO L383 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-11-02 21:06:40,189 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 21:06:40,190 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 21:06:40,190 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-02 21:06:40,788 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 366#(= |#race~N~0| 0), 344#L88-4true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:40,788 INFO L383 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-11-02 21:06:40,788 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 21:06:40,788 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-02 21:06:40,788 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-02 21:06:41,257 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 303#L88-5true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:41,257 INFO L383 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-11-02 21:06:41,257 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-02 21:06:41,257 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-02 21:06:41,257 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-02 21:06:42,009 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 72#ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACEtrue, 324#L64-8true, Black: 399#true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:42,009 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-02 21:06:42,009 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:42,010 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:42,010 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-02 21:06:42,010 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 366#(= |#race~N~0| 0), 91#L88-6true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:42,010 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-02 21:06:42,010 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-02 21:06:42,011 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:42,011 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:43,958 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 366#(= |#race~N~0| 0), 62#L87-7true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:43,958 INFO L383 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-11-02 21:06:43,958 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-02 21:06:43,958 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-02 21:06:43,958 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-02 21:06:43,958 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-02 21:06:44,968 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 21#L88-2true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:44,969 INFO L383 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-11-02 21:06:44,969 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 21:06:44,969 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 21:06:44,969 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 21:06:44,969 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-02 21:06:45,515 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0), 258#L88-3true]) [2022-11-02 21:06:45,516 INFO L383 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-11-02 21:06:45,516 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 21:06:45,516 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 21:06:45,516 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 21:06:45,516 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-02 21:06:45,784 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 366#(= |#race~N~0| 0), 344#L88-4true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:45,784 INFO L383 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-11-02 21:06:45,784 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 21:06:45,784 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-02 21:06:45,785 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-02 21:06:45,785 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-02 21:06:46,057 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 303#L88-5true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:46,057 INFO L383 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-11-02 21:06:46,057 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-02 21:06:46,057 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-02 21:06:46,057 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-02 21:06:46,058 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-02 21:06:46,312 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 72#ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACEtrue, Black: 399#true, 324#L64-8true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:46,312 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-02 21:06:46,313 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:46,313 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:46,313 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-02 21:06:46,313 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:46,313 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 70#L56-5true, 91#L88-6true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:46,313 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-02 21:06:46,313 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:46,313 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-02 21:06:46,314 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:46,314 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 21:06:46,641 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([804] L48-4-->L48-5: Formula: (= |v_#race~A~0_1| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_1|} AuxVars[] AssignedVars[#race~A~0][257], [437#(= |#race~sorted3~0| 0), 70#L56-5true, 366#(= |#race~N~0| 0), 328#L64-5true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 34#L48-5true, Black: 399#true, 200#L86-4true, 393#(= |#race~M~0| 0), 401#(= |#race~A~0| 0), 439#true]) [2022-11-02 21:06:46,641 INFO L383 tUnfolder$Statistics]: this new event has 223 ancestors and is cut-off event [2022-11-02 21:06:46,641 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-02 21:06:46,641 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-02 21:06:46,641 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 21:06:46,695 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([903] L64-4-->L64-5: Formula: (= |v_#race~A~0_13| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_13|} AuxVars[] AssignedVars[#race~A~0][204], [437#(= |#race~sorted3~0| 0), 70#L56-5true, 328#L64-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 34#L48-5true, Black: 399#true, 200#L86-4true, 393#(= |#race~M~0| 0), 401#(= |#race~A~0| 0), 439#true]) [2022-11-02 21:06:46,695 INFO L383 tUnfolder$Statistics]: this new event has 223 ancestors and is cut-off event [2022-11-02 21:06:46,695 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-02 21:06:46,695 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 21:06:46,695 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-02 21:06:48,514 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), 92#L88-7true, Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:48,514 INFO L383 tUnfolder$Statistics]: this new event has 237 ancestors and is cut-off event [2022-11-02 21:06:48,514 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-02 21:06:48,514 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-02 21:06:48,514 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 21:06:48,528 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 100#L89-2true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:48,528 INFO L383 tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event [2022-11-02 21:06:48,528 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-02 21:06:48,528 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-02 21:06:48,528 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-02 21:06:48,532 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 366#(= |#race~N~0| 0), 71#L89-3true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:48,532 INFO L383 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-11-02 21:06:48,532 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-02 21:06:48,532 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-02 21:06:48,532 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-02 21:06:48,535 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 309#L89-4true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:48,536 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-02 21:06:48,536 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-02 21:06:48,536 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-02 21:06:48,536 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-02 21:06:48,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), 333#L89-5true, Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:48,540 INFO L383 tUnfolder$Statistics]: this new event has 243 ancestors and is cut-off event [2022-11-02 21:06:48,540 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-02 21:06:48,540 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-02 21:06:48,541 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-02 21:06:48,544 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 241#ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACEtrue, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:48,544 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-02 21:06:48,544 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-02 21:06:48,544 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-02 21:06:48,544 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-02 21:06:48,544 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 9#L89-6true, 324#L64-8true, Black: 399#true, 444#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-02 21:06:48,544 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-02 21:06:48,544 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-02 21:06:48,545 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-02 21:06:48,545 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-02 21:06:48,548 INFO L130 PetriNetUnfolder]: 58890/110037 cut-off events. [2022-11-02 21:06:48,548 INFO L131 PetriNetUnfolder]: For 112/3933 co-relation queries the response was YES. [2022-11-02 21:06:49,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192980 conditions, 110037 events. 58890/110037 cut-off events. For 112/3933 co-relation queries the response was YES. Maximal size of possible extension queue 2603. Compared 1129561 event pairs, 12868 based on Foata normal form. 108/96121 useless extension candidates. Maximal degree in co-relation 192934. Up to 29692 conditions per place. [2022-11-02 21:06:49,632 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 207 selfloop transitions, 4 changer transitions 0/435 dead transitions. [2022-11-02 21:06:49,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 435 transitions, 1338 flow [2022-11-02 21:06:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:06:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:06:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1886 transitions. [2022-11-02 21:06:49,638 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8731481481481481 [2022-11-02 21:06:49,638 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1886 transitions. [2022-11-02 21:06:49,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1886 transitions. [2022-11-02 21:06:49,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:49,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1886 transitions. [2022-11-02 21:06:49,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 314.3333333333333) internal successors, (1886), 6 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,649 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,649 INFO L175 Difference]: Start difference. First operand has 304 places, 292 transitions, 630 flow. Second operand 6 states and 1886 transitions. [2022-11-02 21:06:49,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 435 transitions, 1338 flow [2022-11-02 21:06:49,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 435 transitions, 1334 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:49,766 INFO L231 Difference]: Finished difference. Result has 297 places, 291 transitions, 632 flow [2022-11-02 21:06:49,766 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=297, PETRI_TRANSITIONS=291} [2022-11-02 21:06:49,767 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -32 predicate places. [2022-11-02 21:06:49,767 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 291 transitions, 632 flow [2022-11-02 21:06:49,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:49,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:49,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:06:49,769 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:49,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2435023, now seen corresponding path program 1 times [2022-11-02 21:06:49,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:49,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608968992] [2022-11-02 21:06:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:49,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:49,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608968992] [2022-11-02 21:06:49,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608968992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:49,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:49,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:06:49,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636779010] [2022-11-02 21:06:49,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:49,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:06:49,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:49,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:06:49,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:06:49,897 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 360 [2022-11-02 21:06:49,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 291 transitions, 632 flow. Second operand has 5 states, 5 states have (on average 319.4) internal successors, (1597), 5 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:49,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 360 [2022-11-02 21:06:49,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:50,929 INFO L130 PetriNetUnfolder]: 508/3831 cut-off events. [2022-11-02 21:06:50,929 INFO L131 PetriNetUnfolder]: For 208/253 co-relation queries the response was YES. [2022-11-02 21:06:50,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4774 conditions, 3831 events. 508/3831 cut-off events. For 208/253 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 36519 event pairs, 275 based on Foata normal form. 0/3376 useless extension candidates. Maximal degree in co-relation 4727. Up to 590 conditions per place. [2022-11-02 21:06:50,967 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 43 selfloop transitions, 4 changer transitions 0/304 dead transitions. [2022-11-02 21:06:50,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 304 transitions, 759 flow [2022-11-02 21:06:50,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:06:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:06:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1628 transitions. [2022-11-02 21:06:50,972 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9044444444444445 [2022-11-02 21:06:50,972 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1628 transitions. [2022-11-02 21:06:50,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1628 transitions. [2022-11-02 21:06:50,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:50,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1628 transitions. [2022-11-02 21:06:50,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 325.6) internal successors, (1628), 5 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 360.0) internal successors, (2160), 6 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 360.0) internal successors, (2160), 6 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,980 INFO L175 Difference]: Start difference. First operand has 297 places, 291 transitions, 632 flow. Second operand 5 states and 1628 transitions. [2022-11-02 21:06:50,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 304 transitions, 759 flow [2022-11-02 21:06:50,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 304 transitions, 752 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 21:06:50,986 INFO L231 Difference]: Finished difference. Result has 299 places, 292 transitions, 642 flow [2022-11-02 21:06:50,987 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=642, PETRI_PLACES=299, PETRI_TRANSITIONS=292} [2022-11-02 21:06:50,987 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -30 predicate places. [2022-11-02 21:06:50,987 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 292 transitions, 642 flow [2022-11-02 21:06:50,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 319.4) internal successors, (1597), 5 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:50,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:50,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:06:50,989 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:50,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash 685906250, now seen corresponding path program 1 times [2022-11-02 21:06:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:50,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625106042] [2022-11-02 21:06:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:51,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625106042] [2022-11-02 21:06:51,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625106042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:51,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:51,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:51,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954519978] [2022-11-02 21:06:51,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:51,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:51,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:51,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:51,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:51,045 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 360 [2022-11-02 21:06:51,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 292 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:51,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 360 [2022-11-02 21:06:51,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:51,481 INFO L130 PetriNetUnfolder]: 262/2010 cut-off events. [2022-11-02 21:06:51,481 INFO L131 PetriNetUnfolder]: For 191/212 co-relation queries the response was YES. [2022-11-02 21:06:51,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2541 conditions, 2010 events. 262/2010 cut-off events. For 191/212 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 15782 event pairs, 73 based on Foata normal form. 0/1815 useless extension candidates. Maximal degree in co-relation 2495. Up to 274 conditions per place. [2022-11-02 21:06:51,514 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 13 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2022-11-02 21:06:51,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 293 transitions, 676 flow [2022-11-02 21:06:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1009 transitions. [2022-11-02 21:06:51,518 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9342592592592592 [2022-11-02 21:06:51,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1009 transitions. [2022-11-02 21:06:51,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1009 transitions. [2022-11-02 21:06:51,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:51,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1009 transitions. [2022-11-02 21:06:51,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,525 INFO L175 Difference]: Start difference. First operand has 299 places, 292 transitions, 642 flow. Second operand 3 states and 1009 transitions. [2022-11-02 21:06:51,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 293 transitions, 676 flow [2022-11-02 21:06:51,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 293 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:51,532 INFO L231 Difference]: Finished difference. Result has 298 places, 291 transitions, 639 flow [2022-11-02 21:06:51,533 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=298, PETRI_TRANSITIONS=291} [2022-11-02 21:06:51,534 INFO L287 CegarLoopForPetriNet]: 329 programPoint places, -31 predicate places. [2022-11-02 21:06:51,534 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 291 transitions, 639 flow [2022-11-02 21:06:51,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:51,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:51,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:06:51,535 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-02 21:06:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash 573558750, now seen corresponding path program 1 times [2022-11-02 21:06:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:51,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701497209] [2022-11-02 21:06:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:06:51,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:51,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701497209] [2022-11-02 21:06:51,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701497209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:51,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:51,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:06:51,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61538413] [2022-11-02 21:06:51,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:51,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:51,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:51,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:52,000 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 360 [2022-11-02 21:06:52,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 291 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:52,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:52,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 360 [2022-11-02 21:06:52,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand