./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --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 f3484ad0f1e294af3db322ca579db3d6c2f84673739aeacc5aa23080bd63a5f2
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 13:16:48,875 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 13:16:48,877 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 13:16:48,898 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 13:16:48,898 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 13:16:48,899 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 13:16:48,900 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 13:16:48,901 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 13:16:48,902 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 13:16:48,902 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 13:16:48,903 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 13:16:48,904 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 13:16:48,904 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 13:16:48,905 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 13:16:48,906 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 13:16:48,907 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 13:16:48,907 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 13:16:48,908 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 13:16:48,909 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 13:16:48,910 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 13:16:48,911 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 13:16:48,912 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 13:16:48,913 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 13:16:48,914 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 13:16:48,916 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 13:16:48,916 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 13:16:48,916 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 13:16:48,917 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 13:16:48,917 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 13:16:48,918 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 13:16:48,918 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 13:16:48,919 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 13:16:48,919 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 13:16:48,920 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 13:16:48,920 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 13:16:48,920 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 13:16:48,921 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 13:16:48,921 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 13:16:48,921 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 13:16:48,922 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 13:16:48,922 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 13:16:48,923 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 13:16:48,941 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 13:16:48,942 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 13:16:48,942 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 13:16:48,942 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 13:16:48,942 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 13:16:48,943 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 13:16:48,943 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 13:16:48,943 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 13:16:48,943 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 13:16:48,943 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 13:16:48,943 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 13:16:48,944 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 13:16:48,944 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 13:16:48,944 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 13:16:48,944 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 13:16:48,944 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 13:16:48,944 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 13:16:48,944 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 13:16:48,944 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 13:16:48,944 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 13:16:48,944 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 13:16:48,944 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 13:16:48,945 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 13:16:48,945 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 13:16:48,945 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 13:16:48,945 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 13:16:48,945 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:16:48,945 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 13:16:48,945 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 13:16:48,945 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 13:16:48,945 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 13:16:48,946 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 13:16:48,946 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 13:16:48,946 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 13:16:48,946 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 13:16:48,946 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 13:16:48,946 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 13:16:48,946 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/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 -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
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 -> f3484ad0f1e294af3db322ca579db3d6c2f84673739aeacc5aa23080bd63a5f2
[2023-11-03 13:16:49,156 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 13:16:49,178 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 13:16:49,180 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 13:16:49,181 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 13:16:49,183 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 13:16:49,184 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic.i
[2023-11-03 13:16:50,256 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 13:16:50,437 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 13:16:50,437 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic.i
[2023-11-03 13:16:50,448 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/b6b64f0b5/8619e186e30a4d4894fcc9953b22fbbb/FLAGf7145633e
[2023-11-03 13:16:50,811 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/b6b64f0b5/8619e186e30a4d4894fcc9953b22fbbb
[2023-11-03 13:16:50,813 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 13:16:50,814 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 13:16:50,815 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 13:16:50,815 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 13:16:50,818 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 13:16:50,819 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:16:50" (1/1) ...
[2023-11-03 13:16:50,820 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dedede0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:50, skipping insertion in model container
[2023-11-03 13:16:50,820 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:16:50" (1/1) ...
[2023-11-03 13:16:50,826 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 13:16:50,862 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 13:16:50,988 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 13:16:51,124 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:16:51,133 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 13:16:51,144 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 13:16:51,170 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:16:51,210 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 13:16:51,210 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51 WrapperNode
[2023-11-03 13:16:51,210 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 13:16:51,211 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 13:16:51,211 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 13:16:51,211 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 13:16:51,217 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (1/1) ...
[2023-11-03 13:16:51,233 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (1/1) ...
[2023-11-03 13:16:51,252 INFO  L138                Inliner]: procedures = 269, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84
[2023-11-03 13:16:51,253 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 13:16:51,253 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 13:16:51,254 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 13:16:51,254 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 13:16:51,261 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (1/1) ...
[2023-11-03 13:16:51,261 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (1/1) ...
[2023-11-03 13:16:51,265 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (1/1) ...
[2023-11-03 13:16:51,265 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (1/1) ...
[2023-11-03 13:16:51,272 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (1/1) ...
[2023-11-03 13:16:51,275 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (1/1) ...
[2023-11-03 13:16:51,277 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (1/1) ...
[2023-11-03 13:16:51,278 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (1/1) ...
[2023-11-03 13:16:51,281 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 13:16:51,281 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 13:16:51,282 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 13:16:51,282 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 13:16:51,282 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (1/1) ...
[2023-11-03 13:16:51,288 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:16:51,296 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:16:51,309 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-03 13:16:51,312 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-03 13:16:51,338 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 13:16:51,339 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 13:16:51,339 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 13:16:51,339 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 13:16:51,339 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 13:16:51,339 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 13:16:51,339 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-03 13:16:51,339 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 13:16:51,339 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-03 13:16:51,340 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-03 13:16:51,340 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 13:16:51,340 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 13:16:51,340 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 13:16:51,340 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 13:16:51,341 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 13:16:51,468 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 13:16:51,470 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 13:16:51,672 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 13:16:51,678 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 13:16:51,679 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 13:16:51,680 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:16:51 BoogieIcfgContainer
[2023-11-03 13:16:51,680 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 13:16:51,682 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 13:16:51,682 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 13:16:51,685 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 13:16:51,685 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:16:50" (1/3) ...
[2023-11-03 13:16:51,685 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e75a377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:16:51, skipping insertion in model container
[2023-11-03 13:16:51,686 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:51" (2/3) ...
[2023-11-03 13:16:51,686 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e75a377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:16:51, skipping insertion in model container
[2023-11-03 13:16:51,686 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:16:51" (3/3) ...
[2023-11-03 13:16:51,687 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic.i
[2023-11-03 13:16:51,693 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 13:16:51,701 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 13:16:51,702 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2023-11-03 13:16:51,702 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 13:16:51,743 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 13:16:51,769 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:51,816 INFO  L130       PetriNetUnfolder]: 6/158 cut-off events.
[2023-11-03 13:16:51,816 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:16:51,820 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164 conditions, 158 events. 6/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 302 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2023-11-03 13:16:51,820 INFO  L82        GeneralOperation]: Start removeDead. Operand has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:51,824 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:51,827 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:16:51,834 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:51,836 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:51,837 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:51,865 INFO  L130       PetriNetUnfolder]: 6/158 cut-off events.
[2023-11-03 13:16:51,880 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:16:51,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164 conditions, 158 events. 6/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 302 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2023-11-03 13:16:51,885 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1568
[2023-11-03 13:16:56,530 INFO  L134        LiptonReduction]: Checked pairs total: 2097
[2023-11-03 13:16:56,531 INFO  L136        LiptonReduction]: Total number of compositions: 105
[2023-11-03 13:16:56,547 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:16:56,554 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;@55ecd5dc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:16:56,554 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-11-03 13:16:56,557 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:16:56,557 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:16:56,558 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:16:56,558 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:16:56,559 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 13:16:56,564 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:16:56,565 INFO  L85        PathProgramCache]: Analyzing trace with hash 12504, now seen corresponding path program 1 times
[2023-11-03 13:16:56,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:16:56,573 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799893122]
[2023-11-03 13:16:56,573 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:16:56,573 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:16:56,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:16:56,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:16:56,701 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:16:56,701 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799893122]
[2023-11-03 13:16:56,702 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799893122] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:16:56,702 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:16:56,702 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:16:56,703 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138940965]
[2023-11-03 13:16:56,704 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:16:56,711 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:16:56,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:16:56,728 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:16:56,730 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:16:56,731 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 214
[2023-11-03 13:16:56,733 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 50 flow. Second operand  has 2 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:56,734 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:16:56,734 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 214
[2023-11-03 13:16:56,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:16:56,798 INFO  L130       PetriNetUnfolder]: 19/66 cut-off events.
[2023-11-03 13:16:56,798 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:16:56,798 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127 conditions, 66 events. 19/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 206 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 99. Up to 55 conditions per place. 
[2023-11-03 13:16:56,800 INFO  L137   encePairwiseOnDemand]: 210/214 looper letters, 13 selfloop transitions, 0 changer transitions 0/17 dead transitions.
[2023-11-03 13:16:56,800 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 17 transitions, 68 flow
[2023-11-03 13:16:56,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:16:56,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:16:56,809 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 225 transitions.
[2023-11-03 13:16:56,811 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5257009345794392
[2023-11-03 13:16:56,811 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 225 transitions.
[2023-11-03 13:16:56,811 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 225 transitions.
[2023-11-03 13:16:56,812 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:16:56,814 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 225 transitions.
[2023-11-03 13:16:56,816 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:56,820 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:56,820 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:56,821 INFO  L175             Difference]: Start difference. First operand has 23 places, 21 transitions, 50 flow. Second operand 2 states and 225 transitions.
[2023-11-03 13:16:56,822 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 17 transitions, 68 flow
[2023-11-03 13:16:56,824 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:16:56,825 INFO  L231             Difference]: Finished difference. Result has 20 places, 17 transitions, 42 flow
[2023-11-03 13:16:56,826 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=20, PETRI_TRANSITIONS=17}
[2023-11-03 13:16:56,829 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, -3 predicate places.
[2023-11-03 13:16:56,829 INFO  L495      AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 42 flow
[2023-11-03 13:16:56,829 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:56,829 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:16:56,829 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:16:56,830 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 13:16:56,830 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 13:16:56,830 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:16:56,830 INFO  L85        PathProgramCache]: Analyzing trace with hash 11981218, now seen corresponding path program 1 times
[2023-11-03 13:16:56,831 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:16:56,831 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738618829]
[2023-11-03 13:16:56,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:16:56,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:16:56,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:16:56,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:16:56,887 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:16:56,887 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738618829]
[2023-11-03 13:16:56,887 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738618829] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:16:56,887 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:16:56,887 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:16:56,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187765142]
[2023-11-03 13:16:56,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:16:56,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:16:56,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:16:56,889 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:16:56,889 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:16:56,900 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 214
[2023-11-03 13:16:56,901 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 42 flow. Second operand  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:56,901 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:16:56,901 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 214
[2023-11-03 13:16:56,901 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:16:56,981 INFO  L130       PetriNetUnfolder]: 24/81 cut-off events.
[2023-11-03 13:16:56,981 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:16:56,982 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 161 conditions, 81 events. 24/81 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 280 event pairs, 13 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 157. Up to 50 conditions per place. 
[2023-11-03 13:16:56,982 INFO  L137   encePairwiseOnDemand]: 210/214 looper letters, 14 selfloop transitions, 3 changer transitions 3/22 dead transitions.
[2023-11-03 13:16:56,982 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 92 flow
[2023-11-03 13:16:56,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:16:56,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:16:56,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions.
[2023-11-03 13:16:56,986 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5
[2023-11-03 13:16:56,987 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 321 transitions.
[2023-11-03 13:16:56,987 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions.
[2023-11-03 13:16:56,988 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:16:56,988 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions.
[2023-11-03 13:16:56,990 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:56,992 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:56,993 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:56,993 INFO  L175             Difference]: Start difference. First operand has 20 places, 17 transitions, 42 flow. Second operand 3 states and 321 transitions.
[2023-11-03 13:16:56,993 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 22 transitions, 92 flow
[2023-11-03 13:16:56,994 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:16:56,994 INFO  L231             Difference]: Finished difference. Result has 24 places, 17 transitions, 57 flow
[2023-11-03 13:16:56,994 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=24, PETRI_TRANSITIONS=17}
[2023-11-03 13:16:56,995 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, 1 predicate places.
[2023-11-03 13:16:56,995 INFO  L495      AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 57 flow
[2023-11-03 13:16:56,995 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:56,996 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:16:56,996 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-11-03 13:16:56,996 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 13:16:56,996 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 13:16:56,996 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:16:56,996 INFO  L85        PathProgramCache]: Analyzing trace with hash -1330178479, now seen corresponding path program 1 times
[2023-11-03 13:16:56,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:16:56,997 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039018221]
[2023-11-03 13:16:56,997 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:16:56,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:16:57,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:16:57,035 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:16:57,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:16:57,067 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:16:57,067 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:16:57,068 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2023-11-03 13:16:57,069 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-11-03 13:16:57,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2023-11-03 13:16:57,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2023-11-03 13:16:57,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-11-03 13:16:57,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-11-03 13:16:57,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-11-03 13:16:57,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-11-03 13:16:57,071 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 13:16:57,071 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-11-03 13:16:57,073 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:16:57,073 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 13:16:57,087 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-03 13:16:57,090 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:57,111 INFO  L130       PetriNetUnfolder]: 11/276 cut-off events.
[2023-11-03 13:16:57,112 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 13:16:57,112 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290 conditions, 276 events. 11/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 636 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. 
[2023-11-03 13:16:57,112 INFO  L82        GeneralOperation]: Start removeDead. Operand has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:57,113 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:57,113 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:16:57,114 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:57,114 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:57,114 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:57,133 INFO  L130       PetriNetUnfolder]: 11/276 cut-off events.
[2023-11-03 13:16:57,133 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 13:16:57,134 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290 conditions, 276 events. 11/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 636 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. 
[2023-11-03 13:16:57,136 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3892
[2023-11-03 13:17:01,331 INFO  L134        LiptonReduction]: Checked pairs total: 7634
[2023-11-03 13:17:01,332 INFO  L136        LiptonReduction]: Total number of compositions: 107
[2023-11-03 13:17:01,335 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:17:01,337 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;@55ecd5dc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:17:01,337 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-11-03 13:17:01,351 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-11-03 13:17:01,352 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:17:01,352 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:01,352 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:17:01,352 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:17:01,352 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:01,353 INFO  L85        PathProgramCache]: Analyzing trace with hash 20441, now seen corresponding path program 1 times
[2023-11-03 13:17:01,353 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:01,353 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692390049]
[2023-11-03 13:17:01,353 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:01,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:01,361 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:01,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:01,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:01,368 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692390049]
[2023-11-03 13:17:01,368 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692390049] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:01,369 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:01,369 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:17:01,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406673616]
[2023-11-03 13:17:01,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:01,369 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:17:01,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:01,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:17:01,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:17:01,370 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 232
[2023-11-03 13:17:01,370 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 84 flow. Second operand  has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:01,371 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:01,371 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 232
[2023-11-03 13:17:01,371 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:01,477 INFO  L130       PetriNetUnfolder]: 378/759 cut-off events.
[2023-11-03 13:17:01,478 INFO  L131       PetriNetUnfolder]: For 38/38 co-relation queries the response was YES.
[2023-11-03 13:17:01,479 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 759 events. 378/759 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3813 event pairs, 371 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 519. Up to 666 conditions per place. 
[2023-11-03 13:17:01,482 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 21 selfloop transitions, 0 changer transitions 0/29 dead transitions.
[2023-11-03 13:17:01,482 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 118 flow
[2023-11-03 13:17:01,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:17:01,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:17:01,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions.
[2023-11-03 13:17:01,484 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5625
[2023-11-03 13:17:01,484 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 261 transitions.
[2023-11-03 13:17:01,484 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 261 transitions.
[2023-11-03 13:17:01,484 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:01,484 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 261 transitions.
[2023-11-03 13:17:01,485 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:01,487 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:01,487 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:01,487 INFO  L175             Difference]: Start difference. First operand has 36 places, 33 transitions, 84 flow. Second operand 2 states and 261 transitions.
[2023-11-03 13:17:01,487 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 118 flow
[2023-11-03 13:17:01,488 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:17:01,488 INFO  L231             Difference]: Finished difference. Result has 33 places, 29 transitions, 76 flow
[2023-11-03 13:17:01,488 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=29}
[2023-11-03 13:17:01,489 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places.
[2023-11-03 13:17:01,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 76 flow
[2023-11-03 13:17:01,490 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:01,490 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:01,490 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:17:01,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 13:17:01,490 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:17:01,490 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:01,490 INFO  L85        PathProgramCache]: Analyzing trace with hash 19618577, now seen corresponding path program 1 times
[2023-11-03 13:17:01,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:01,491 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565121780]
[2023-11-03 13:17:01,491 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:01,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:01,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:01,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:01,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:01,519 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565121780]
[2023-11-03 13:17:01,519 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565121780] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:01,519 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:01,519 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:17:01,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694655296]
[2023-11-03 13:17:01,519 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:01,520 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:17:01,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:01,520 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:17:01,520 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:17:01,535 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 232
[2023-11-03 13:17:01,536 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 76 flow. Second operand  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:01,536 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:01,536 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 232
[2023-11-03 13:17:01,536 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:01,693 INFO  L130       PetriNetUnfolder]: 679/1281 cut-off events.
[2023-11-03 13:17:01,693 INFO  L131       PetriNetUnfolder]: For 42/42 co-relation queries the response was YES.
[2023-11-03 13:17:01,695 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2525 conditions, 1281 events. 679/1281 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6792 event pairs, 416 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 2520. Up to 850 conditions per place. 
[2023-11-03 13:17:01,699 INFO  L137   encePairwiseOnDemand]: 227/232 looper letters, 32 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2023-11-03 13:17:01,699 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 172 flow
[2023-11-03 13:17:01,699 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:01,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:01,700 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions.
[2023-11-03 13:17:01,700 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5402298850574713
[2023-11-03 13:17:01,701 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 376 transitions.
[2023-11-03 13:17:01,701 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions.
[2023-11-03 13:17:01,701 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:01,701 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions.
[2023-11-03 13:17:01,702 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:01,704 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:01,704 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:01,704 INFO  L175             Difference]: Start difference. First operand has 33 places, 29 transitions, 76 flow. Second operand 3 states and 376 transitions.
[2023-11-03 13:17:01,705 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 172 flow
[2023-11-03 13:17:01,705 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:17:01,706 INFO  L231             Difference]: Finished difference. Result has 37 places, 32 transitions, 106 flow
[2023-11-03 13:17:01,706 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=32}
[2023-11-03 13:17:01,707 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places.
[2023-11-03 13:17:01,707 INFO  L495      AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 106 flow
[2023-11-03 13:17:01,707 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:01,707 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:01,707 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:01,707 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 13:17:01,708 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:17:01,708 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:01,708 INFO  L85        PathProgramCache]: Analyzing trace with hash 1542766331, now seen corresponding path program 1 times
[2023-11-03 13:17:01,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:01,708 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45460962]
[2023-11-03 13:17:01,708 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:01,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:01,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:01,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:01,741 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:01,742 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45460962]
[2023-11-03 13:17:01,742 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45460962] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:01,742 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:01,743 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:17:01,743 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408360980]
[2023-11-03 13:17:01,743 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:01,744 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:17:01,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:01,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:17:01,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:17:01,759 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 232
[2023-11-03 13:17:01,760 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:01,760 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:01,760 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 232
[2023-11-03 13:17:01,760 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:01,999 INFO  L130       PetriNetUnfolder]: 739/1420 cut-off events.
[2023-11-03 13:17:02,000 INFO  L131       PetriNetUnfolder]: For 329/329 co-relation queries the response was YES.
[2023-11-03 13:17:02,001 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3150 conditions, 1420 events. 739/1420 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8161 event pairs, 430 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 3143. Up to 943 conditions per place. 
[2023-11-03 13:17:02,006 INFO  L137   encePairwiseOnDemand]: 226/232 looper letters, 35 selfloop transitions, 7 changer transitions 0/49 dead transitions.
[2023-11-03 13:17:02,006 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 242 flow
[2023-11-03 13:17:02,007 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:02,007 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:02,008 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions.
[2023-11-03 13:17:02,008 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5359195402298851
[2023-11-03 13:17:02,008 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 373 transitions.
[2023-11-03 13:17:02,008 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions.
[2023-11-03 13:17:02,008 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:02,008 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions.
[2023-11-03 13:17:02,009 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:02,011 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:02,011 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:02,011 INFO  L175             Difference]: Start difference. First operand has 37 places, 32 transitions, 106 flow. Second operand 3 states and 373 transitions.
[2023-11-03 13:17:02,011 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 242 flow
[2023-11-03 13:17:02,015 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:17:02,016 INFO  L231             Difference]: Finished difference. Result has 39 places, 37 transitions, 154 flow
[2023-11-03 13:17:02,016 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=39, PETRI_TRANSITIONS=37}
[2023-11-03 13:17:02,017 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places.
[2023-11-03 13:17:02,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 154 flow
[2023-11-03 13:17:02,017 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:02,017 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:02,017 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:02,017 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 13:17:02,018 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:17:02,018 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:02,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 446003033, now seen corresponding path program 1 times
[2023-11-03 13:17:02,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:02,018 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335369756]
[2023-11-03 13:17:02,019 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:02,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:02,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:02,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:02,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:02,115 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335369756]
[2023-11-03 13:17:02,116 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335369756] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:17:02,116 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208423789]
[2023-11-03 13:17:02,116 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:02,116 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:17:02,116 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:17:02,118 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:17:02,119 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-03 13:17:02,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:02,204 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 13:17:02,205 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:17:02,264 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:02,264 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:17:02,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:02,299 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208423789] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:17:02,299 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:17:02,299 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 13:17:02,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879247501]
[2023-11-03 13:17:02,299 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:17:02,299 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 13:17:02,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:02,300 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 13:17:02,300 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 13:17:02,408 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 232
[2023-11-03 13:17:02,409 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 154 flow. Second operand  has 9 states, 9 states have (on average 109.77777777777777) internal successors, (988), 9 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:02,409 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:02,409 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 232
[2023-11-03 13:17:02,409 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:02,711 INFO  L130       PetriNetUnfolder]: 349/722 cut-off events.
[2023-11-03 13:17:02,711 INFO  L131       PetriNetUnfolder]: For 488/560 co-relation queries the response was YES.
[2023-11-03 13:17:02,712 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 722 events. 349/722 cut-off events. For 488/560 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3600 event pairs, 88 based on Foata normal form. 84/759 useless extension candidates. Maximal degree in co-relation 1757. Up to 373 conditions per place. 
[2023-11-03 13:17:02,714 INFO  L137   encePairwiseOnDemand]: 225/232 looper letters, 42 selfloop transitions, 6 changer transitions 15/73 dead transitions.
[2023-11-03 13:17:02,715 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 400 flow
[2023-11-03 13:17:02,715 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 13:17:02,715 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 13:17:02,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 918 transitions.
[2023-11-03 13:17:02,717 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.49461206896551724
[2023-11-03 13:17:02,717 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 918 transitions.
[2023-11-03 13:17:02,717 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 918 transitions.
[2023-11-03 13:17:02,718 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:02,718 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 918 transitions.
[2023-11-03 13:17:02,720 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:02,722 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:02,723 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:02,723 INFO  L175             Difference]: Start difference. First operand has 39 places, 37 transitions, 154 flow. Second operand 8 states and 918 transitions.
[2023-11-03 13:17:02,723 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 400 flow
[2023-11-03 13:17:02,725 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:17:02,726 INFO  L231             Difference]: Finished difference. Result has 48 places, 39 transitions, 174 flow
[2023-11-03 13:17:02,726 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=39}
[2023-11-03 13:17:02,726 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places.
[2023-11-03 13:17:02,726 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 174 flow
[2023-11-03 13:17:02,727 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 109.77777777777777) internal successors, (988), 9 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:02,727 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:02,727 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-11-03 13:17:02,736 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-03 13:17:02,928 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:17:02,929 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:17:02,929 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:02,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 1638080373, now seen corresponding path program 1 times
[2023-11-03 13:17:02,930 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:02,930 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354375554]
[2023-11-03 13:17:02,930 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:02,931 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:02,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:17:02,956 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:17:02,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:17:02,982 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:17:02,982 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:17:02,982 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-11-03 13:17:02,982 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-11-03 13:17:02,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-11-03 13:17:02,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-11-03 13:17:02,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-11-03 13:17:02,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-11-03 13:17:02,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-11-03 13:17:02,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-11-03 13:17:02,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-11-03 13:17:02,984 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-03 13:17:02,984 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-11-03 13:17:02,985 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:17:02,985 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-03 13:17:03,005 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-11-03 13:17:03,008 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 142 places, 141 transitions, 312 flow
[2023-11-03 13:17:03,046 INFO  L130       PetriNetUnfolder]: 21/479 cut-off events.
[2023-11-03 13:17:03,046 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-03 13:17:03,047 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 507 conditions, 479 events. 21/479 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1408 event pairs, 1 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 284. Up to 16 conditions per place. 
[2023-11-03 13:17:03,047 INFO  L82        GeneralOperation]: Start removeDead. Operand has 142 places, 141 transitions, 312 flow
[2023-11-03 13:17:03,048 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 142 places, 141 transitions, 312 flow
[2023-11-03 13:17:03,049 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:17:03,049 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 141 transitions, 312 flow
[2023-11-03 13:17:03,049 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 141 transitions, 312 flow
[2023-11-03 13:17:03,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 142 places, 141 transitions, 312 flow
[2023-11-03 13:17:03,079 INFO  L130       PetriNetUnfolder]: 21/479 cut-off events.
[2023-11-03 13:17:03,079 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-03 13:17:03,080 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 507 conditions, 479 events. 21/479 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1408 event pairs, 1 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 284. Up to 16 conditions per place. 
[2023-11-03 13:17:03,086 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6552
[2023-11-03 13:17:06,721 INFO  L134        LiptonReduction]: Checked pairs total: 15033
[2023-11-03 13:17:06,722 INFO  L136        LiptonReduction]: Total number of compositions: 117
[2023-11-03 13:17:06,724 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:17:06,725 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;@55ecd5dc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:17:06,725 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-11-03 13:17:06,727 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:17:06,727 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:17:06,727 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:06,727 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:17:06,727 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:17:06,727 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:06,727 INFO  L85        PathProgramCache]: Analyzing trace with hash 29208, now seen corresponding path program 1 times
[2023-11-03 13:17:06,727 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:06,727 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702230157]
[2023-11-03 13:17:06,728 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:06,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:06,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:06,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:06,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:06,743 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702230157]
[2023-11-03 13:17:06,743 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702230157] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:06,743 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:06,743 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:17:06,743 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651756676]
[2023-11-03 13:17:06,743 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:06,743 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:17:06,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:06,744 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:17:06,744 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:17:06,744 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 258
[2023-11-03 13:17:06,745 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 112 flow. Second operand  has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:06,745 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:06,745 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 258
[2023-11-03 13:17:06,745 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:07,189 INFO  L130       PetriNetUnfolder]: 4046/6908 cut-off events.
[2023-11-03 13:17:07,189 INFO  L131       PetriNetUnfolder]: For 523/523 co-relation queries the response was YES.
[2023-11-03 13:17:07,198 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13286 conditions, 6908 events. 4046/6908 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 44761 event pairs, 3989 based on Foata normal form. 0/6288 useless extension candidates. Maximal degree in co-relation 1715. Up to 6005 conditions per place. 
[2023-11-03 13:17:07,219 INFO  L137   encePairwiseOnDemand]: 254/258 looper letters, 28 selfloop transitions, 0 changer transitions 0/37 dead transitions.
[2023-11-03 13:17:07,220 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 160 flow
[2023-11-03 13:17:07,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:17:07,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:17:07,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions.
[2023-11-03 13:17:07,221 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5736434108527132
[2023-11-03 13:17:07,222 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 296 transitions.
[2023-11-03 13:17:07,222 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions.
[2023-11-03 13:17:07,222 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:07,222 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions.
[2023-11-03 13:17:07,222 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:07,223 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:07,223 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:07,223 INFO  L175             Difference]: Start difference. First operand has 45 places, 41 transitions, 112 flow. Second operand 2 states and 296 transitions.
[2023-11-03 13:17:07,224 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 160 flow
[2023-11-03 13:17:07,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:17:07,225 INFO  L231             Difference]: Finished difference. Result has 42 places, 37 transitions, 104 flow
[2023-11-03 13:17:07,225 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=37}
[2023-11-03 13:17:07,226 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places.
[2023-11-03 13:17:07,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 104 flow
[2023-11-03 13:17:07,226 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:07,226 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:07,226 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:17:07,226 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-03 13:17:07,226 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:17:07,227 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:07,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 28047818, now seen corresponding path program 1 times
[2023-11-03 13:17:07,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:07,227 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980204659]
[2023-11-03 13:17:07,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:07,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:07,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:07,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:07,246 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:07,246 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980204659]
[2023-11-03 13:17:07,246 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980204659] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:07,246 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:07,246 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:17:07,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452295419]
[2023-11-03 13:17:07,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:07,247 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:17:07,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:07,247 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:17:07,247 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:17:07,262 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 258
[2023-11-03 13:17:07,262 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 104 flow. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:07,263 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:07,263 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 258
[2023-11-03 13:17:07,263 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:07,934 INFO  L130       PetriNetUnfolder]: 7618/11966 cut-off events.
[2023-11-03 13:17:07,935 INFO  L131       PetriNetUnfolder]: For 565/565 co-relation queries the response was YES.
[2023-11-03 13:17:07,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23707 conditions, 11966 events. 7618/11966 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 74599 event pairs, 4897 based on Foata normal form. 0/11078 useless extension candidates. Maximal degree in co-relation 23701. Up to 8281 conditions per place. 
[2023-11-03 13:17:07,981 INFO  L137   encePairwiseOnDemand]: 252/258 looper letters, 43 selfloop transitions, 5 changer transitions 0/54 dead transitions.
[2023-11-03 13:17:07,981 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 234 flow
[2023-11-03 13:17:07,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:07,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:07,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions.
[2023-11-03 13:17:07,983 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5516795865633075
[2023-11-03 13:17:07,983 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 427 transitions.
[2023-11-03 13:17:07,983 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions.
[2023-11-03 13:17:07,984 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:07,984 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions.
[2023-11-03 13:17:07,985 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:07,986 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:07,986 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:07,986 INFO  L175             Difference]: Start difference. First operand has 42 places, 37 transitions, 104 flow. Second operand 3 states and 427 transitions.
[2023-11-03 13:17:07,986 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 234 flow
[2023-11-03 13:17:07,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:17:07,988 INFO  L231             Difference]: Finished difference. Result has 46 places, 41 transitions, 142 flow
[2023-11-03 13:17:07,988 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=41}
[2023-11-03 13:17:07,989 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places.
[2023-11-03 13:17:07,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 142 flow
[2023-11-03 13:17:07,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:07,989 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:07,989 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:07,989 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-03 13:17:07,990 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:17:07,990 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:07,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -561427542, now seen corresponding path program 1 times
[2023-11-03 13:17:07,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:07,990 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714184512]
[2023-11-03 13:17:07,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:07,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:08,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:08,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:08,019 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:08,020 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714184512]
[2023-11-03 13:17:08,020 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714184512] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:08,020 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:08,020 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:17:08,020 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421369390]
[2023-11-03 13:17:08,020 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:08,020 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:17:08,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:08,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:17:08,021 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:17:08,038 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 258
[2023-11-03 13:17:08,039 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 142 flow. Second operand  has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:08,039 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:08,039 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 258
[2023-11-03 13:17:08,039 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:08,999 INFO  L130       PetriNetUnfolder]: 9026/14329 cut-off events.
[2023-11-03 13:17:08,999 INFO  L131       PetriNetUnfolder]: For 3704/3704 co-relation queries the response was YES.
[2023-11-03 13:17:09,013 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32011 conditions, 14329 events. 9026/14329 cut-off events. For 3704/3704 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 96129 event pairs, 5597 based on Foata normal form. 0/13293 useless extension candidates. Maximal degree in co-relation 32003. Up to 10164 conditions per place. 
[2023-11-03 13:17:09,044 INFO  L137   encePairwiseOnDemand]: 251/258 looper letters, 49 selfloop transitions, 9 changer transitions 0/66 dead transitions.
[2023-11-03 13:17:09,044 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 342 flow
[2023-11-03 13:17:09,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:09,045 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:09,046 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions.
[2023-11-03 13:17:09,046 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5503875968992248
[2023-11-03 13:17:09,046 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 426 transitions.
[2023-11-03 13:17:09,046 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions.
[2023-11-03 13:17:09,046 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:09,046 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions.
[2023-11-03 13:17:09,047 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:09,048 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:09,048 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:09,048 INFO  L175             Difference]: Start difference. First operand has 46 places, 41 transitions, 142 flow. Second operand 3 states and 426 transitions.
[2023-11-03 13:17:09,048 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 342 flow
[2023-11-03 13:17:09,086 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:17:09,087 INFO  L231             Difference]: Finished difference. Result has 48 places, 48 transitions, 208 flow
[2023-11-03 13:17:09,087 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=48}
[2023-11-03 13:17:09,087 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2023-11-03 13:17:09,087 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 208 flow
[2023-11-03 13:17:09,088 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:09,088 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:09,088 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:09,088 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-03 13:17:09,088 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:17:09,088 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:09,088 INFO  L85        PathProgramCache]: Analyzing trace with hash 1236224548, now seen corresponding path program 1 times
[2023-11-03 13:17:09,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:09,089 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884171228]
[2023-11-03 13:17:09,089 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:09,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:09,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:09,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 13:17:09,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:09,116 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884171228]
[2023-11-03 13:17:09,116 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884171228] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:09,116 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:09,116 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:17:09,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458763338]
[2023-11-03 13:17:09,117 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:09,117 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:17:09,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:09,117 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:17:09,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:17:09,134 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 258
[2023-11-03 13:17:09,135 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 208 flow. Second operand  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:09,135 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:09,135 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 258
[2023-11-03 13:17:09,135 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:10,252 INFO  L130       PetriNetUnfolder]: 10424/16453 cut-off events.
[2023-11-03 13:17:10,253 INFO  L131       PetriNetUnfolder]: For 11988/12245 co-relation queries the response was YES.
[2023-11-03 13:17:10,319 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42592 conditions, 16453 events. 10424/16453 cut-off events. For 11988/12245 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 111846 event pairs, 6862 based on Foata normal form. 0/15065 useless extension candidates. Maximal degree in co-relation 42583. Up to 13676 conditions per place. 
[2023-11-03 13:17:10,357 INFO  L137   encePairwiseOnDemand]: 252/258 looper letters, 54 selfloop transitions, 13 changer transitions 0/75 dead transitions.
[2023-11-03 13:17:10,357 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 461 flow
[2023-11-03 13:17:10,358 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:10,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:10,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions.
[2023-11-03 13:17:10,359 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5478036175710594
[2023-11-03 13:17:10,359 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 424 transitions.
[2023-11-03 13:17:10,359 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions.
[2023-11-03 13:17:10,359 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:10,359 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions.
[2023-11-03 13:17:10,360 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:10,361 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:10,361 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:10,361 INFO  L175             Difference]: Start difference. First operand has 48 places, 48 transitions, 208 flow. Second operand 3 states and 424 transitions.
[2023-11-03 13:17:10,361 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 461 flow
[2023-11-03 13:17:10,404 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:17:10,405 INFO  L231             Difference]: Finished difference. Result has 49 places, 57 transitions, 299 flow
[2023-11-03 13:17:10,405 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=49, PETRI_TRANSITIONS=57}
[2023-11-03 13:17:10,406 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places.
[2023-11-03 13:17:10,406 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 57 transitions, 299 flow
[2023-11-03 13:17:10,406 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:10,406 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:10,406 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:10,406 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-03 13:17:10,406 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:17:10,407 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:10,407 INFO  L85        PathProgramCache]: Analyzing trace with hash -142466151, now seen corresponding path program 1 times
[2023-11-03 13:17:10,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:10,407 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152493569]
[2023-11-03 13:17:10,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:10,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:10,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:10,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:10,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:10,471 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152493569]
[2023-11-03 13:17:10,471 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152493569] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:17:10,472 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600311579]
[2023-11-03 13:17:10,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:10,472 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:17:10,472 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:17:10,473 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:17:10,475 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-03 13:17:10,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:10,548 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 13:17:10,549 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:17:10,581 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:10,581 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:17:10,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:10,604 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600311579] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:17:10,605 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:17:10,605 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 13:17:10,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422048686]
[2023-11-03 13:17:10,605 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:17:10,605 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 13:17:10,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:10,606 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 13:17:10,606 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 13:17:10,708 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 258
[2023-11-03 13:17:10,709 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 57 transitions, 299 flow. Second operand  has 9 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:10,709 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:10,709 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 258
[2023-11-03 13:17:10,709 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:11,587 INFO  L130       PetriNetUnfolder]: 5484/9134 cut-off events.
[2023-11-03 13:17:11,587 INFO  L131       PetriNetUnfolder]: For 9939/10494 co-relation queries the response was YES.
[2023-11-03 13:17:11,597 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24006 conditions, 9134 events. 5484/9134 cut-off events. For 9939/10494 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 59645 event pairs, 1935 based on Foata normal form. 465/9078 useless extension candidates. Maximal degree in co-relation 23996. Up to 4991 conditions per place. 
[2023-11-03 13:17:11,618 INFO  L137   encePairwiseOnDemand]: 251/258 looper letters, 83 selfloop transitions, 7 changer transitions 4/110 dead transitions.
[2023-11-03 13:17:11,618 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 110 transitions, 691 flow
[2023-11-03 13:17:11,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 13:17:11,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 13:17:11,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1049 transitions.
[2023-11-03 13:17:11,621 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5082364341085271
[2023-11-03 13:17:11,621 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1049 transitions.
[2023-11-03 13:17:11,621 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1049 transitions.
[2023-11-03 13:17:11,621 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:11,621 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1049 transitions.
[2023-11-03 13:17:11,623 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 131.125) internal successors, (1049), 8 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:11,625 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:11,626 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:11,626 INFO  L175             Difference]: Start difference. First operand has 49 places, 57 transitions, 299 flow. Second operand 8 states and 1049 transitions.
[2023-11-03 13:17:11,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 110 transitions, 691 flow
[2023-11-03 13:17:11,636 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 110 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:17:11,638 INFO  L231             Difference]: Finished difference. Result has 59 places, 60 transitions, 327 flow
[2023-11-03 13:17:11,638 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=59, PETRI_TRANSITIONS=60}
[2023-11-03 13:17:11,638 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places.
[2023-11-03 13:17:11,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 327 flow
[2023-11-03 13:17:11,639 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:11,639 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:11,639 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:11,646 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-03 13:17:11,839 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:17:11,840 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:17:11,841 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:11,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -966485159, now seen corresponding path program 1 times
[2023-11-03 13:17:11,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:11,842 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302577252]
[2023-11-03 13:17:11,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:11,843 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:11,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:11,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:11,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:11,928 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302577252]
[2023-11-03 13:17:11,928 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302577252] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:11,928 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:11,928 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:17:11,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171174028]
[2023-11-03 13:17:11,928 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:11,928 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:17:11,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:11,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:17:11,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:17:11,951 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 258
[2023-11-03 13:17:11,951 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 327 flow. Second operand  has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:11,951 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:11,951 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 258
[2023-11-03 13:17:11,951 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:12,181 INFO  L130       PetriNetUnfolder]: 857/2028 cut-off events.
[2023-11-03 13:17:12,181 INFO  L131       PetriNetUnfolder]: For 2448/2458 co-relation queries the response was YES.
[2023-11-03 13:17:12,184 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6098 conditions, 2028 events. 857/2028 cut-off events. For 2448/2458 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 14090 event pairs, 171 based on Foata normal form. 412/2388 useless extension candidates. Maximal degree in co-relation 6084. Up to 1380 conditions per place. 
[2023-11-03 13:17:12,187 INFO  L137   encePairwiseOnDemand]: 252/258 looper letters, 47 selfloop transitions, 7 changer transitions 0/65 dead transitions.
[2023-11-03 13:17:12,187 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 438 flow
[2023-11-03 13:17:12,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:12,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:12,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions.
[2023-11-03 13:17:12,189 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5400516795865633
[2023-11-03 13:17:12,189 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 418 transitions.
[2023-11-03 13:17:12,189 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions.
[2023-11-03 13:17:12,189 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:12,189 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions.
[2023-11-03 13:17:12,190 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:12,191 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:12,191 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:12,192 INFO  L175             Difference]: Start difference. First operand has 59 places, 60 transitions, 327 flow. Second operand 3 states and 418 transitions.
[2023-11-03 13:17:12,192 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 438 flow
[2023-11-03 13:17:12,195 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 429 flow, removed 4 selfloop flow, removed 1 redundant places.
[2023-11-03 13:17:12,196 INFO  L231             Difference]: Finished difference. Result has 59 places, 50 transitions, 252 flow
[2023-11-03 13:17:12,196 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=59, PETRI_TRANSITIONS=50}
[2023-11-03 13:17:12,196 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places.
[2023-11-03 13:17:12,197 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 252 flow
[2023-11-03 13:17:12,197 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:12,197 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:12,197 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-11-03 13:17:12,197 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-03 13:17:12,197 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 13:17:12,197 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:12,197 INFO  L85        PathProgramCache]: Analyzing trace with hash 1439577314, now seen corresponding path program 1 times
[2023-11-03 13:17:12,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:12,198 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601033649]
[2023-11-03 13:17:12,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:12,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:12,221 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:17:12,221 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:17:12,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:17:12,236 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:17:12,237 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:17:12,237 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining)
[2023-11-03 13:17:12,237 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2023-11-03 13:17:12,237 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2023-11-03 13:17:12,237 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining)
[2023-11-03 13:17:12,237 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2023-11-03 13:17:12,237 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2023-11-03 13:17:12,237 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2023-11-03 13:17:12,238 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2023-11-03 13:17:12,238 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2023-11-03 13:17:12,238 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2023-11-03 13:17:12,238 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-03 13:17:12,238 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:12,238 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:17:12,239 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-11-03 13:17:12,256 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-11-03 13:17:12,257 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 157 transitions, 358 flow
[2023-11-03 13:17:12,320 INFO  L130       PetriNetUnfolder]: 43/854 cut-off events.
[2023-11-03 13:17:12,320 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-11-03 13:17:12,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 909 conditions, 854 events. 43/854 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3381 event pairs, 6 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 499. Up to 32 conditions per place. 
[2023-11-03 13:17:12,322 INFO  L82        GeneralOperation]: Start removeDead. Operand has 159 places, 157 transitions, 358 flow
[2023-11-03 13:17:12,324 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 159 places, 157 transitions, 358 flow
[2023-11-03 13:17:12,324 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:17:12,324 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 157 transitions, 358 flow
[2023-11-03 13:17:12,324 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 157 transitions, 358 flow
[2023-11-03 13:17:12,325 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 157 transitions, 358 flow
[2023-11-03 13:17:12,386 INFO  L130       PetriNetUnfolder]: 43/854 cut-off events.
[2023-11-03 13:17:12,387 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-11-03 13:17:12,388 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 909 conditions, 854 events. 43/854 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3381 event pairs, 6 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 499. Up to 32 conditions per place. 
[2023-11-03 13:17:12,402 INFO  L119        LiptonReduction]: Number of co-enabled transitions 9688
[2023-11-03 13:17:16,177 INFO  L134        LiptonReduction]: Checked pairs total: 22671
[2023-11-03 13:17:16,177 INFO  L136        LiptonReduction]: Total number of compositions: 124
[2023-11-03 13:17:16,179 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:17:16,179 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;@55ecd5dc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:17:16,179 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-11-03 13:17:16,180 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:17:16,180 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:17:16,180 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:16,180 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:17:16,180 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:17:16,180 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:16,181 INFO  L85        PathProgramCache]: Analyzing trace with hash 38714, now seen corresponding path program 1 times
[2023-11-03 13:17:16,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:16,181 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056428525]
[2023-11-03 13:17:16,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:16,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:16,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:16,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:16,188 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:16,188 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056428525]
[2023-11-03 13:17:16,188 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056428525] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:16,188 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:16,188 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:17:16,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41727024]
[2023-11-03 13:17:16,189 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:16,189 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:17:16,189 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:16,189 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:17:16,189 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:17:16,189 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 281
[2023-11-03 13:17:16,190 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:16,190 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:16,190 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 281
[2023-11-03 13:17:16,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:19,343 INFO  L130       PetriNetUnfolder]: 36913/53898 cut-off events.
[2023-11-03 13:17:19,344 INFO  L131       PetriNetUnfolder]: For 5118/5118 co-relation queries the response was YES.
[2023-11-03 13:17:19,398 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106656 conditions, 53898 events. 36913/53898 cut-off events. For 5118/5118 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 370457 event pairs, 36570 based on Foata normal form. 0/49990 useless extension candidates. Maximal degree in co-relation 15264. Up to 50011 conditions per place. 
[2023-11-03 13:17:19,553 INFO  L137   encePairwiseOnDemand]: 277/281 looper letters, 35 selfloop transitions, 0 changer transitions 0/45 dead transitions.
[2023-11-03 13:17:19,553 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 204 flow
[2023-11-03 13:17:19,554 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:17:19,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:17:19,555 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 331 transitions.
[2023-11-03 13:17:19,555 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5889679715302492
[2023-11-03 13:17:19,555 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 331 transitions.
[2023-11-03 13:17:19,555 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 331 transitions.
[2023-11-03 13:17:19,556 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:19,556 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 331 transitions.
[2023-11-03 13:17:19,556 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:19,557 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:19,557 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:19,557 INFO  L175             Difference]: Start difference. First operand has 54 places, 49 transitions, 142 flow. Second operand 2 states and 331 transitions.
[2023-11-03 13:17:19,558 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 204 flow
[2023-11-03 13:17:19,559 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:17:19,560 INFO  L231             Difference]: Finished difference. Result has 51 places, 45 transitions, 134 flow
[2023-11-03 13:17:19,560 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=51, PETRI_TRANSITIONS=45}
[2023-11-03 13:17:19,561 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places.
[2023-11-03 13:17:19,561 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 134 flow
[2023-11-03 13:17:19,561 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:19,561 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:19,561 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:17:19,561 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-03 13:17:19,562 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:17:19,562 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:19,562 INFO  L85        PathProgramCache]: Analyzing trace with hash 37188535, now seen corresponding path program 1 times
[2023-11-03 13:17:19,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:19,562 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689124546]
[2023-11-03 13:17:19,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:19,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:19,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:19,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:19,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:19,586 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689124546]
[2023-11-03 13:17:19,586 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689124546] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:19,586 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:19,586 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:17:19,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544172250]
[2023-11-03 13:17:19,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:19,586 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:17:19,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:19,587 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:17:19,587 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:17:19,609 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 139 out of 281
[2023-11-03 13:17:19,609 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 134 flow. Second operand  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:19,609 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:19,609 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 281
[2023-11-03 13:17:19,609 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:24,987 INFO  L130       PetriNetUnfolder]: 73069/103628 cut-off events.
[2023-11-03 13:17:24,987 INFO  L131       PetriNetUnfolder]: For 5920/5920 co-relation queries the response was YES.
[2023-11-03 13:17:25,115 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 206250 conditions, 103628 events. 73069/103628 cut-off events. For 5920/5920 co-relation queries the response was YES. Maximal size of possible extension queue 2410. Compared 705793 event pairs, 48108 based on Foata normal form. 0/97521 useless extension candidates. Maximal degree in co-relation 206243. Up to 73612 conditions per place. 
[2023-11-03 13:17:25,414 INFO  L137   encePairwiseOnDemand]: 274/281 looper letters, 54 selfloop transitions, 6 changer transitions 0/67 dead transitions.
[2023-11-03 13:17:25,414 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 298 flow
[2023-11-03 13:17:25,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:25,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:25,416 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions.
[2023-11-03 13:17:25,416 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5670225385527876
[2023-11-03 13:17:25,417 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 478 transitions.
[2023-11-03 13:17:25,417 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions.
[2023-11-03 13:17:25,417 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:25,417 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions.
[2023-11-03 13:17:25,418 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:25,419 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:25,419 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:25,419 INFO  L175             Difference]: Start difference. First operand has 51 places, 45 transitions, 134 flow. Second operand 3 states and 478 transitions.
[2023-11-03 13:17:25,419 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 298 flow
[2023-11-03 13:17:25,421 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:17:25,422 INFO  L231             Difference]: Finished difference. Result has 55 places, 50 transitions, 180 flow
[2023-11-03 13:17:25,422 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=50}
[2023-11-03 13:17:25,423 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places.
[2023-11-03 13:17:25,423 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 180 flow
[2023-11-03 13:17:25,423 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:25,423 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:25,423 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:25,423 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-03 13:17:25,423 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:17:25,423 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:25,423 INFO  L85        PathProgramCache]: Analyzing trace with hash 1222044967, now seen corresponding path program 1 times
[2023-11-03 13:17:25,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:25,424 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759549864]
[2023-11-03 13:17:25,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:25,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:25,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:25,458 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:25,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:25,459 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759549864]
[2023-11-03 13:17:25,459 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759549864] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:25,459 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:25,460 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:17:25,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918975724]
[2023-11-03 13:17:25,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:25,460 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:17:25,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:25,461 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:17:25,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:17:25,488 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 281
[2023-11-03 13:17:25,488 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 180 flow. Second operand  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:25,488 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:25,488 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 281
[2023-11-03 13:17:25,488 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:32,626 INFO  L130       PetriNetUnfolder]: 89848/128539 cut-off events.
[2023-11-03 13:17:32,626 INFO  L131       PetriNetUnfolder]: For 36910/36910 co-relation queries the response was YES.
[2023-11-03 13:17:32,846 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 289520 conditions, 128539 events. 89848/128539 cut-off events. For 36910/36910 co-relation queries the response was YES. Maximal size of possible extension queue 3583. Compared 938505 event pairs, 58046 based on Foata normal form. 0/120610 useless extension candidates. Maximal degree in co-relation 289511. Up to 95069 conditions per place. 
[2023-11-03 13:17:33,240 INFO  L137   encePairwiseOnDemand]: 273/281 looper letters, 63 selfloop transitions, 11 changer transitions 0/83 dead transitions.
[2023-11-03 13:17:33,240 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 446 flow
[2023-11-03 13:17:33,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:33,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:33,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions.
[2023-11-03 13:17:33,243 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5682087781731909
[2023-11-03 13:17:33,243 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 479 transitions.
[2023-11-03 13:17:33,243 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions.
[2023-11-03 13:17:33,243 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:33,243 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions.
[2023-11-03 13:17:33,244 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:33,245 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:33,245 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:33,246 INFO  L175             Difference]: Start difference. First operand has 55 places, 50 transitions, 180 flow. Second operand 3 states and 479 transitions.
[2023-11-03 13:17:33,246 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 446 flow
[2023-11-03 13:17:35,591 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:17:35,592 INFO  L231             Difference]: Finished difference. Result has 57 places, 59 transitions, 264 flow
[2023-11-03 13:17:35,593 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=57, PETRI_TRANSITIONS=59}
[2023-11-03 13:17:35,593 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places.
[2023-11-03 13:17:35,594 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 264 flow
[2023-11-03 13:17:35,594 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:35,594 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:35,594 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:35,595 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-03 13:17:35,595 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:17:35,595 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:35,595 INFO  L85        PathProgramCache]: Analyzing trace with hash 1278256598, now seen corresponding path program 1 times
[2023-11-03 13:17:35,595 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:35,596 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618726519]
[2023-11-03 13:17:35,596 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:35,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:35,614 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:35,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:35,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:35,678 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618726519]
[2023-11-03 13:17:35,678 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618726519] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:17:35,678 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131915569]
[2023-11-03 13:17:35,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:35,678 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:17:35,678 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:17:35,680 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:17:35,681 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-03 13:17:35,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:35,770 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 13:17:35,771 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:17:35,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:35,808 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:17:35,831 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:35,832 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131915569] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:17:35,832 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:17:35,832 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 13:17:35,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480361180]
[2023-11-03 13:17:35,832 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:17:35,833 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 13:17:35,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:35,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 13:17:35,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 13:17:35,939 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 281
[2023-11-03 13:17:35,940 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 264 flow. Second operand  has 9 states, 9 states have (on average 137.77777777777777) internal successors, (1240), 9 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:35,940 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:35,940 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 281
[2023-11-03 13:17:35,940 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:40,651 INFO  L130       PetriNetUnfolder]: 51238/76185 cut-off events.
[2023-11-03 13:17:40,651 INFO  L131       PetriNetUnfolder]: For 54858/60427 co-relation queries the response was YES.
[2023-11-03 13:17:40,769 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 191019 conditions, 76185 events. 51238/76185 cut-off events. For 54858/60427 co-relation queries the response was YES. Maximal size of possible extension queue 1814. Compared 561630 event pairs, 22099 based on Foata normal form. 4007/76533 useless extension candidates. Maximal degree in co-relation 191009. Up to 45050 conditions per place. 
[2023-11-03 13:17:41,018 INFO  L137   encePairwiseOnDemand]: 274/281 looper letters, 100 selfloop transitions, 7 changer transitions 4/123 dead transitions.
[2023-11-03 13:17:41,019 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 123 transitions, 720 flow
[2023-11-03 13:17:41,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 13:17:41,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 13:17:41,021 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1178 transitions.
[2023-11-03 13:17:41,022 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5240213523131673
[2023-11-03 13:17:41,022 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1178 transitions.
[2023-11-03 13:17:41,022 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1178 transitions.
[2023-11-03 13:17:41,023 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:41,023 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1178 transitions.
[2023-11-03 13:17:41,025 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 147.25) internal successors, (1178), 8 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:41,027 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:41,027 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:41,027 INFO  L175             Difference]: Start difference. First operand has 57 places, 59 transitions, 264 flow. Second operand 8 states and 1178 transitions.
[2023-11-03 13:17:41,027 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 123 transitions, 720 flow
[2023-11-03 13:17:41,117 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 123 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:17:41,119 INFO  L231             Difference]: Finished difference. Result has 66 places, 63 transitions, 287 flow
[2023-11-03 13:17:41,119 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=66, PETRI_TRANSITIONS=63}
[2023-11-03 13:17:41,119 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places.
[2023-11-03 13:17:41,119 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 287 flow
[2023-11-03 13:17:41,120 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 137.77777777777777) internal successors, (1240), 9 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:41,120 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:41,120 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:41,127 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-03 13:17:41,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:17:41,321 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:17:41,322 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:41,322 INFO  L85        PathProgramCache]: Analyzing trace with hash -1582132255, now seen corresponding path program 1 times
[2023-11-03 13:17:41,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:41,322 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842634272]
[2023-11-03 13:17:41,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:41,323 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:41,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:41,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 13:17:41,353 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:41,353 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842634272]
[2023-11-03 13:17:41,353 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842634272] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:41,353 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:41,353 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:17:41,353 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79570356]
[2023-11-03 13:17:41,353 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:41,353 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:17:41,354 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:41,354 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:17:41,354 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:17:41,382 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 281
[2023-11-03 13:17:41,382 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 287 flow. Second operand  has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:41,382 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:41,382 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 281
[2023-11-03 13:17:41,382 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:47,780 INFO  L130       PetriNetUnfolder]: 70172/102651 cut-off events.
[2023-11-03 13:17:47,780 INFO  L131       PetriNetUnfolder]: For 75817/77383 co-relation queries the response was YES.
[2023-11-03 13:17:48,008 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 272681 conditions, 102651 events. 70172/102651 cut-off events. For 75817/77383 co-relation queries the response was YES. Maximal size of possible extension queue 2254. Compared 744421 event pairs, 51048 based on Foata normal form. 4/98039 useless extension candidates. Maximal degree in co-relation 272667. Up to 86637 conditions per place. 
[2023-11-03 13:17:48,327 INFO  L137   encePairwiseOnDemand]: 274/281 looper letters, 76 selfloop transitions, 17 changer transitions 0/102 dead transitions.
[2023-11-03 13:17:48,328 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 656 flow
[2023-11-03 13:17:48,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:48,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:48,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions.
[2023-11-03 13:17:48,330 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5658362989323843
[2023-11-03 13:17:48,330 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 477 transitions.
[2023-11-03 13:17:48,330 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions.
[2023-11-03 13:17:48,330 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:48,330 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions.
[2023-11-03 13:17:48,331 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:48,332 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:48,332 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:48,332 INFO  L175             Difference]: Start difference. First operand has 66 places, 63 transitions, 287 flow. Second operand 3 states and 477 transitions.
[2023-11-03 13:17:48,332 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 656 flow
[2023-11-03 13:17:48,477 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 651 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-03 13:17:48,478 INFO  L231             Difference]: Finished difference. Result has 67 places, 76 transitions, 441 flow
[2023-11-03 13:17:48,478 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=67, PETRI_TRANSITIONS=76}
[2023-11-03 13:17:48,479 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places.
[2023-11-03 13:17:48,479 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 76 transitions, 441 flow
[2023-11-03 13:17:48,479 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:48,479 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:48,479 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:48,479 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-11-03 13:17:48,479 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:17:48,480 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:48,480 INFO  L85        PathProgramCache]: Analyzing trace with hash -76611823, now seen corresponding path program 1 times
[2023-11-03 13:17:48,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:48,480 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478219066]
[2023-11-03 13:17:48,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:48,480 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:48,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:48,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:48,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:48,527 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478219066]
[2023-11-03 13:17:48,527 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478219066] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:48,527 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:48,527 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:17:48,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241700966]
[2023-11-03 13:17:48,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:48,527 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:17:48,527 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:48,527 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:17:48,528 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:17:48,545 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 281
[2023-11-03 13:17:48,545 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 76 transitions, 441 flow. Second operand  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:48,546 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:48,546 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 281
[2023-11-03 13:17:48,546 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:49,245 INFO  L130       PetriNetUnfolder]: 3849/8671 cut-off events.
[2023-11-03 13:17:49,245 INFO  L131       PetriNetUnfolder]: For 11118/11156 co-relation queries the response was YES.
[2023-11-03 13:17:49,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25393 conditions, 8671 events. 3849/8671 cut-off events. For 11118/11156 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 75970 event pairs, 761 based on Foata normal form. 2851/11218 useless extension candidates. Maximal degree in co-relation 25378. Up to 6051 conditions per place. 
[2023-11-03 13:17:49,278 INFO  L137   encePairwiseOnDemand]: 273/281 looper letters, 55 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2023-11-03 13:17:49,279 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 517 flow
[2023-11-03 13:17:49,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:49,280 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:49,280 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions.
[2023-11-03 13:17:49,281 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5504151838671412
[2023-11-03 13:17:49,281 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 464 transitions.
[2023-11-03 13:17:49,281 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions.
[2023-11-03 13:17:49,281 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:49,281 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions.
[2023-11-03 13:17:49,282 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:49,283 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:49,283 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:49,283 INFO  L175             Difference]: Start difference. First operand has 67 places, 76 transitions, 441 flow. Second operand 3 states and 464 transitions.
[2023-11-03 13:17:49,283 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 517 flow
[2023-11-03 13:17:49,296 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 509 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-03 13:17:49,297 INFO  L231             Difference]: Finished difference. Result has 68 places, 59 transitions, 300 flow
[2023-11-03 13:17:49,297 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=68, PETRI_TRANSITIONS=59}
[2023-11-03 13:17:49,298 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places.
[2023-11-03 13:17:49,298 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 300 flow
[2023-11-03 13:17:49,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:49,298 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:49,298 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:49,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-11-03 13:17:49,299 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:17:49,299 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:49,299 INFO  L85        PathProgramCache]: Analyzing trace with hash -227430121, now seen corresponding path program 1 times
[2023-11-03 13:17:49,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:49,299 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75594257]
[2023-11-03 13:17:49,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:49,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:49,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:49,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-03 13:17:49,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:49,324 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75594257]
[2023-11-03 13:17:49,324 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75594257] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:49,324 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:49,324 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:17:49,325 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315732547]
[2023-11-03 13:17:49,325 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:49,325 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:17:49,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:49,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:17:49,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:17:49,351 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 281
[2023-11-03 13:17:49,351 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:49,352 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:49,352 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 281
[2023-11-03 13:17:49,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:17:50,235 INFO  L130       PetriNetUnfolder]: 4013/9119 cut-off events.
[2023-11-03 13:17:50,235 INFO  L131       PetriNetUnfolder]: For 11263/11301 co-relation queries the response was YES.
[2023-11-03 13:17:50,251 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28141 conditions, 9119 events. 4013/9119 cut-off events. For 11263/11301 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 79200 event pairs, 3200 based on Foata normal form. 0/8895 useless extension candidates. Maximal degree in co-relation 28126. Up to 7676 conditions per place. 
[2023-11-03 13:17:50,267 INFO  L137   encePairwiseOnDemand]: 277/281 looper letters, 60 selfloop transitions, 4 changer transitions 0/73 dead transitions.
[2023-11-03 13:17:50,267 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 502 flow
[2023-11-03 13:17:50,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:17:50,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:17:50,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions.
[2023-11-03 13:17:50,268 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5468564650059312
[2023-11-03 13:17:50,268 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 461 transitions.
[2023-11-03 13:17:50,269 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions.
[2023-11-03 13:17:50,269 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:17:50,269 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions.
[2023-11-03 13:17:50,270 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:50,271 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:50,271 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:50,271 INFO  L175             Difference]: Start difference. First operand has 68 places, 59 transitions, 300 flow. Second operand 3 states and 461 transitions.
[2023-11-03 13:17:50,271 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 502 flow
[2023-11-03 13:17:50,280 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:17:50,281 INFO  L231             Difference]: Finished difference. Result has 70 places, 61 transitions, 321 flow
[2023-11-03 13:17:50,281 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=70, PETRI_TRANSITIONS=61}
[2023-11-03 13:17:50,281 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places.
[2023-11-03 13:17:50,281 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 321 flow
[2023-11-03 13:17:50,282 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:50,282 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:50,282 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:50,282 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-11-03 13:17:50,282 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 13:17:50,283 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:50,283 INFO  L85        PathProgramCache]: Analyzing trace with hash -1054392775, now seen corresponding path program 1 times
[2023-11-03 13:17:50,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:50,283 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337472926]
[2023-11-03 13:17:50,283 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:50,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:50,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:17:50,308 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:17:50,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:17:50,326 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:17:50,326 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:17:50,326 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-11-03 13:17:50,326 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-11-03 13:17:50,327 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-11-03 13:17:50,327 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-11-03 13:17:50,327 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-11-03 13:17:50,327 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-11-03 13:17:50,327 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-11-03 13:17:50,327 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-11-03 13:17:50,327 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-11-03 13:17:50,327 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-11-03 13:17:50,327 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-11-03 13:17:50,327 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-11-03 13:17:50,327 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:17:50,328 WARN  L233   ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:17:50,328 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances.
[2023-11-03 13:17:50,343 INFO  L144    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2023-11-03 13:17:50,345 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 176 places, 173 transitions, 406 flow
[2023-11-03 13:17:50,487 INFO  L130       PetriNetUnfolder]: 93/1577 cut-off events.
[2023-11-03 13:17:50,487 INFO  L131       PetriNetUnfolder]: For 110/110 co-relation queries the response was YES.
[2023-11-03 13:17:50,491 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 1577 events. 93/1577 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8092 event pairs, 23 based on Foata normal form. 0/1361 useless extension candidates. Maximal degree in co-relation 899. Up to 80 conditions per place. 
[2023-11-03 13:17:50,491 INFO  L82        GeneralOperation]: Start removeDead. Operand has 176 places, 173 transitions, 406 flow
[2023-11-03 13:17:50,494 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 176 places, 173 transitions, 406 flow
[2023-11-03 13:17:50,495 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:17:50,495 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 173 transitions, 406 flow
[2023-11-03 13:17:50,495 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 173 transitions, 406 flow
[2023-11-03 13:17:50,495 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 176 places, 173 transitions, 406 flow
[2023-11-03 13:17:50,636 INFO  L130       PetriNetUnfolder]: 93/1577 cut-off events.
[2023-11-03 13:17:50,636 INFO  L131       PetriNetUnfolder]: For 110/110 co-relation queries the response was YES.
[2023-11-03 13:17:50,641 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 1577 events. 93/1577 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8092 event pairs, 23 based on Foata normal form. 0/1361 useless extension candidates. Maximal degree in co-relation 899. Up to 80 conditions per place. 
[2023-11-03 13:17:50,657 INFO  L119        LiptonReduction]: Number of co-enabled transitions 13300
[2023-11-03 13:17:54,721 INFO  L134        LiptonReduction]: Checked pairs total: 31168
[2023-11-03 13:17:54,721 INFO  L136        LiptonReduction]: Total number of compositions: 132
[2023-11-03 13:17:54,723 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:17:54,724 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;@55ecd5dc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:17:54,724 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2023-11-03 13:17:54,725 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-11-03 13:17:54,725 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:17:54,725 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:17:54,725 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:17:54,726 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:17:54,726 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:17:54,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 48984, now seen corresponding path program 1 times
[2023-11-03 13:17:54,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:17:54,726 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905456458]
[2023-11-03 13:17:54,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:17:54,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:17:54,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:17:54,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:17:54,733 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:17:54,733 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905456458]
[2023-11-03 13:17:54,733 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905456458] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:17:54,734 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:17:54,734 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:17:54,734 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766339480]
[2023-11-03 13:17:54,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:17:54,734 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:17:54,734 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:17:54,734 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:17:54,734 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:17:54,735 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 305
[2023-11-03 13:17:54,735 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 174 flow. Second operand  has 2 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:17:54,735 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:17:54,735 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 305
[2023-11-03 13:17:54,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:18:13,334 INFO  L130       PetriNetUnfolder]: 225238/312306 cut-off events.
[2023-11-03 13:18:13,334 INFO  L131       PetriNetUnfolder]: For 35552/35552 co-relation queries the response was YES.
[2023-11-03 13:18:13,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 618981 conditions, 312306 events. 225238/312306 cut-off events. For 35552/35552 co-relation queries the response was YES. Maximal size of possible extension queue 7571. Compared 2372227 event pairs, 223425 based on Foata normal form. 0/293021 useless extension candidates. Maximal degree in co-relation 90999. Up to 289966 conditions per place. 
[2023-11-03 13:18:14,908 INFO  L137   encePairwiseOnDemand]: 301/305 looper letters, 40 selfloop transitions, 0 changer transitions 0/53 dead transitions.
[2023-11-03 13:18:14,908 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 246 flow
[2023-11-03 13:18:14,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:18:14,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:18:14,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 364 transitions.
[2023-11-03 13:18:14,910 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5967213114754099
[2023-11-03 13:18:14,910 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 364 transitions.
[2023-11-03 13:18:14,910 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 364 transitions.
[2023-11-03 13:18:14,910 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:18:14,910 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 364 transitions.
[2023-11-03 13:18:14,911 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 182.0) internal successors, (364), 2 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:18:14,912 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:18:14,912 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:18:14,912 INFO  L175             Difference]: Start difference. First operand has 63 places, 57 transitions, 174 flow. Second operand 2 states and 364 transitions.
[2023-11-03 13:18:14,912 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 246 flow
[2023-11-03 13:18:14,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:18:14,916 INFO  L231             Difference]: Finished difference. Result has 60 places, 53 transitions, 166 flow
[2023-11-03 13:18:14,916 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=60, PETRI_TRANSITIONS=53}
[2023-11-03 13:18:14,917 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places.
[2023-11-03 13:18:14,917 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 166 flow
[2023-11-03 13:18:14,917 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:18:14,917 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:18:14,917 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:18:14,917 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-11-03 13:18:14,918 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:18:14,918 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:18:14,918 INFO  L85        PathProgramCache]: Analyzing trace with hash 47069276, now seen corresponding path program 1 times
[2023-11-03 13:18:14,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:18:14,918 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769047782]
[2023-11-03 13:18:14,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:18:14,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:18:14,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:18:14,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:18:14,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:18:14,933 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769047782]
[2023-11-03 13:18:14,933 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769047782] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:18:14,933 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:18:14,933 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:18:14,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248118917]
[2023-11-03 13:18:14,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:18:14,933 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:18:14,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:18:14,934 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:18:14,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:18:14,954 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 152 out of 305
[2023-11-03 13:18:14,955 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 166 flow. Second operand  has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:18:14,955 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:18:14,955 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 305
[2023-11-03 13:18:14,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:18:55,858 INFO  L130       PetriNetUnfolder]: 546013/728609 cut-off events.
[2023-11-03 13:18:55,858 INFO  L131       PetriNetUnfolder]: For 47265/47265 co-relation queries the response was YES.
[2023-11-03 13:18:57,031 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1454215 conditions, 728609 events. 546013/728609 cut-off events. For 47265/47265 co-relation queries the response was YES. Maximal size of possible extension queue 13366. Compared 5321178 event pairs, 363594 based on Foata normal form. 0/692783 useless extension candidates. Maximal degree in co-relation 1454207. Up to 526600 conditions per place. 
[2023-11-03 13:18:59,616 INFO  L137   encePairwiseOnDemand]: 297/305 looper letters, 63 selfloop transitions, 7 changer transitions 0/79 dead transitions.
[2023-11-03 13:18:59,617 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 358 flow
[2023-11-03 13:18:59,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:18:59,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:18:59,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions.
[2023-11-03 13:18:59,620 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5759562841530055
[2023-11-03 13:18:59,620 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 527 transitions.
[2023-11-03 13:18:59,620 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions.
[2023-11-03 13:18:59,620 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:18:59,620 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions.
[2023-11-03 13:18:59,621 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:18:59,622 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:18:59,622 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:18:59,622 INFO  L175             Difference]: Start difference. First operand has 60 places, 53 transitions, 166 flow. Second operand 3 states and 527 transitions.
[2023-11-03 13:18:59,622 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 358 flow
[2023-11-03 13:18:59,626 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:18:59,627 INFO  L231             Difference]: Finished difference. Result has 64 places, 59 transitions, 220 flow
[2023-11-03 13:18:59,627 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=64, PETRI_TRANSITIONS=59}
[2023-11-03 13:18:59,628 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places.
[2023-11-03 13:18:59,628 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 220 flow
[2023-11-03 13:18:59,628 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:18:59,628 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:18:59,628 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:18:59,629 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-11-03 13:18:59,629 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:18:59,629 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:18:59,629 INFO  L85        PathProgramCache]: Analyzing trace with hash -754603097, now seen corresponding path program 1 times
[2023-11-03 13:18:59,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:18:59,629 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513579891]
[2023-11-03 13:18:59,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:18:59,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:18:59,639 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:18:59,651 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:18:59,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:18:59,652 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513579891]
[2023-11-03 13:18:59,652 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513579891] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:18:59,652 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:18:59,652 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:18:59,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138761112]
[2023-11-03 13:18:59,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:18:59,652 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:18:59,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:18:59,653 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:18:59,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:18:59,676 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 305
[2023-11-03 13:18:59,677 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 220 flow. Second operand  has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:18:59,677 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:18:59,677 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 305
[2023-11-03 13:18:59,677 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:19:59,190 INFO  L130       PetriNetUnfolder]: 722552/968729 cut-off events.
[2023-11-03 13:19:59,190 INFO  L131       PetriNetUnfolder]: For 302840/302840 co-relation queries the response was YES.
[2023-11-03 13:20:01,298 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2200707 conditions, 968729 events. 722552/968729 cut-off events. For 302840/302840 co-relation queries the response was YES. Maximal size of possible extension queue 20782. Compared 7399019 event pairs, 456925 based on Foata normal form. 0/912357 useless extension candidates. Maximal degree in co-relation 2200697. Up to 715430 conditions per place. 
[2023-11-03 13:20:04,877 INFO  L137   encePairwiseOnDemand]: 296/305 looper letters, 76 selfloop transitions, 13 changer transitions 0/100 dead transitions.
[2023-11-03 13:20:04,877 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 100 transitions, 552 flow
[2023-11-03 13:20:04,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:20:04,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:20:04,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions.
[2023-11-03 13:20:04,880 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.580327868852459
[2023-11-03 13:20:04,880 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 531 transitions.
[2023-11-03 13:20:04,881 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions.
[2023-11-03 13:20:04,881 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:20:04,881 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions.
[2023-11-03 13:20:04,883 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:20:04,884 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:20:04,885 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:20:04,885 INFO  L175             Difference]: Start difference. First operand has 64 places, 59 transitions, 220 flow. Second operand 3 states and 531 transitions.
[2023-11-03 13:20:04,885 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 100 transitions, 552 flow
[2023-11-03 13:25:25,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:25:25,617 INFO  L231             Difference]: Finished difference. Result has 66 places, 70 transitions, 322 flow
[2023-11-03 13:25:25,617 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=66, PETRI_TRANSITIONS=70}
[2023-11-03 13:25:25,617 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places.
[2023-11-03 13:25:25,617 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 322 flow
[2023-11-03 13:25:25,617 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:25:25,617 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:25:25,618 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:25:25,618 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-11-03 13:25:25,618 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:25:25,618 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:25:25,618 INFO  L85        PathProgramCache]: Analyzing trace with hash -447020767, now seen corresponding path program 1 times
[2023-11-03 13:25:25,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:25:25,618 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250006113]
[2023-11-03 13:25:25,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:25:25,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:25:25,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:25:25,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:25:25,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:25:25,677 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250006113]
[2023-11-03 13:25:25,677 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250006113] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:25:25,677 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893160571]
[2023-11-03 13:25:25,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:25:25,677 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:25:25,677 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:25:25,679 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:25:25,681 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-03 13:25:25,787 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:25:25,788 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 13:25:25,789 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:25:25,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:25:25,825 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:25:25,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:25:25,855 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [893160571] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:25:25,855 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:25:25,855 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 13:25:25,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707370227]
[2023-11-03 13:25:25,855 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:25:25,856 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 13:25:25,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:25:25,856 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 13:25:25,856 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 13:25:25,983 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 305
[2023-11-03 13:25:25,984 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 322 flow. Second operand  has 9 states, 9 states have (on average 151.77777777777777) internal successors, (1366), 9 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:25:25,984 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:25:25,984 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 305
[2023-11-03 13:25:25,984 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:25:38,977 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 75#L1026-10true, 29#L1018true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:38,977 INFO  L383   tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event
[2023-11-03 13:25:38,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 36 ancestors and is cut-off event
[2023-11-03 13:25:38,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 36 ancestors and is cut-off event
[2023-11-03 13:25:38,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 36 ancestors and is cut-off event
[2023-11-03 13:25:41,137 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [75#L1026-10true, Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 129#threadEXITtrue, 188#true, 23#L1017-4true])
[2023-11-03 13:25:41,137 INFO  L383   tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event
[2023-11-03 13:25:41,137 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-11-03 13:25:41,137 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-11-03 13:25:41,138 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-11-03 13:25:42,613 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 29#L1018true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 124#L1025-6true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:42,614 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event
[2023-11-03 13:25:42,614 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-03 13:25:42,614 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-03 13:25:42,614 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is cut-off event
[2023-11-03 13:25:44,454 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][101], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 120#L1028-5true, 29#L1018true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:44,454 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-11-03 13:25:44,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:25:44,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:25:44,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:25:44,778 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 29#L1018true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 116#L1026-9true, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:44,779 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-11-03 13:25:44,779 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:25:44,779 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:25:44,779 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:25:44,961 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 124#L1025-6true, 179#true, 129#threadEXITtrue, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:44,961 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-11-03 13:25:44,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:25:44,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:25:44,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-11-03 13:25:46,651 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][101], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 29#L1018true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, 134#L1029-12true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:46,651 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event
[2023-11-03 13:25:46,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:25:46,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:25:46,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:25:46,997 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][101], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 120#L1028-5true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 129#threadEXITtrue, 188#true, 23#L1017-4true])
[2023-11-03 13:25:46,998 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event
[2023-11-03 13:25:46,998 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:25:46,998 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:25:46,998 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:25:47,471 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 116#L1026-9true, 25#L1017-4true, 179#true, 129#threadEXITtrue, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:47,471 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event
[2023-11-03 13:25:47,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:25:47,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:25:47,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is cut-off event
[2023-11-03 13:25:49,294 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][101], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, 134#L1029-12true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 129#threadEXITtrue, 188#true, 23#L1017-4true])
[2023-11-03 13:25:49,295 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-03 13:25:49,295 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:25:49,295 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:25:49,295 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:25:49,813 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [120#L1028-5true, Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 73#threadEXITtrue, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, 102#L1017-4true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 115#L1017-6true, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:25:49,813 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-03 13:25:49,813 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:25:49,813 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:25:49,813 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 13:25:51,786 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][101], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 146#L1029-13true, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:51,786 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-03 13:25:51,787 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:51,787 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:51,787 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,023 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1494] L1028-5-->L1032-1: Formula: (and (= (store |v_#valid_315| (select (select |v_#memory_$Pointer$.base_242| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) |v_#valid_314|) (not (< |v_ULTIMATE.start_main_~i~1#1_333| |v_ULTIMATE.start_main_~threads_total~0#1_293|)) (= |v_#race~data~0_93| 0) (= |v_#race_897| (store |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527| (store (store (store (store (select |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0))))  InVars {#race=|v_#race_899|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_315|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|}  OutVars{#race=|v_#race_897|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, #race~data~0=|v_#race~data~0_93|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_314|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_176|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_148|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem15#1.offset][59], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 79#L1032-1true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 140#$Ultimate##0true, 179#true, Black: 182#true, 188#true, 23#L1017-4true])
[2023-11-03 13:25:52,024 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,024 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,024 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,024 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,025 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 73#threadEXITtrue, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 102#L1017-4true, threadThread1of5ForFork0InUse, 134#L1029-12true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 115#L1017-6true, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:25:52,025 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,025 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,025 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,025 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,289 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [120#L1028-5true, Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 29#L1018true, 73#threadEXITtrue, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 115#L1017-6true, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:25:52,290 INFO  L383   tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,290 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,290 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:52,290 INFO  L386   tUnfolder$Statistics]:   existing Event has 42 ancestors and is cut-off event
[2023-11-03 13:25:53,393 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 25#L1017-4true, 179#true, 11#$Ultimate##0true, Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:25:53,394 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-03 13:25:53,394 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:53,394 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:53,394 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:53,402 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, 98#$Ultimate##0true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:53,402 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-03 13:25:53,403 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:53,403 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:53,403 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:53,500 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 162#$Ultimate##0true, 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:53,500 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-03 13:25:53,500 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:53,501 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:53,501 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:54,664 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 29#L1018true, 73#threadEXITtrue, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, 134#L1029-12true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 115#L1017-6true, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:25:54,664 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-03 13:25:54,665 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:54,665 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:54,665 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:54,665 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 102#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 146#L1029-13true, 115#L1017-6true, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:25:54,665 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-03 13:25:54,665 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:54,666 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:54,666 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:55,053 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [120#L1028-5true, Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 73#threadEXITtrue, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 115#L1017-6true, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 129#threadEXITtrue, 188#true])
[2023-11-03 13:25:55,053 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-03 13:25:55,053 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:55,053 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:55,053 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-11-03 13:25:55,922 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 59#L1017-1true, 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:25:55,922 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:25:55,922 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:55,923 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:55,923 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:55,927 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, 46#L1017true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:55,928 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:25:55,928 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:55,928 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:55,928 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,040 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true, 55#L1017true])
[2023-11-03 13:25:56,040 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,040 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,040 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,040 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,160 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, 11#$Ultimate##0true, Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:25:56,160 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,162 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, 98#$Ultimate##0true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:56,163 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,163 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,163 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,163 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,168 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 162#$Ultimate##0true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:56,168 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,168 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,168 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:56,168 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,050 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1494] L1028-5-->L1032-1: Formula: (and (= (store |v_#valid_315| (select (select |v_#memory_$Pointer$.base_242| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) |v_#valid_314|) (not (< |v_ULTIMATE.start_main_~i~1#1_333| |v_ULTIMATE.start_main_~threads_total~0#1_293|)) (= |v_#race~data~0_93| 0) (= |v_#race_897| (store |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527| (store (store (store (store (select |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0))))  InVars {#race=|v_#race_899|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_315|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|}  OutVars{#race=|v_#race_897|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, #race~data~0=|v_#race~data~0_93|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_314|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_176|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_148|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem15#1.offset][59], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 79#L1032-1true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 182#true, 68#L1016-1true, 188#true, 23#L1017-4true])
[2023-11-03 13:25:57,051 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event
[2023-11-03 13:25:57,051 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is not cut-off event
[2023-11-03 13:25:57,051 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is not cut-off event
[2023-11-03 13:25:57,051 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is not cut-off event
[2023-11-03 13:25:57,053 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1494] L1028-5-->L1032-1: Formula: (and (= (store |v_#valid_315| (select (select |v_#memory_$Pointer$.base_242| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) |v_#valid_314|) (not (< |v_ULTIMATE.start_main_~i~1#1_333| |v_ULTIMATE.start_main_~threads_total~0#1_293|)) (= |v_#race~data~0_93| 0) (= |v_#race_897| (store |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527| (store (store (store (store (select |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0))))  InVars {#race=|v_#race_899|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_315|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|}  OutVars{#race=|v_#race_897|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, #race~data~0=|v_#race~data~0_93|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_314|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_176|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_148|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem15#1.offset][59], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 79#L1032-1true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 182#true, 188#true, 92#L1017-2true, 23#L1017-4true])
[2023-11-03 13:25:57,053 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,053 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,053 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,053 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,085 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [120#L1028-5true, Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:57,085 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,085 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,086 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,086 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,377 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 73#threadEXITtrue, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, 134#L1029-12true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 115#L1017-6true, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 129#threadEXITtrue, 188#true])
[2023-11-03 13:25:57,377 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,377 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,378 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 29#L1018true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 146#L1029-13true, threadThread5of5ForFork0NotInUse, 115#L1017-6true, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:25:57,378 INFO  L383   tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,379 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,379 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,379 INFO  L386   tUnfolder$Statistics]:   existing Event has 44 ancestors and is cut-off event
[2023-11-03 13:25:57,813 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1397] L1017-2-->L1017-4: Formula: (= |v_threadThread2of5ForFork0_#t~nondet5_13| |v_#race~data~0_77|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_77|, threadThread2of5ForFork0_#t~nondet5=|v_threadThread2of5ForFork0_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread2of5ForFork0_#t~nondet5][92], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, 102#L1017-4true, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 92#L1017-2true, 23#L1017-4true])
[2023-11-03 13:25:57,813 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:25:57,814 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:57,814 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:57,814 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,346 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 27#L1032-2true, 179#true, Black: 184#(= |#race~data~0| 0), 163#L1017-3true, 188#true])
[2023-11-03 13:25:58,346 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,346 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,347 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,347 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,348 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 130#L1017-3true, 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:58,348 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,349 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,349 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,349 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,444 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread2of5ForFork0InUse, threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, 35#L1017-2true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:58,444 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,445 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,445 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,445 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,587 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 59#L1017-1true, 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:25:58,587 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,589 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, 46#L1017true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:25:58,589 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,589 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,589 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,589 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,591 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true, 55#L1017true])
[2023-11-03 13:25:58,591 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:58,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,481 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][131], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 134#L1029-12true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 270#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 23#L1017-4true])
[2023-11-03 13:25:59,481 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,482 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,482 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,482 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,773 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 73#threadEXITtrue, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 146#L1029-13true, 115#L1017-6true, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:25:59,773 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,773 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,774 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][77], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 146#L1029-13true, threadThread5of5ForFork0NotInUse, 115#L1017-6true, 25#L1017-4true, 179#true, 268#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| 0), 129#threadEXITtrue, 188#true])
[2023-11-03 13:25:59,774 INFO  L383   tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:25:59,775 INFO  L386   tUnfolder$Statistics]:   existing Event has 45 ancestors and is cut-off event
[2023-11-03 13:26:00,532 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 27#L1032-2true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:00,533 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,533 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,533 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,533 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,772 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 163#L1017-3true])
[2023-11-03 13:26:00,772 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,772 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,772 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,772 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,773 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [130#L1017-3true, Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:00,773 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,773 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,773 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,773 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,774 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, 35#L1017-2true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:00,774 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,775 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,775 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1397] L1017-2-->L1017-4: Formula: (= |v_threadThread2of5ForFork0_#t~nondet5_13| |v_#race~data~0_77|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_77|, threadThread2of5ForFork0_#t~nondet5=|v_threadThread2of5ForFork0_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread2of5ForFork0_#t~nondet5][29], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, 102#L1017-4true, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, Black: 184#(= |#race~data~0| 0), 92#L1017-2true, 188#true, 23#L1017-4true])
[2023-11-03 13:26:00,775 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,775 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,775 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:00,775 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,866 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 102#L1017-4true, threadThread1of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread2of5ForFork0InUse, threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:01,866 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,867 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,867 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,867 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,897 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][72], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 120#L1028-5true, 29#L1018true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 115#L1017-6true, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:26:01,898 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,898 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,898 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,898 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,906 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][124], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 102#L1017-4true, threadThread1of5ForFork0InUse, 134#L1029-12true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 115#L1017-6true, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 270#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 188#true])
[2023-11-03 13:26:01,906 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,906 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,906 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:01,906 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:02,160 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, 41#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:02,160 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 13:26:02,160 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:02,160 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:02,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 13:26:02,592 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 29#L1018true, 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread2of5ForFork0InUse, threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:02,593 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,593 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,593 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,593 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,643 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, 102#L1017-4true, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread2of5ForFork0InUse, threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:02,644 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,644 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,644 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,644 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,648 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, 102#L1017-4true, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0NotInUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:26:02,648 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,770 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:02,770 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,771 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:02,771 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,598 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1494] L1028-5-->L1032-1: Formula: (and (= (store |v_#valid_315| (select (select |v_#memory_$Pointer$.base_242| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) |v_#valid_314|) (not (< |v_ULTIMATE.start_main_~i~1#1_333| |v_ULTIMATE.start_main_~threads_total~0#1_293|)) (= |v_#race~data~0_93| 0) (= |v_#race_897| (store |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527| (store (store (store (store (select |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0))))  InVars {#race=|v_#race_899|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_315|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|}  OutVars{#race=|v_#race_897|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, #race~data~0=|v_#race~data~0_93|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_314|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_176|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_148|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem15#1.offset][59], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 29#L1018true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 79#L1032-1true, threadThread1of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 25#L1017-4true, 179#true, Black: 182#true, 188#true, 23#L1017-4true])
[2023-11-03 13:26:03,599 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is not cut-off event
[2023-11-03 13:26:03,599 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is not cut-off event
[2023-11-03 13:26:03,599 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is not cut-off event
[2023-11-03 13:26:03,599 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is not cut-off event
[2023-11-03 13:26:03,710 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][72], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 120#L1028-5true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 115#L1017-6true, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 129#threadEXITtrue, 188#true])
[2023-11-03 13:26:03,710 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,710 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,710 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,710 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,711 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1494] L1028-5-->L1032-1: Formula: (and (= (store |v_#valid_315| (select (select |v_#memory_$Pointer$.base_242| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) |v_#valid_314|) (not (< |v_ULTIMATE.start_main_~i~1#1_333| |v_ULTIMATE.start_main_~threads_total~0#1_293|)) (= |v_#race~data~0_93| 0) (= |v_#race_897| (store |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527| (store (store (store (store (select |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0))))  InVars {#race=|v_#race_899|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_315|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|}  OutVars{#race=|v_#race_897|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, #race~data~0=|v_#race~data~0_93|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_314|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_176|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_148|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem15#1.offset][59], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 73#threadEXITtrue, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 79#L1032-1true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 182#true, 188#true, 23#L1017-4true])
[2023-11-03 13:26:03,711 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,711 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,711 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,712 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,712 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][72], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 120#L1028-5true, 73#threadEXITtrue, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 115#L1017-6true, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:26:03,712 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,712 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,712 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,712 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,713 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][124], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 29#L1018true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, 134#L1029-12true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 115#L1017-6true, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 270#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 188#true])
[2023-11-03 13:26:03,713 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,713 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,713 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,713 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,773 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 41#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 65#threadEXITtrue, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:03,774 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,919 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 41#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, 54#L1017-6true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:03,919 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,919 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,919 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:03,919 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 13:26:04,239 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, 54#L1017-6true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:04,239 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event
[2023-11-03 13:26:04,240 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-03 13:26:04,240 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-03 13:26:04,240 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-03 13:26:04,253 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, 129#threadEXITtrue, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:04,254 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,254 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,254 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,254 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,316 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 29#L1018true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:04,317 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,317 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,317 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,317 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,321 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 29#L1018true, 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0NotInUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:26:04,321 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,321 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:04,917 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1494] L1028-5-->L1032-1: Formula: (and (= (store |v_#valid_315| (select (select |v_#memory_$Pointer$.base_242| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) |v_#valid_314|) (not (< |v_ULTIMATE.start_main_~i~1#1_333| |v_ULTIMATE.start_main_~threads_total~0#1_293|)) (= |v_#race~data~0_93| 0) (= |v_#race_897| (store |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527| (store (store (store (store (select |v_#race_899| |v_ULTIMATE.start_main_~#tids~0#1.base_527|) |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_501| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_501|) 0))))  InVars {#race=|v_#race_899|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_315|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|}  OutVars{#race=|v_#race_897|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_501|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_242|, #race~data~0=|v_#race~data~0_93|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_527|, #valid=|v_#valid_314|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_176|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_293|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_148|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem15#1.offset][59], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 79#L1032-1true, threadThread1of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 25#L1017-4true, 179#true, Black: 182#true, 129#threadEXITtrue, 188#true, 23#L1017-4true])
[2023-11-03 13:26:04,917 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event
[2023-11-03 13:26:04,917 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-03 13:26:04,918 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-03 13:26:04,918 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is not cut-off event
[2023-11-03 13:26:05,086 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][124], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, 134#L1029-12true, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 115#L1017-6true, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 129#threadEXITtrue, 270#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 188#true])
[2023-11-03 13:26:05,086 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,087 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,087 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,087 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,087 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][124], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 73#threadEXITtrue, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, 134#L1029-12true, threadThread2of5ForFork0NotInUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 115#L1017-6true, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 270#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 188#true])
[2023-11-03 13:26:05,087 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,087 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,088 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,088 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,124 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 41#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 65#threadEXITtrue, threadThread5of5ForFork0InUse, 115#L1017-6true, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:26:05,124 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,225 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 104#threadEXITtrue, 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 41#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:05,226 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,226 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,226 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,226 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is cut-off event
[2023-11-03 13:26:05,655 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 104#threadEXITtrue, 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:05,655 INFO  L383   tUnfolder$Statistics]: this new event has 48 ancestors and is not cut-off event
[2023-11-03 13:26:05,656 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is not cut-off event
[2023-11-03 13:26:05,656 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is not cut-off event
[2023-11-03 13:26:05,656 INFO  L386   tUnfolder$Statistics]:   existing Event has 48 ancestors and is not cut-off event
[2023-11-03 13:26:05,682 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, 129#threadEXITtrue, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:05,683 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-11-03 13:26:05,683 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:05,683 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:05,683 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:05,688 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0NotInUse, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, 129#threadEXITtrue, Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:26:05,689 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-11-03 13:26:05,689 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:05,689 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:05,689 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:06,293 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1388] L1017-4-->L1017-6: Formula: (= |v_threadThread4of5ForFork0_#t~nondet5_13| |v_#race~data~0_73|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, #race~data~0=|v_#race~data~0_73|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_13|, threadThread4of5ForFork0_#t~nondet4=|v_threadThread4of5ForFork0_#t~nondet4_9|, #race~data~0=|v_#race~data~0_73|}  AuxVars[]  AssignedVars[threadThread4of5ForFork0_#t~nondet4][124], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 146#L1029-13true, 115#L1017-6true, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 270#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~threads_total~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 188#true])
[2023-11-03 13:26:06,293 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-11-03 13:26:06,293 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:06,294 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:06,294 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:06,316 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 99#threadEXITtrue, 145#L1017-4true, 41#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 65#threadEXITtrue, threadThread5of5ForFork0InUse, 25#L1017-4true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true])
[2023-11-03 13:26:06,316 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-11-03 13:26:06,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:06,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:06,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 13:26:07,828 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][132], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 145#L1017-4true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 27#L1032-2true, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:07,829 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-03 13:26:07,829 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 13:26:07,829 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 13:26:07,829 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 13:26:08,390 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L1017-2-->L1017-4: Formula: (= |v_threadThread5of5ForFork0_#t~nondet5_15| |v_#race~data~0_83|)  InVars {}  OutVars{threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_83|}  AuxVars[]  AssignedVars[threadThread5of5ForFork0_#t~nondet5, #race~data~0][82], [Black: 190#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#L1017-4true, 3#ULTIMATE.startEXITtrue, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, 266#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 179#true, Black: 184#(= |#race~data~0| 0), 188#true, 23#L1017-4true])
[2023-11-03 13:26:08,390 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-11-03 13:26:08,390 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 13:26:08,390 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 13:26:08,390 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 13:26:09,039 INFO  L130       PetriNetUnfolder]: 459076/635079 cut-off events.
[2023-11-03 13:26:09,039 INFO  L131       PetriNetUnfolder]: For 494924/541461 co-relation queries the response was YES.
[2023-11-03 13:26:10,577 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1592662 conditions, 635079 events. 459076/635079 cut-off events. For 494924/541461 co-relation queries the response was YES. Maximal size of possible extension queue 14737. Compared 5160459 event pairs, 224666 based on Foata normal form. 12547/606726 useless extension candidates. Maximal degree in co-relation 1592651. Up to 381856 conditions per place. 
[2023-11-03 13:26:13,501 INFO  L137   encePairwiseOnDemand]: 298/305 looper letters, 108 selfloop transitions, 7 changer transitions 4/139 dead transitions.
[2023-11-03 13:26:13,502 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 139 transitions, 805 flow
[2023-11-03 13:26:13,503 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 13:26:13,503 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 13:26:13,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1302 transitions.
[2023-11-03 13:26:13,505 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5336065573770492
[2023-11-03 13:26:13,506 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1302 transitions.
[2023-11-03 13:26:13,506 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1302 transitions.
[2023-11-03 13:26:13,506 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:13,506 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1302 transitions.
[2023-11-03 13:26:13,508 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 162.75) internal successors, (1302), 8 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:26:13,510 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 305.0) internal successors, (2745), 9 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:26:13,510 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 305.0) internal successors, (2745), 9 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:26:13,510 INFO  L175             Difference]: Start difference. First operand has 66 places, 70 transitions, 322 flow. Second operand 8 states and 1302 transitions.
[2023-11-03 13:26:13,511 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 139 transitions, 805 flow
[2023-11-03 13:27:04,764 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 139 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:27:04,765 INFO  L231             Difference]: Finished difference. Result has 75 places, 74 transitions, 341 flow
[2023-11-03 13:27:04,765 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=341, PETRI_PLACES=75, PETRI_TRANSITIONS=74}
[2023-11-03 13:27:04,766 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, 12 predicate places.
[2023-11-03 13:27:04,766 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 341 flow
[2023-11-03 13:27:04,766 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 151.77777777777777) internal successors, (1366), 9 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:27:04,766 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:27:04,767 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:27:04,775 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-03 13:27:04,967 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:27:04,968 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-03 13:27:04,969 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:27:04,970 INFO  L85        PathProgramCache]: Analyzing trace with hash 1004807023, now seen corresponding path program 1 times
[2023-11-03 13:27:04,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:27:04,971 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355210586]
[2023-11-03 13:27:04,971 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:04,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:27:04,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:27:05,002 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 13:27:05,002 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:27:05,002 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355210586]
[2023-11-03 13:27:05,002 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355210586] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:27:05,003 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:27:05,003 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:27:05,003 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228216128]
[2023-11-03 13:27:05,003 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:27:05,003 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:27:05,004 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:27:05,004 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:27:05,004 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:27:05,033 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 305
[2023-11-03 13:27:05,034 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 341 flow. Second operand  has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:27:05,035 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:27:05,035 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 305
[2023-11-03 13:27:05,035 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
