./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-race-3.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-race-3.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 31dfdfa92c5c53fb82a3ae1f815657fc1f0623ee273c9cb92b1530040e1501c3
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-27 12:42:55,174 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-27 12:42:55,175 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-27 12:42:55,239 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-27 12:42:55,240 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-27 12:42:55,242 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-27 12:42:55,243 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-27 12:42:55,245 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-27 12:42:55,247 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-27 12:42:55,251 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-27 12:42:55,252 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-27 12:42:55,253 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-27 12:42:55,254 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-27 12:42:55,255 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-27 12:42:55,256 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-27 12:42:55,257 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-27 12:42:55,258 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-27 12:42:55,259 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-27 12:42:55,260 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-27 12:42:55,277 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-27 12:42:55,278 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-27 12:42:55,280 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-27 12:42:55,280 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-27 12:42:55,281 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-27 12:42:55,287 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-27 12:42:55,287 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-27 12:42:55,287 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-27 12:42:55,288 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-27 12:42:55,289 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-27 12:42:55,289 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-27 12:42:55,290 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-27 12:42:55,290 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-27 12:42:55,292 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-27 12:42:55,292 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-27 12:42:55,297 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-27 12:42:55,297 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-27 12:42:55,298 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-27 12:42:55,298 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-27 12:42:55,298 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-27 12:42:55,299 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-27 12:42:55,299 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-27 12:42:55,300 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-27 12:42:55,347 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-27 12:42:55,347 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-27 12:42:55,348 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-27 12:42:55,348 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-27 12:42:55,349 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-27 12:42:55,349 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-27 12:42:55,349 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-27 12:42:55,349 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-27 12:42:55,350 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-27 12:42:55,350 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-27 12:42:55,350 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-27 12:42:55,351 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-27 12:42:55,351 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-27 12:42:55,351 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-27 12:42:55,351 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-27 12:42:55,351 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-27 12:42:55,351 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-27 12:42:55,351 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-27 12:42:55,352 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-27 12:42:55,352 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-27 12:42:55,352 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-27 12:42:55,352 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-27 12:42:55,352 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-27 12:42:55,352 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-27 12:42:55,353 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-27 12:42:55,353 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-27 12:42:55,353 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:42:55,353 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-27 12:42:55,353 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-27 12:42:55,354 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-27 12:42:55,354 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-27 12:42:55,354 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-27 12:42:55,355 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-27 12:42:55,355 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-27 12:42:55,355 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-27 12:42:55,355 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-27 12:42:55,355 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-27 12:42:55,355 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 -> 31dfdfa92c5c53fb82a3ae1f815657fc1f0623ee273c9cb92b1530040e1501c3
[2023-10-27 12:42:55,702 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-27 12:42:55,715 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-27 12:42:55,717 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-27 12:42:55,718 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-27 12:42:55,718 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-27 12:42:55,719 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-3.i
[2023-10-27 12:42:57,329 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-27 12:42:57,731 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-27 12:42:57,744 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-3.i
[2023-10-27 12:42:57,767 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/6937bce79/46ba6113a6b34956a15c455867811b31/FLAG7283bd069
[2023-10-27 12:42:57,793 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/6937bce79/46ba6113a6b34956a15c455867811b31
[2023-10-27 12:42:57,796 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-27 12:42:57,803 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-27 12:42:57,807 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-27 12:42:57,807 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-27 12:42:57,817 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-27 12:42:57,818 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:42:57" (1/1) ...
[2023-10-27 12:42:57,819 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716e0f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:57, skipping insertion in model container
[2023-10-27 12:42:57,819 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:42:57" (1/1) ...
[2023-10-27 12:42:57,830 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-27 12:42:57,905 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-27 12:42:58,143 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:42:58,416 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:42:58,442 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-27 12:42:58,471 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:42:58,539 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:42:58,619 INFO  L208         MainTranslator]: Completed translation
[2023-10-27 12:42:58,628 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58 WrapperNode
[2023-10-27 12:42:58,628 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-27 12:42:58,629 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-27 12:42:58,629 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-27 12:42:58,629 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-27 12:42:58,639 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (1/1) ...
[2023-10-27 12:42:58,666 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (1/1) ...
[2023-10-27 12:42:58,719 INFO  L138                Inliner]: procedures = 269, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2023-10-27 12:42:58,722 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-27 12:42:58,723 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-27 12:42:58,723 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-27 12:42:58,723 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-27 12:42:58,732 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (1/1) ...
[2023-10-27 12:42:58,732 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (1/1) ...
[2023-10-27 12:42:58,748 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (1/1) ...
[2023-10-27 12:42:58,749 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (1/1) ...
[2023-10-27 12:42:58,760 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (1/1) ...
[2023-10-27 12:42:58,771 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (1/1) ...
[2023-10-27 12:42:58,778 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (1/1) ...
[2023-10-27 12:42:58,779 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (1/1) ...
[2023-10-27 12:42:58,781 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-27 12:42:58,791 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-27 12:42:58,791 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-27 12:42:58,791 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-27 12:42:58,792 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (1/1) ...
[2023-10-27 12:42:58,796 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:42:58,806 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:42:58,830 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-10-27 12:42:58,877 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-10-27 12:42:58,883 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-27 12:42:58,883 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-27 12:42:58,883 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-27 12:42:58,886 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-27 12:42:58,886 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-27 12:42:58,886 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-27 12:42:58,886 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-27 12:42:58,886 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-27 12:42:58,886 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-27 12:42:58,886 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-27 12:42:58,887 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-27 12:42:58,887 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-27 12:42:58,887 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-27 12:42:58,887 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-27 12:42:58,888 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-27 12:42:59,094 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-27 12:42:59,102 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-27 12:42:59,549 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-27 12:42:59,555 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-27 12:42:59,573 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-27 12:42:59,575 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:42:59 BoogieIcfgContainer
[2023-10-27 12:42:59,575 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-27 12:42:59,579 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-27 12:42:59,579 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-27 12:42:59,583 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-27 12:42:59,583 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:42:57" (1/3) ...
[2023-10-27 12:42:59,584 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56457056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:42:59, skipping insertion in model container
[2023-10-27 12:42:59,585 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:58" (2/3) ...
[2023-10-27 12:42:59,586 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56457056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:42:59, skipping insertion in model container
[2023-10-27 12:42:59,586 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:42:59" (3/3) ...
[2023-10-27 12:42:59,587 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-3.i
[2023-10-27 12:42:59,594 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-27 12:42:59,616 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-27 12:42:59,618 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2023-10-27 12:42:59,618 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-27 12:42:59,754 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-27 12:42:59,824 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 139 transitions, 294 flow
[2023-10-27 12:43:00,017 INFO  L130       PetriNetUnfolder]: 9/297 cut-off events.
[2023-10-27 12:43:00,017 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-10-27 12:43:00,023 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 311 conditions, 297 events. 9/297 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 802 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. 
[2023-10-27 12:43:00,033 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 139 transitions, 294 flow
[2023-10-27 12:43:00,054 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 138 transitions, 290 flow
[2023-10-27 12:43:00,058 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:43:00,079 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 138 transitions, 290 flow
[2023-10-27 12:43:00,088 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 138 transitions, 290 flow
[2023-10-27 12:43:00,093 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 138 transitions, 290 flow
[2023-10-27 12:43:00,178 INFO  L130       PetriNetUnfolder]: 9/297 cut-off events.
[2023-10-27 12:43:00,186 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-10-27 12:43:00,188 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 311 conditions, 297 events. 9/297 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 809 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. 
[2023-10-27 12:43:00,207 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3780
[2023-10-27 12:43:06,749 INFO  L134        LiptonReduction]: Checked pairs total: 7183
[2023-10-27 12:43:06,749 INFO  L136        LiptonReduction]: Total number of compositions: 121
[2023-10-27 12:43:06,776 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:43:06,788 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;@c1c64f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:43:06,789 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-10-27 12:43:06,791 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-10-27 12:43:06,791 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:43:06,792 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:06,792 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-27 12:43:06,793 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:43:06,801 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:06,801 INFO  L85        PathProgramCache]: Analyzing trace with hash 14455, now seen corresponding path program 1 times
[2023-10-27 12:43:06,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:06,810 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400926178]
[2023-10-27 12:43:06,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:06,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:06,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:43:07,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:43:07,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:43:07,064 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400926178]
[2023-10-27 12:43:07,065 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400926178] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:43:07,065 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:43:07,065 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-27 12:43:07,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812484201]
[2023-10-27 12:43:07,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:43:07,073 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:43:07,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:43:07,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:43:07,133 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:43:07,135 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 260
[2023-10-27 12:43:07,137 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 82 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-10-27 12:43:07,141 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:43:07,141 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 260
[2023-10-27 12:43:07,142 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:43:07,340 INFO  L130       PetriNetUnfolder]: 342/709 cut-off events.
[2023-10-27 12:43:07,340 INFO  L131       PetriNetUnfolder]: For 20/20 co-relation queries the response was YES.
[2023-10-27 12:43:07,343 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 709 events. 342/709 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3500 event pairs, 335 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 1173. Up to 621 conditions per place. 
[2023-10-27 12:43:07,360 INFO  L137   encePairwiseOnDemand]: 255/260 looper letters, 23 selfloop transitions, 0 changer transitions 0/29 dead transitions.
[2023-10-27 12:43:07,360 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 118 flow
[2023-10-27 12:43:07,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:43:07,363 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:43:07,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions.
[2023-10-27 12:43:07,390 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5615384615384615
[2023-10-27 12:43:07,391 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 292 transitions.
[2023-10-27 12:43:07,392 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions.
[2023-10-27 12:43:07,394 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:43:07,396 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions.
[2023-10-27 12:43:07,400 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 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-10-27 12:43:07,404 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 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-10-27 12:43:07,405 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 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-10-27 12:43:07,406 INFO  L175             Difference]: Start difference. First operand has 38 places, 34 transitions, 82 flow. Second operand 2 states and 292 transitions.
[2023-10-27 12:43:07,407 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 118 flow
[2023-10-27 12:43:07,410 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:43:07,427 INFO  L231             Difference]: Finished difference. Result has 32 places, 29 transitions, 68 flow
[2023-10-27 12:43:07,429 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=68, PETRI_PLACES=32, PETRI_TRANSITIONS=29}
[2023-10-27 12:43:07,432 INFO  L288   CegarLoopForPetriNet]: 38 programPoint places, -6 predicate places.
[2023-10-27 12:43:07,433 INFO  L495      AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 68 flow
[2023-10-27 12:43:07,433 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-10-27 12:43:07,434 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:07,434 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-10-27 12:43:07,434 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-27 12:43:07,435 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:43:07,437 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:07,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 474762153, now seen corresponding path program 1 times
[2023-10-27 12:43:07,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:07,438 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059139225]
[2023-10-27 12:43:07,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:07,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:07,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:43:07,553 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:43:07,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:43:07,642 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:43:07,643 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:43:07,644 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-10-27 12:43:07,646 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-10-27 12:43:07,646 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-10-27 12:43:07,647 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-10-27 12:43:07,647 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-10-27 12:43:07,648 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-10-27 12:43:07,648 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-10-27 12:43:07,648 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 11 remaining)
[2023-10-27 12:43:07,649 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-10-27 12:43:07,649 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-10-27 12:43:07,649 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-10-27 12:43:07,649 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-27 12:43:07,650 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1]
[2023-10-27 12:43:07,653 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:43:07,653 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-27 12:43:07,697 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-10-27 12:43:07,704 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 378 flow
[2023-10-27 12:43:07,873 INFO  L130       PetriNetUnfolder]: 19/528 cut-off events.
[2023-10-27 12:43:07,887 INFO  L131       PetriNetUnfolder]: For 14/14 co-relation queries the response was YES.
[2023-10-27 12:43:07,889 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 558 conditions, 528 events. 19/528 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1823 event pairs, 1 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 553. Up to 16 conditions per place. 
[2023-10-27 12:43:07,889 INFO  L82        GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 378 flow
[2023-10-27 12:43:07,890 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 156 places, 154 transitions, 332 flow
[2023-10-27 12:43:07,891 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:43:07,891 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 154 transitions, 332 flow
[2023-10-27 12:43:07,891 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 154 transitions, 332 flow
[2023-10-27 12:43:07,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 154 transitions, 332 flow
[2023-10-27 12:43:07,987 INFO  L130       PetriNetUnfolder]: 19/528 cut-off events.
[2023-10-27 12:43:07,988 INFO  L131       PetriNetUnfolder]: For 14/14 co-relation queries the response was YES.
[2023-10-27 12:43:07,989 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 557 conditions, 528 events. 19/528 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1811 event pairs, 1 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 306. Up to 16 conditions per place. 
[2023-10-27 12:43:07,995 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6804
[2023-10-27 12:43:12,582 INFO  L134        LiptonReduction]: Checked pairs total: 13340
[2023-10-27 12:43:12,582 INFO  L136        LiptonReduction]: Total number of compositions: 127
[2023-10-27 12:43:12,583 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:43:12,584 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;@c1c64f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:43:12,584 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-10-27 12:43:12,587 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-10-27 12:43:12,587 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:43:12,587 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:12,587 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-27 12:43:12,588 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:43:12,588 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:12,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 24542, now seen corresponding path program 1 times
[2023-10-27 12:43:12,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:12,589 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617352765]
[2023-10-27 12:43:12,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:12,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:12,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:43:12,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:43:12,649 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:43:12,649 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617352765]
[2023-10-27 12:43:12,650 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617352765] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:43:12,650 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:43:12,650 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-27 12:43:12,650 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171310935]
[2023-10-27 12:43:12,650 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:43:12,651 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:43:12,651 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:43:12,651 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:43:12,651 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:43:12,652 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 298
[2023-10-27 12:43:12,653 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 110 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-10-27 12:43:12,655 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:43:12,655 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 298
[2023-10-27 12:43:12,655 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:43:13,454 INFO  L130       PetriNetUnfolder]: 3192/5371 cut-off events.
[2023-10-27 12:43:13,454 INFO  L131       PetriNetUnfolder]: For 286/286 co-relation queries the response was YES.
[2023-10-27 12:43:13,458 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10447 conditions, 5371 events. 3192/5371 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 32762 event pairs, 3143 based on Foata normal form. 0/4939 useless extension candidates. Maximal degree in co-relation 4034. Up to 4842 conditions per place. 
[2023-10-27 12:43:13,488 INFO  L137   encePairwiseOnDemand]: 293/298 looper letters, 29 selfloop transitions, 0 changer transitions 0/38 dead transitions.
[2023-10-27 12:43:13,489 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 158 flow
[2023-10-27 12:43:13,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:43:13,489 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:43:13,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 354 transitions.
[2023-10-27 12:43:13,491 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5939597315436241
[2023-10-27 12:43:13,491 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 354 transitions.
[2023-10-27 12:43:13,491 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 354 transitions.
[2023-10-27 12:43:13,491 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:43:13,491 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 354 transitions.
[2023-10-27 12:43:13,492 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 177.0) internal successors, (354), 2 states have internal predecessors, (354), 0 states have call successors, (0), 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-10-27 12:43:13,494 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 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-10-27 12:43:13,495 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 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-10-27 12:43:13,495 INFO  L175             Difference]: Start difference. First operand has 48 places, 43 transitions, 110 flow. Second operand 2 states and 354 transitions.
[2023-10-27 12:43:13,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 158 flow
[2023-10-27 12:43:13,507 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:43:13,508 INFO  L231             Difference]: Finished difference. Result has 42 places, 38 transitions, 96 flow
[2023-10-27 12:43:13,508 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=42, PETRI_TRANSITIONS=38}
[2023-10-27 12:43:13,509 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places.
[2023-10-27 12:43:13,509 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 96 flow
[2023-10-27 12:43:13,510 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-10-27 12:43:13,510 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:13,510 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-27 12:43:13,510 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-27 12:43:13,510 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:43:13,511 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:13,511 INFO  L85        PathProgramCache]: Analyzing trace with hash 1208009857, now seen corresponding path program 1 times
[2023-10-27 12:43:13,511 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:13,514 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324602411]
[2023-10-27 12:43:13,514 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:13,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:13,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:43:13,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:43:13,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:43:13,605 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324602411]
[2023-10-27 12:43:13,606 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324602411] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:43:13,606 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:43:13,606 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:43:13,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55012445]
[2023-10-27 12:43:13,607 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:43:13,608 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:43:13,608 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:43:13,608 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:43:13,608 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:43:13,644 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 153 out of 298
[2023-10-27 12:43:13,645 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 96 flow. Second operand  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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-10-27 12:43:13,645 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:43:13,645 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 298
[2023-10-27 12:43:13,646 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:43:14,871 INFO  L130       PetriNetUnfolder]: 6632/10522 cut-off events.
[2023-10-27 12:43:14,871 INFO  L131       PetriNetUnfolder]: For 202/202 co-relation queries the response was YES.
[2023-10-27 12:43:14,877 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20715 conditions, 10522 events. 6632/10522 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 64415 event pairs, 3912 based on Foata normal form. 0/9850 useless extension candidates. Maximal degree in co-relation 20710. Up to 6948 conditions per place. 
[2023-10-27 12:43:14,950 INFO  L137   encePairwiseOnDemand]: 292/298 looper letters, 44 selfloop transitions, 5 changer transitions 0/55 dead transitions.
[2023-10-27 12:43:14,951 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 228 flow
[2023-10-27 12:43:14,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:43:14,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:43:14,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions.
[2023-10-27 12:43:14,965 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.569351230425056
[2023-10-27 12:43:14,965 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 509 transitions.
[2023-10-27 12:43:14,969 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions.
[2023-10-27 12:43:14,970 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:43:14,970 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions.
[2023-10-27 12:43:14,972 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 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-10-27 12:43:14,975 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 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-10-27 12:43:14,975 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 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-10-27 12:43:14,976 INFO  L175             Difference]: Start difference. First operand has 42 places, 38 transitions, 96 flow. Second operand 3 states and 509 transitions.
[2023-10-27 12:43:14,976 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 228 flow
[2023-10-27 12:43:14,981 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:43:14,982 INFO  L231             Difference]: Finished difference. Result has 46 places, 42 transitions, 134 flow
[2023-10-27 12:43:14,982 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=46, PETRI_TRANSITIONS=42}
[2023-10-27 12:43:14,984 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places.
[2023-10-27 12:43:14,984 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 134 flow
[2023-10-27 12:43:14,985 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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-10-27 12:43:14,985 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:14,985 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:43:14,985 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-27 12:43:14,986 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:43:14,987 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:14,987 INFO  L85        PathProgramCache]: Analyzing trace with hash -1208502027, now seen corresponding path program 1 times
[2023-10-27 12:43:14,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:14,987 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930785357]
[2023-10-27 12:43:14,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:14,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:15,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:43:15,077 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:43:15,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:43:15,078 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930785357]
[2023-10-27 12:43:15,078 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930785357] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:43:15,078 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:43:15,078 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:43:15,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182584935]
[2023-10-27 12:43:15,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:43:15,079 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:43:15,079 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:43:15,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:43:15,080 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:43:15,105 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 298
[2023-10-27 12:43:15,106 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 134 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-10-27 12:43:15,106 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:43:15,106 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 298
[2023-10-27 12:43:15,106 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:43:16,510 INFO  L130       PetriNetUnfolder]: 7625/12270 cut-off events.
[2023-10-27 12:43:16,519 INFO  L131       PetriNetUnfolder]: For 3305/3316 co-relation queries the response was YES.
[2023-10-27 12:43:16,529 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27565 conditions, 12270 events. 7625/12270 cut-off events. For 3305/3316 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 81366 event pairs, 4713 based on Foata normal form. 0/11594 useless extension candidates. Maximal degree in co-relation 27558. Up to 8884 conditions per place. 
[2023-10-27 12:43:16,583 INFO  L137   encePairwiseOnDemand]: 291/298 looper letters, 46 selfloop transitions, 9 changer transitions 0/63 dead transitions.
[2023-10-27 12:43:16,597 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 308 flow
[2023-10-27 12:43:16,598 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:43:16,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:43:16,599 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions.
[2023-10-27 12:43:16,599 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5637583892617449
[2023-10-27 12:43:16,599 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 504 transitions.
[2023-10-27 12:43:16,600 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions.
[2023-10-27 12:43:16,600 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:43:16,600 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions.
[2023-10-27 12:43:16,613 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 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-10-27 12:43:16,615 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 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-10-27 12:43:16,615 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 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-10-27 12:43:16,616 INFO  L175             Difference]: Start difference. First operand has 46 places, 42 transitions, 134 flow. Second operand 3 states and 504 transitions.
[2023-10-27 12:43:16,616 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 308 flow
[2023-10-27 12:43:16,743 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:43:16,745 INFO  L231             Difference]: Finished difference. Result has 48 places, 49 transitions, 200 flow
[2023-10-27 12:43:16,753 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=48, PETRI_TRANSITIONS=49}
[2023-10-27 12:43:16,764 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places.
[2023-10-27 12:43:16,764 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 200 flow
[2023-10-27 12:43:16,764 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-10-27 12:43:16,765 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:16,765 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:43:16,765 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-27 12:43:16,765 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:43:16,765 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:16,765 INFO  L85        PathProgramCache]: Analyzing trace with hash -1411186058, now seen corresponding path program 1 times
[2023-10-27 12:43:16,766 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:16,766 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456396462]
[2023-10-27 12:43:16,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:16,766 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:16,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:43:16,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:43:16,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:43:16,819 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456396462]
[2023-10-27 12:43:16,820 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456396462] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:43:16,820 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:43:16,820 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:43:16,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751011265]
[2023-10-27 12:43:16,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:43:16,829 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:43:16,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:43:16,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:43:16,831 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:43:16,848 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 298
[2023-10-27 12:43:16,849 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 200 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-10-27 12:43:16,849 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:43:16,849 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 298
[2023-10-27 12:43:16,849 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:43:18,928 INFO  L130       PetriNetUnfolder]: 9731/15470 cut-off events.
[2023-10-27 12:43:18,993 INFO  L131       PetriNetUnfolder]: For 10784/11025 co-relation queries the response was YES.
[2023-10-27 12:43:19,008 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39942 conditions, 15470 events. 9731/15470 cut-off events. For 10784/11025 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 105251 event pairs, 5048 based on Foata normal form. 0/14387 useless extension candidates. Maximal degree in co-relation 39934. Up to 11067 conditions per place. 
[2023-10-27 12:43:19,099 INFO  L137   encePairwiseOnDemand]: 291/298 looper letters, 58 selfloop transitions, 14 changer transitions 0/80 dead transitions.
[2023-10-27 12:43:19,099 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 470 flow
[2023-10-27 12:43:19,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:43:19,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:43:19,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions.
[2023-10-27 12:43:19,101 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.569351230425056
[2023-10-27 12:43:19,101 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 509 transitions.
[2023-10-27 12:43:19,101 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions.
[2023-10-27 12:43:19,102 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:43:19,102 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions.
[2023-10-27 12:43:19,103 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 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-10-27 12:43:19,104 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 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-10-27 12:43:19,105 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 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-10-27 12:43:19,109 INFO  L175             Difference]: Start difference. First operand has 48 places, 49 transitions, 200 flow. Second operand 3 states and 509 transitions.
[2023-10-27 12:43:19,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 470 flow
[2023-10-27 12:43:19,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:43:19,228 INFO  L231             Difference]: Finished difference. Result has 50 places, 59 transitions, 312 flow
[2023-10-27 12:43:19,229 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=50, PETRI_TRANSITIONS=59}
[2023-10-27 12:43:19,232 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places.
[2023-10-27 12:43:19,232 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 59 transitions, 312 flow
[2023-10-27 12:43:19,233 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-10-27 12:43:19,233 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:19,233 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:43:19,233 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-27 12:43:19,236 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:43:19,237 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:19,237 INFO  L85        PathProgramCache]: Analyzing trace with hash 204596292, now seen corresponding path program 1 times
[2023-10-27 12:43:19,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:19,237 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710134937]
[2023-10-27 12:43:19,237 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:19,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:19,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:43:19,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:43:19,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:43:19,392 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710134937]
[2023-10-27 12:43:19,392 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710134937] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:43:19,392 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:43:19,393 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:43:19,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880665807]
[2023-10-27 12:43:19,394 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:43:19,394 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:43:19,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:43:19,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:43:19,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:43:19,430 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 298
[2023-10-27 12:43:19,430 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 59 transitions, 312 flow. Second operand  has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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-10-27 12:43:19,431 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:43:19,431 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 298
[2023-10-27 12:43:19,431 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:43:21,211 INFO  L130       PetriNetUnfolder]: 8388/13739 cut-off events.
[2023-10-27 12:43:21,211 INFO  L131       PetriNetUnfolder]: For 14127/15449 co-relation queries the response was YES.
[2023-10-27 12:43:21,225 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39149 conditions, 13739 events. 8388/13739 cut-off events. For 14127/15449 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 96174 event pairs, 4015 based on Foata normal form. 195/13261 useless extension candidates. Maximal degree in co-relation 39140. Up to 12235 conditions per place. 
[2023-10-27 12:43:21,301 INFO  L137   encePairwiseOnDemand]: 295/298 looper letters, 50 selfloop transitions, 2 changer transitions 0/65 dead transitions.
[2023-10-27 12:43:21,311 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 434 flow
[2023-10-27 12:43:21,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:43:21,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:43:21,312 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions.
[2023-10-27 12:43:21,313 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5637583892617449
[2023-10-27 12:43:21,325 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 504 transitions.
[2023-10-27 12:43:21,325 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions.
[2023-10-27 12:43:21,326 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:43:21,326 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions.
[2023-10-27 12:43:21,327 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 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-10-27 12:43:21,328 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 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-10-27 12:43:21,329 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 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-10-27 12:43:21,329 INFO  L175             Difference]: Start difference. First operand has 50 places, 59 transitions, 312 flow. Second operand 3 states and 504 transitions.
[2023-10-27 12:43:21,329 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 434 flow
[2023-10-27 12:43:21,361 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:43:21,362 INFO  L231             Difference]: Finished difference. Result has 51 places, 60 transitions, 296 flow
[2023-10-27 12:43:21,362 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=51, PETRI_TRANSITIONS=60}
[2023-10-27 12:43:21,363 INFO  L288   CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places.
[2023-10-27 12:43:21,364 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 296 flow
[2023-10-27 12:43:21,377 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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-10-27 12:43:21,378 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:21,378 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-10-27 12:43:21,378 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-27 12:43:21,378 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:43:21,379 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:21,379 INFO  L85        PathProgramCache]: Analyzing trace with hash -700945744, now seen corresponding path program 1 times
[2023-10-27 12:43:21,379 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:21,379 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385266379]
[2023-10-27 12:43:21,379 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:21,379 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:21,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:43:21,413 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:43:21,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:43:21,450 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:43:21,450 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:43:21,450 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2023-10-27 12:43:21,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2023-10-27 12:43:21,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2023-10-27 12:43:21,451 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2023-10-27 12:43:21,451 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2023-10-27 12:43:21,451 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2023-10-27 12:43:21,451 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2023-10-27 12:43:21,451 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining)
[2023-10-27 12:43:21,451 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2023-10-27 12:43:21,451 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2023-10-27 12:43:21,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2023-10-27 12:43:21,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2023-10-27 12:43:21,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2023-10-27 12:43:21,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-27 12:43:21,454 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-10-27 12:43:21,455 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:43:21,455 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-27 12:43:21,501 INFO  L144    ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions.
[2023-10-27 12:43:21,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 208 places, 203 transitions, 466 flow
[2023-10-27 12:43:21,645 INFO  L130       PetriNetUnfolder]: 41/931 cut-off events.
[2023-10-27 12:43:21,645 INFO  L131       PetriNetUnfolder]: For 39/39 co-relation queries the response was YES.
[2023-10-27 12:43:21,647 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 990 conditions, 931 events. 41/931 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4016 event pairs, 6 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 983. Up to 32 conditions per place. 
[2023-10-27 12:43:21,654 INFO  L82        GeneralOperation]: Start removeDead. Operand has 208 places, 203 transitions, 466 flow
[2023-10-27 12:43:21,657 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 173 places, 170 transitions, 376 flow
[2023-10-27 12:43:21,657 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:43:21,657 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 170 transitions, 376 flow
[2023-10-27 12:43:21,658 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 170 transitions, 376 flow
[2023-10-27 12:43:21,658 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 173 places, 170 transitions, 376 flow
[2023-10-27 12:43:21,779 INFO  L130       PetriNetUnfolder]: 41/931 cut-off events.
[2023-10-27 12:43:21,780 INFO  L131       PetriNetUnfolder]: For 39/39 co-relation queries the response was YES.
[2023-10-27 12:43:21,782 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 988 conditions, 931 events. 41/931 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4025 event pairs, 6 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 550. Up to 32 conditions per place. 
[2023-10-27 12:43:21,813 INFO  L119        LiptonReduction]: Number of co-enabled transitions 10304
[2023-10-27 12:43:27,282 INFO  L134        LiptonReduction]: Checked pairs total: 22351
[2023-10-27 12:43:27,283 INFO  L136        LiptonReduction]: Total number of compositions: 138
[2023-10-27 12:43:27,284 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:43:27,284 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;@c1c64f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:43:27,284 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-10-27 12:43:27,285 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-10-27 12:43:27,285 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:43:27,285 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:27,285 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-27 12:43:27,285 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:43:27,285 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:27,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 35991, now seen corresponding path program 1 times
[2023-10-27 12:43:27,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:27,285 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973174539]
[2023-10-27 12:43:27,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:27,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:27,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:43:27,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:43:27,314 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:43:27,315 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973174539]
[2023-10-27 12:43:27,315 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973174539] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:43:27,315 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:43:27,315 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-27 12:43:27,315 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30284568]
[2023-10-27 12:43:27,315 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:43:27,315 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:43:27,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:43:27,316 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:43:27,316 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:43:27,316 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 188 out of 341
[2023-10-27 12:43:27,317 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 138 flow. Second operand  has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 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-10-27 12:43:27,317 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:43:27,317 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 341
[2023-10-27 12:43:27,317 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:43:30,463 INFO  L130       PetriNetUnfolder]: 25895/40208 cut-off events.
[2023-10-27 12:43:30,463 INFO  L131       PetriNetUnfolder]: For 2471/2471 co-relation queries the response was YES.
[2023-10-27 12:43:30,517 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77549 conditions, 40208 events. 25895/40208 cut-off events. For 2471/2471 co-relation queries the response was YES. Maximal size of possible extension queue 1200. Compared 293706 event pairs, 25552 based on Foata normal form. 0/37624 useless extension candidates. Maximal degree in co-relation 10738. Up to 35675 conditions per place. 
[2023-10-27 12:43:30,809 INFO  L137   encePairwiseOnDemand]: 336/341 looper letters, 35 selfloop transitions, 0 changer transitions 0/46 dead transitions.
[2023-10-27 12:43:30,825 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 46 transitions, 198 flow
[2023-10-27 12:43:30,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:43:30,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:43:30,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 416 transitions.
[2023-10-27 12:43:30,827 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6099706744868035
[2023-10-27 12:43:30,827 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 416 transitions.
[2023-10-27 12:43:30,827 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 416 transitions.
[2023-10-27 12:43:30,828 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:43:30,828 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 416 transitions.
[2023-10-27 12:43:30,828 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 208.0) internal successors, (416), 2 states have internal predecessors, (416), 0 states have call successors, (0), 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-10-27 12:43:30,831 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 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-10-27 12:43:30,832 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 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-10-27 12:43:30,832 INFO  L175             Difference]: Start difference. First operand has 57 places, 51 transitions, 138 flow. Second operand 2 states and 416 transitions.
[2023-10-27 12:43:30,832 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 46 transitions, 198 flow
[2023-10-27 12:43:30,838 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:43:30,840 INFO  L231             Difference]: Finished difference. Result has 51 places, 46 transitions, 124 flow
[2023-10-27 12:43:30,840 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=51, PETRI_TRANSITIONS=46}
[2023-10-27 12:43:30,841 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, -6 predicate places.
[2023-10-27 12:43:30,843 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 124 flow
[2023-10-27 12:43:30,843 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 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-10-27 12:43:30,843 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:30,844 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-27 12:43:30,844 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-27 12:43:30,844 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:43:30,844 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:30,844 INFO  L85        PathProgramCache]: Analyzing trace with hash -1088264775, now seen corresponding path program 1 times
[2023-10-27 12:43:30,844 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:30,844 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321528198]
[2023-10-27 12:43:30,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:30,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:30,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:43:30,885 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:43:30,885 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:43:30,885 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321528198]
[2023-10-27 12:43:30,885 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321528198] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:43:30,885 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:43:30,885 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:43:30,886 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538651182]
[2023-10-27 12:43:30,886 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:43:30,887 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:43:30,887 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:43:30,887 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:43:30,887 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:43:30,916 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 341
[2023-10-27 12:43:30,929 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 124 flow. Second operand  has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 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-10-27 12:43:30,930 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:43:30,930 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 341
[2023-10-27 12:43:30,930 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:43:37,116 INFO  L130       PetriNetUnfolder]: 65423/93381 cut-off events.
[2023-10-27 12:43:37,116 INFO  L131       PetriNetUnfolder]: For 2419/2419 co-relation queries the response was YES.
[2023-10-27 12:43:37,245 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 184613 conditions, 93381 events. 65423/93381 cut-off events. For 2419/2419 co-relation queries the response was YES. Maximal size of possible extension queue 2065. Compared 630166 event pairs, 40463 based on Foata normal form. 0/88533 useless extension candidates. Maximal degree in co-relation 184607. Up to 63891 conditions per place. 
[2023-10-27 12:43:37,894 INFO  L137   encePairwiseOnDemand]: 334/341 looper letters, 55 selfloop transitions, 6 changer transitions 0/68 dead transitions.
[2023-10-27 12:43:37,894 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 290 flow
[2023-10-27 12:43:37,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:43:37,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:43:37,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 599 transitions.
[2023-10-27 12:43:37,908 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5855327468230694
[2023-10-27 12:43:37,908 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 599 transitions.
[2023-10-27 12:43:37,908 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 599 transitions.
[2023-10-27 12:43:37,909 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:43:37,909 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 599 transitions.
[2023-10-27 12:43:37,910 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 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-10-27 12:43:37,911 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:43:37,912 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:43:37,912 INFO  L175             Difference]: Start difference. First operand has 51 places, 46 transitions, 124 flow. Second operand 3 states and 599 transitions.
[2023-10-27 12:43:37,912 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 290 flow
[2023-10-27 12:43:37,913 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:43:37,914 INFO  L231             Difference]: Finished difference. Result has 55 places, 51 transitions, 170 flow
[2023-10-27 12:43:37,914 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=51}
[2023-10-27 12:43:37,915 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places.
[2023-10-27 12:43:37,915 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 170 flow
[2023-10-27 12:43:37,915 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 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-10-27 12:43:37,915 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:37,916 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:43:37,916 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-27 12:43:37,916 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:43:37,916 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:37,916 INFO  L85        PathProgramCache]: Analyzing trace with hash 475811630, now seen corresponding path program 1 times
[2023-10-27 12:43:37,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:37,916 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578659404]
[2023-10-27 12:43:37,917 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:37,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:37,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:43:37,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:43:37,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:43:37,958 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578659404]
[2023-10-27 12:43:37,958 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578659404] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:43:37,958 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:43:37,958 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:43:37,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767671706]
[2023-10-27 12:43:37,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:43:37,959 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:43:37,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:43:37,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:43:37,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:43:38,003 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 341
[2023-10-27 12:43:38,004 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 170 flow. Second operand  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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-10-27 12:43:38,004 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:43:38,004 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 341
[2023-10-27 12:43:38,004 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:43:45,331 INFO  L130       PetriNetUnfolder]: 70726/102789 cut-off events.
[2023-10-27 12:43:45,331 INFO  L131       PetriNetUnfolder]: For 28609/28629 co-relation queries the response was YES.
[2023-10-27 12:43:45,513 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 232032 conditions, 102789 events. 70726/102789 cut-off events. For 28609/28629 co-relation queries the response was YES. Maximal size of possible extension queue 2824. Compared 743451 event pairs, 53866 based on Foata normal form. 0/97766 useless extension candidates. Maximal degree in co-relation 232024. Up to 86448 conditions per place. 
[2023-10-27 12:43:45,959 INFO  L137   encePairwiseOnDemand]: 334/341 looper letters, 65 selfloop transitions, 10 changer transitions 0/84 dead transitions.
[2023-10-27 12:43:45,959 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 428 flow
[2023-10-27 12:43:45,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:43:45,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:43:45,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions.
[2023-10-27 12:43:45,965 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5865102639296188
[2023-10-27 12:43:45,965 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 600 transitions.
[2023-10-27 12:43:45,965 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 600 transitions.
[2023-10-27 12:43:45,965 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:43:45,965 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 600 transitions.
[2023-10-27 12:43:45,983 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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-10-27 12:43:45,985 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:43:45,985 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:43:45,985 INFO  L175             Difference]: Start difference. First operand has 55 places, 51 transitions, 170 flow. Second operand 3 states and 600 transitions.
[2023-10-27 12:43:45,986 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 428 flow
[2023-10-27 12:43:48,447 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:43:48,450 INFO  L231             Difference]: Finished difference. Result has 56 places, 59 transitions, 236 flow
[2023-10-27 12:43:48,451 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=56, PETRI_TRANSITIONS=59}
[2023-10-27 12:43:48,451 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places.
[2023-10-27 12:43:48,451 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 236 flow
[2023-10-27 12:43:48,452 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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-10-27 12:43:48,452 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:43:48,452 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:43:48,452 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-27 12:43:48,452 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:43:48,452 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:43:48,453 INFO  L85        PathProgramCache]: Analyzing trace with hash 620261372, now seen corresponding path program 1 times
[2023-10-27 12:43:48,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:43:48,453 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929289345]
[2023-10-27 12:43:48,453 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:43:48,453 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:43:48,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:43:48,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:43:48,507 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:43:48,507 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929289345]
[2023-10-27 12:43:48,507 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929289345] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:43:48,507 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:43:48,508 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:43:48,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934134732]
[2023-10-27 12:43:48,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:43:48,508 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:43:48,508 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:43:48,509 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:43:48,509 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:43:48,549 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 341
[2023-10-27 12:43:48,549 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 236 flow. Second operand  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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-10-27 12:43:48,549 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:43:48,549 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 341
[2023-10-27 12:43:48,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:43:54,545 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 141#L1017-6true, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:54,545 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:43:54,545 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:54,546 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:54,546 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,095 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][63], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-10-27 12:43:55,095 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,095 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,095 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,096 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,099 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][75], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-10-27 12:43:55,099 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,099 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][75], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, 37#L1018true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 150#L1018true, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,099 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,100 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][63], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 37#L1018true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-10-27 12:43:55,100 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,101 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,101 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,173 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 141#L1017-6true, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,173 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,174 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,174 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,174 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,175 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,175 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,175 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,175 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,175 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,186 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 37#L1018true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,186 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,186 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,186 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,186 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,193 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-10-27 12:43:55,193 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,193 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,194 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,194 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:43:55,600 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][63], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-10-27 12:43:55,600 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,601 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][75], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 150#L1018true, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,601 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,603 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][75], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, 37#L1018true, 164#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,603 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,603 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,603 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,603 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,604 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][63], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 37#L1018true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 5#threadEXITtrue, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-10-27 12:43:55,604 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,604 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,604 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,604 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,632 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 141#L1017-6true, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,632 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event
[2023-10-27 12:43:55,632 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:43:55,632 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:43:55,632 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:43:55,658 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][24], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 5#threadEXITtrue, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,658 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,658 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,658 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,659 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,664 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 113#L1017-4true, 220#true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,664 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,665 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,665 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,665 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,667 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 113#L1017-4true, 220#true, 37#L1018true, 164#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,667 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,667 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,667 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,667 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:43:55,891 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][75], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 220#true, 164#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,891 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,905 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,905 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,906 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,906 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][63], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 220#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 5#threadEXITtrue, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 23#L1017-4true])
[2023-10-27 12:43:55,906 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,906 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,907 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,907 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:55,929 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 141#L1017-6true, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,929 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-10-27 12:43:55,929 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:43:55,945 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:43:55,945 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:43:55,946 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:55,946 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-10-27 12:43:55,946 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:43:55,946 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:43:55,946 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:43:56,148 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][53], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 164#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:56,148 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-27 12:43:56,148 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:56,148 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:56,148 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:43:56,385 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][15], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 220#true, 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0)])
[2023-10-27 12:43:56,385 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is not cut-off event
[2023-10-27 12:43:56,385 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-10-27 12:43:56,385 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-10-27 12:43:56,385 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-10-27 12:43:57,354 INFO  L130       PetriNetUnfolder]: 83569/121077 cut-off events.
[2023-10-27 12:43:57,354 INFO  L131       PetriNetUnfolder]: For 70476/72388 co-relation queries the response was YES.
[2023-10-27 12:43:57,576 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 298958 conditions, 121077 events. 83569/121077 cut-off events. For 70476/72388 co-relation queries the response was YES. Maximal size of possible extension queue 3550. Compared 895480 event pairs, 59795 based on Foata normal form. 1/113492 useless extension candidates. Maximal degree in co-relation 298949. Up to 103147 conditions per place. 
[2023-10-27 12:43:58,091 INFO  L137   encePairwiseOnDemand]: 334/341 looper letters, 65 selfloop transitions, 12 changer transitions 0/86 dead transitions.
[2023-10-27 12:43:58,092 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 485 flow
[2023-10-27 12:43:58,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:43:58,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:43:58,093 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 594 transitions.
[2023-10-27 12:43:58,094 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5806451612903226
[2023-10-27 12:43:58,094 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 594 transitions.
[2023-10-27 12:43:58,094 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 594 transitions.
[2023-10-27 12:43:58,095 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:43:58,095 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 594 transitions.
[2023-10-27 12:43:58,101 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 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-10-27 12:43:58,118 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:43:58,118 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:43:58,118 INFO  L175             Difference]: Start difference. First operand has 56 places, 59 transitions, 236 flow. Second operand 3 states and 594 transitions.
[2023-10-27 12:43:58,118 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 485 flow
[2023-10-27 12:44:00,710 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 86 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:44:00,711 INFO  L231             Difference]: Finished difference. Result has 58 places, 67 transitions, 324 flow
[2023-10-27 12:44:00,712 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=58, PETRI_TRANSITIONS=67}
[2023-10-27 12:44:00,713 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 1 predicate places.
[2023-10-27 12:44:00,713 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 67 transitions, 324 flow
[2023-10-27 12:44:00,713 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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-10-27 12:44:00,713 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:44:00,713 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:44:00,714 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-27 12:44:00,714 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:44:00,714 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:44:00,714 INFO  L85        PathProgramCache]: Analyzing trace with hash -908940002, now seen corresponding path program 1 times
[2023-10-27 12:44:00,714 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:44:00,714 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142082110]
[2023-10-27 12:44:00,714 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:44:00,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:44:00,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:44:00,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:44:00,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:44:00,824 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142082110]
[2023-10-27 12:44:00,824 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142082110] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:44:00,824 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:44:00,824 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:44:00,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171141597]
[2023-10-27 12:44:00,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:44:00,824 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:44:00,825 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:44:00,825 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:44:00,825 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:44:00,857 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 184 out of 341
[2023-10-27 12:44:00,857 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 67 transitions, 324 flow. Second operand  has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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-10-27 12:44:00,857 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:44:00,858 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 341
[2023-10-27 12:44:00,858 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:44:04,706 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 22#$Ultimate##0true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:04,707 INFO  L383   tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event
[2023-10-27 12:44:04,707 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is not cut-off event
[2023-10-27 12:44:04,707 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is not cut-off event
[2023-10-27 12:44:04,707 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is not cut-off event
[2023-10-27 12:44:05,148 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][40], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 83#L1017true, 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:05,148 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:05,148 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:05,149 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:05,149 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:05,149 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][40], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 153#L1017-4true, threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:05,149 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event
[2023-10-27 12:44:05,149 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-27 12:44:05,149 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-27 12:44:05,149 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-27 12:44:05,152 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:05,152 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event
[2023-10-27 12:44:05,152 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-27 12:44:05,152 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-27 12:44:05,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-27 12:44:05,211 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 29#L1016-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:05,211 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:05,211 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:05,211 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:05,211 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:05,680 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][40], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 83#L1017true, 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:05,680 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:05,681 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:05,681 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:05,681 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:05,681 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][40], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 164#threadEXITtrue, 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:05,681 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-10-27 12:44:05,681 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:05,681 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:05,681 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:05,685 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 15#threadEXITtrue, 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:05,685 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-10-27 12:44:05,685 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:05,685 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:05,685 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:05,686 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, Black: 216#(= |#race~data~0| 0), 230#true, 144#L1017-2true])
[2023-10-27 12:44:05,686 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:05,686 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:05,686 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:05,686 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:06,179 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 225#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:06,179 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:06,179 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:06,180 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:06,180 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:06,191 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:06,194 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:44:06,194 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:06,195 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:06,195 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:06,214 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:06,214 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,214 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,214 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,214 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,449 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][35], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 148#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 225#true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:06,449 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:44:06,450 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:06,450 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:06,450 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:06,641 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:06,642 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:06,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:06,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:06,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:06,655 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][26], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 225#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:06,655 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:06,655 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:06,656 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:06,656 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:06,658 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:06,658 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,658 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,658 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,658 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,673 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][62], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:06,673 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-27 12:44:06,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:06,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:06,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:06,702 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][26], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:06,703 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,703 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,703 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,703 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,741 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][35], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 148#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 225#true, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:06,741 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,742 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,742 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:06,742 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:07,083 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][67], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:07,084 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:07,085 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:07,085 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:07,085 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:07,097 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][26], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 225#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:07,097 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:07,097 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:07,098 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:07,098 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:07,124 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][26], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 225#true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:07,125 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-27 12:44:07,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:07,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:07,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:08,283 INFO  L130       PetriNetUnfolder]: 68016/102342 cut-off events.
[2023-10-27 12:44:08,283 INFO  L131       PetriNetUnfolder]: For 108037/120330 co-relation queries the response was YES.
[2023-10-27 12:44:08,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271307 conditions, 102342 events. 68016/102342 cut-off events. For 108037/120330 co-relation queries the response was YES. Maximal size of possible extension queue 3443. Compared 809054 event pairs, 39581 based on Foata normal form. 1957/98421 useless extension candidates. Maximal degree in co-relation 271297. Up to 88600 conditions per place. 
[2023-10-27 12:44:08,990 INFO  L137   encePairwiseOnDemand]: 338/341 looper letters, 51 selfloop transitions, 2 changer transitions 0/73 dead transitions.
[2023-10-27 12:44:08,991 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 444 flow
[2023-10-27 12:44:08,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:44:08,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:44:08,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 594 transitions.
[2023-10-27 12:44:08,992 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5806451612903226
[2023-10-27 12:44:08,992 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 594 transitions.
[2023-10-27 12:44:08,993 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 594 transitions.
[2023-10-27 12:44:08,993 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:44:08,993 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 594 transitions.
[2023-10-27 12:44:08,994 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 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-10-27 12:44:08,995 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:44:08,995 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:44:08,996 INFO  L175             Difference]: Start difference. First operand has 58 places, 67 transitions, 324 flow. Second operand 3 states and 594 transitions.
[2023-10-27 12:44:08,996 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 444 flow
[2023-10-27 12:44:11,123 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:44:11,124 INFO  L231             Difference]: Finished difference. Result has 60 places, 68 transitions, 324 flow
[2023-10-27 12:44:11,124 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=60, PETRI_TRANSITIONS=68}
[2023-10-27 12:44:11,125 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places.
[2023-10-27 12:44:11,126 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 68 transitions, 324 flow
[2023-10-27 12:44:11,126 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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-10-27 12:44:11,126 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:44:11,126 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:44:11,127 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-27 12:44:11,127 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:44:11,127 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:44:11,127 INFO  L85        PathProgramCache]: Analyzing trace with hash -1014108095, now seen corresponding path program 1 times
[2023-10-27 12:44:11,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:44:11,127 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923327473]
[2023-10-27 12:44:11,128 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:44:11,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:44:11,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:44:11,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-27 12:44:11,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:44:11,196 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923327473]
[2023-10-27 12:44:11,196 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923327473] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:44:11,196 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:44:11,196 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:44:11,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944368486]
[2023-10-27 12:44:11,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:44:11,196 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:44:11,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:44:11,197 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:44:11,197 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:44:11,240 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 341
[2023-10-27 12:44:11,241 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 68 transitions, 324 flow. Second operand  has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 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-10-27 12:44:11,241 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:44:11,241 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 341
[2023-10-27 12:44:11,241 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:44:16,463 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, 22#$Ultimate##0true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:16,463 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event
[2023-10-27 12:44:16,464 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2023-10-27 12:44:16,464 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2023-10-27 12:44:16,464 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2023-10-27 12:44:17,194 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 29#L1016-1true, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:17,195 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event
[2023-10-27 12:44:17,195 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-27 12:44:17,195 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-27 12:44:17,195 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-27 12:44:17,224 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 8#$Ultimate##0true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:17,224 INFO  L383   tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:17,224 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:17,224 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:17,224 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is not cut-off event
[2023-10-27 12:44:17,981 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:17,982 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-10-27 12:44:17,982 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:17,982 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:17,982 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:17,983 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 144#L1017-2true])
[2023-10-27 12:44:17,983 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-10-27 12:44:17,983 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:17,983 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:17,983 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-27 12:44:18,073 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 40#L1016-1true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:18,073 INFO  L383   tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:18,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:18,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:18,073 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is not cut-off event
[2023-10-27 12:44:18,552 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 134#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 151#L1018true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:18,552 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,552 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,552 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,552 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,622 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:18,622 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,622 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,622 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,622 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,623 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:18,623 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,623 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,623 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,623 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,629 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][35], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 235#true, 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 181#L1017-3true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:18,629 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:18,629 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:18,629 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:18,629 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:18,630 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 12#L1017-2true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:18,630 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:18,630 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:18,630 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:18,630 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is not cut-off event
[2023-10-27 12:44:18,631 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 150#L1018true, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:18,631 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,631 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,632 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,632 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-27 12:44:18,650 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:18,650 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:18,650 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:18,650 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:18,650 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:18,652 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:18,652 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:18,652 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:18,652 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:18,653 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,065 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 134#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 54#threadEXITtrue, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:19,066 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,156 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 151#L1018true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:19,156 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,157 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,157 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,157 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,211 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 150#L1018true, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:19,212 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,213 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:19,213 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,216 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][35], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 235#true, 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:19,216 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,217 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,230 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][21], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:19,231 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:19,231 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:19,231 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:19,231 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is not cut-off event
[2023-10-27 12:44:19,238 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:19,239 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,239 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,239 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,239 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-27 12:44:19,252 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][69], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:19,252 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,252 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,252 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,253 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,610 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 54#threadEXITtrue, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:19,611 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,611 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,611 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,611 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,739 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:19,740 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,744 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_37| |v_threadThread1of3ForFork1_#t~nondet5_13|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_37|, threadThread1of3ForFork1_#t~nondet5=|v_threadThread1of3ForFork1_#t~nondet5_13|}  AuxVars[]  AssignedVars[#race~data~0, threadThread1of3ForFork1_#t~nondet5][35], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 235#true, 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 153#L1017-4true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, 57#L1033-2true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:19,744 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,744 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,744 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,744 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-27 12:44:19,753 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][21], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, 141#L1017-6true, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:19,754 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,754 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,754 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,754 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,755 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][21], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, 37#L1018true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:19,755 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,755 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,755 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,755 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,760 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([894] L1017-3-->L1017-4: Formula: (= |v_threadThread3of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork0_#t~nondet5=|v_threadThread3of3ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][86], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 113#L1017-4true, 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 211#true, 57#L1033-2true, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#(= |#race~data~0| 0), 230#true])
[2023-10-27 12:44:19,760 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:19,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is not cut-off event
[2023-10-27 12:44:20,211 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1017-2-->L1017-4: Formula: (= |v_#race~data~0_41| |v_threadThread2of3ForFork0_#t~nondet5_15|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet5=|v_threadThread2of3ForFork0_#t~nondet5_15|, #race~data~0=|v_#race~data~0_41|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet5, #race~data~0][21], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 111#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), threadThread2of3ForFork0InUse, 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 15#threadEXITtrue, Black: 216#(= |#race~data~0| 0), 230#true, 23#L1017-4true])
[2023-10-27 12:44:20,211 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is not cut-off event
[2023-10-27 12:44:20,211 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-10-27 12:44:20,212 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-10-27 12:44:20,212 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is not cut-off event
[2023-10-27 12:44:22,975 INFO  L130       PetriNetUnfolder]: 96416/139811 cut-off events.
[2023-10-27 12:44:22,975 INFO  L131       PetriNetUnfolder]: For 136186/141225 co-relation queries the response was YES.
[2023-10-27 12:44:23,267 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 374460 conditions, 139811 events. 96416/139811 cut-off events. For 136186/141225 co-relation queries the response was YES. Maximal size of possible extension queue 4318. Compared 1054381 event pairs, 63536 based on Foata normal form. 91/130314 useless extension candidates. Maximal degree in co-relation 374449. Up to 118364 conditions per place. 
[2023-10-27 12:44:23,734 INFO  L137   encePairwiseOnDemand]: 334/341 looper letters, 77 selfloop transitions, 14 changer transitions 0/100 dead transitions.
[2023-10-27 12:44:23,734 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 635 flow
[2023-10-27 12:44:23,735 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:44:23,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:44:23,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 599 transitions.
[2023-10-27 12:44:23,737 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5855327468230694
[2023-10-27 12:44:23,737 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 599 transitions.
[2023-10-27 12:44:23,737 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 599 transitions.
[2023-10-27 12:44:23,738 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:44:23,738 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 599 transitions.
[2023-10-27 12:44:23,739 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 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-10-27 12:44:23,740 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:44:23,740 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:44:23,740 INFO  L175             Difference]: Start difference. First operand has 60 places, 68 transitions, 324 flow. Second operand 3 states and 599 transitions.
[2023-10-27 12:44:23,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 635 flow
[2023-10-27 12:44:23,772 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 100 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:44:23,793 INFO  L231             Difference]: Finished difference. Result has 62 places, 76 transitions, 440 flow
[2023-10-27 12:44:23,794 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=62, PETRI_TRANSITIONS=76}
[2023-10-27 12:44:23,795 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 5 predicate places.
[2023-10-27 12:44:23,795 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 76 transitions, 440 flow
[2023-10-27 12:44:23,796 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 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-10-27 12:44:23,796 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:44:23,796 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:44:23,796 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-27 12:44:23,796 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:44:23,797 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:44:23,797 INFO  L85        PathProgramCache]: Analyzing trace with hash 1578593416, now seen corresponding path program 1 times
[2023-10-27 12:44:23,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:44:23,797 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867083181]
[2023-10-27 12:44:23,797 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:44:23,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:44:23,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:44:23,922 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:44:23,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:44:23,922 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867083181]
[2023-10-27 12:44:23,922 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867083181] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:44:23,922 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303627902]
[2023-10-27 12:44:23,922 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:44:23,923 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:44:23,923 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:44:23,930 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-10-27 12:44:23,956 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-10-27 12:44:24,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:44:24,089 INFO  L263         TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-27 12:44:24,091 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:44:24,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:44:24,216 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:44:24,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:44:24,282 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [303627902] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:44:24,283 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:44:24,283 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-27 12:44:24,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918465324]
[2023-10-27 12:44:24,283 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:44:24,283 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-27 12:44:24,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:44:24,284 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-27 12:44:24,284 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-27 12:44:24,503 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 341
[2023-10-27 12:44:24,505 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 76 transitions, 440 flow. Second operand  has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 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-10-27 12:44:24,505 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:44:24,505 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 341
[2023-10-27 12:44:24,505 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:44:30,351 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L1029-6-->L1033-1: Formula: (and (= |v_#valid_189| (store |v_#valid_190| (select (select |v_#memory_$Pointer$.base_202| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) (= |v_#race~data~0_51| 0) (= (store |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380| (store (store (store (store (select |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) |v_#race_649|) (not (< |v_ULTIMATE.start_main_~i~1#1_178| |v_ULTIMATE.start_main_~threads_total~0#1_193|)))  InVars {#race=|v_#race_651|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_190|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|}  OutVars{#race=|v_#race_649|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, #race~data~0=|v_#race~data~0_51|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_81|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][78], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 322#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, Black: 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 211#true, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 141#L1017-6true, Black: 214#true, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 129#L1033-1true])
[2023-10-27 12:44:30,351 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is not cut-off event
[2023-10-27 12:44:30,351 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-10-27 12:44:30,351 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-10-27 12:44:30,352 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-10-27 12:44:30,353 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L1029-6-->L1033-1: Formula: (and (= |v_#valid_189| (store |v_#valid_190| (select (select |v_#memory_$Pointer$.base_202| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) (= |v_#race~data~0_51| 0) (= (store |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380| (store (store (store (store (select |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) |v_#race_649|) (not (< |v_ULTIMATE.start_main_~i~1#1_178| |v_ULTIMATE.start_main_~threads_total~0#1_193|)))  InVars {#race=|v_#race_651|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_190|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|}  OutVars{#race=|v_#race_649|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, #race~data~0=|v_#race~data~0_51|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_81|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][78], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 322#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 150#L1018true, Black: 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 211#true, threadThread3of3ForFork0NotInUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#true, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 129#L1033-1true])
[2023-10-27 12:44:30,353 INFO  L383   tUnfolder$Statistics]: this new event has 38 ancestors and is not cut-off event
[2023-10-27 12:44:30,353 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-10-27 12:44:30,354 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-10-27 12:44:30,354 INFO  L386   tUnfolder$Statistics]:   existing Event has 38 ancestors and is not cut-off event
[2023-10-27 12:44:30,786 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L1029-6-->L1033-1: Formula: (and (= |v_#valid_189| (store |v_#valid_190| (select (select |v_#memory_$Pointer$.base_202| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) (= |v_#race~data~0_51| 0) (= (store |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380| (store (store (store (store (select |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) |v_#race_649|) (not (< |v_ULTIMATE.start_main_~i~1#1_178| |v_ULTIMATE.start_main_~threads_total~0#1_193|)))  InVars {#race=|v_#race_651|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_190|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|}  OutVars{#race=|v_#race_649|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, #race~data~0=|v_#race~data~0_51|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_81|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][78], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 322#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, Black: 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 211#true, 5#threadEXITtrue, threadThread3of3ForFork0InUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#true, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 129#L1033-1true])
[2023-10-27 12:44:30,786 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is not cut-off event
[2023-10-27 12:44:30,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-10-27 12:44:30,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-10-27 12:44:30,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-10-27 12:44:30,786 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L1029-6-->L1033-1: Formula: (and (= |v_#valid_189| (store |v_#valid_190| (select (select |v_#memory_$Pointer$.base_202| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) (= |v_#race~data~0_51| 0) (= (store |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380| (store (store (store (store (select |v_#race_651| |v_ULTIMATE.start_main_~#tids~0#1.base_380|) |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 0) (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_366| 1) 0) (+ 2 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0) (+ 3 |v_ULTIMATE.start_main_~#tids~0#1.offset_366|) 0)) |v_#race_649|) (not (< |v_ULTIMATE.start_main_~i~1#1_178| |v_ULTIMATE.start_main_~threads_total~0#1_193|)))  InVars {#race=|v_#race_651|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_190|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|}  OutVars{#race=|v_#race_649|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_366|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_178|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_202|, #race~data~0=|v_#race~data~0_51|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_380|, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~mem18#1.base=|v_ULTIMATE.start_main_#t~mem18#1.base_97|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_193|, ULTIMATE.start_main_#t~mem18#1.offset=|v_ULTIMATE.start_main_#t~mem18#1.offset_81|}  AuxVars[]  AssignedVars[#race, #race~data~0, #valid, ULTIMATE.start_main_#t~mem18#1.base, ULTIMATE.start_main_#t~mem18#1.offset][78], [Black: 222#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 322#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 235#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 164#threadEXITtrue, Black: 232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 237#(= |threadThread2of3ForFork0_#t~nondet5| |#race~data~0|), 211#true, threadThread3of3ForFork0NotInUse, 171#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 98#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#true, 129#L1033-1true])
[2023-10-27 12:44:30,786 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is not cut-off event
[2023-10-27 12:44:30,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-10-27 12:44:30,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-10-27 12:44:30,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is not cut-off event
[2023-10-27 12:44:30,971 INFO  L130       PetriNetUnfolder]: 49021/75386 cut-off events.
[2023-10-27 12:44:30,971 INFO  L131       PetriNetUnfolder]: For 122862/137052 co-relation queries the response was YES.
[2023-10-27 12:44:31,129 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 206178 conditions, 75386 events. 49021/75386 cut-off events. For 122862/137052 co-relation queries the response was YES. Maximal size of possible extension queue 2377. Compared 594295 event pairs, 13664 based on Foata normal form. 5116/77323 useless extension candidates. Maximal degree in co-relation 206166. Up to 36030 conditions per place. 
[2023-10-27 12:44:31,351 INFO  L137   encePairwiseOnDemand]: 335/341 looper letters, 107 selfloop transitions, 6 changer transitions 0/137 dead transitions.
[2023-10-27 12:44:31,351 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 137 transitions, 922 flow
[2023-10-27 12:44:31,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:44:31,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:44:31,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1152 transitions.
[2023-10-27 12:44:31,373 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5630498533724341
[2023-10-27 12:44:31,373 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1152 transitions.
[2023-10-27 12:44:31,373 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1152 transitions.
[2023-10-27 12:44:31,374 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:44:31,374 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1152 transitions.
[2023-10-27 12:44:31,376 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 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-10-27 12:44:31,378 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 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-10-27 12:44:31,378 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 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-10-27 12:44:31,378 INFO  L175             Difference]: Start difference. First operand has 62 places, 76 transitions, 440 flow. Second operand 6 states and 1152 transitions.
[2023-10-27 12:44:31,378 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 137 transitions, 922 flow
[2023-10-27 12:44:31,744 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 137 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:44:31,746 INFO  L231             Difference]: Finished difference. Result has 68 places, 78 transitions, 459 flow
[2023-10-27 12:44:31,746 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=68, PETRI_TRANSITIONS=78}
[2023-10-27 12:44:31,748 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places.
[2023-10-27 12:44:31,748 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 78 transitions, 459 flow
[2023-10-27 12:44:31,749 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 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-10-27 12:44:31,749 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:44:31,749 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:44:31,755 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-10-27 12:44:31,953 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2023-10-27 12:44:31,954 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:44:31,954 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:44:31,955 INFO  L85        PathProgramCache]: Analyzing trace with hash -1560409466, now seen corresponding path program 1 times
[2023-10-27 12:44:31,955 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:44:31,955 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263894649]
[2023-10-27 12:44:31,955 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:44:31,956 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:44:31,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:44:32,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:44:32,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:44:32,082 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263894649]
[2023-10-27 12:44:32,082 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263894649] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:44:32,083 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:44:32,083 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:44:32,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940409713]
[2023-10-27 12:44:32,083 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:44:32,084 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:44:32,084 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:44:32,084 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:44:32,084 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:44:32,115 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 341
[2023-10-27 12:44:32,116 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 78 transitions, 459 flow. Second operand  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 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-10-27 12:44:32,116 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:44:32,116 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 341
[2023-10-27 12:44:32,116 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:44:32,861 INFO  L130       PetriNetUnfolder]: 3495/8052 cut-off events.
[2023-10-27 12:44:32,862 INFO  L131       PetriNetUnfolder]: For 11212/11487 co-relation queries the response was YES.
[2023-10-27 12:44:32,874 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23942 conditions, 8052 events. 3495/8052 cut-off events. For 11212/11487 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 69355 event pairs, 705 based on Foata normal form. 2474/10261 useless extension candidates. Maximal degree in co-relation 23928. Up to 5445 conditions per place. 
[2023-10-27 12:44:32,886 INFO  L137   encePairwiseOnDemand]: 333/341 looper letters, 56 selfloop transitions, 8 changer transitions 0/78 dead transitions.
[2023-10-27 12:44:32,886 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 525 flow
[2023-10-27 12:44:32,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:44:32,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:44:32,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions.
[2023-10-27 12:44:32,896 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5659824046920822
[2023-10-27 12:44:32,897 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 579 transitions.
[2023-10-27 12:44:32,897 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions.
[2023-10-27 12:44:32,897 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:44:32,897 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions.
[2023-10-27 12:44:32,898 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 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-10-27 12:44:32,899 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:44:32,900 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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-10-27 12:44:32,900 INFO  L175             Difference]: Start difference. First operand has 68 places, 78 transitions, 459 flow. Second operand 3 states and 579 transitions.
[2023-10-27 12:44:32,900 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 525 flow
[2023-10-27 12:44:32,906 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 515 flow, removed 3 selfloop flow, removed 2 redundant places.
[2023-10-27 12:44:32,934 INFO  L231             Difference]: Finished difference. Result has 68 places, 60 transitions, 310 flow
[2023-10-27 12:44:32,934 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=68, PETRI_TRANSITIONS=60}
[2023-10-27 12:44:32,935 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places.
[2023-10-27 12:44:32,936 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 310 flow
[2023-10-27 12:44:32,936 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 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-10-27 12:44:32,936 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:44:32,936 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-10-27 12:44:32,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-10-27 12:44:32,936 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:44:32,937 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:44:32,937 INFO  L85        PathProgramCache]: Analyzing trace with hash 38143271, now seen corresponding path program 1 times
[2023-10-27 12:44:32,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:44:32,937 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961014256]
[2023-10-27 12:44:32,937 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:44:32,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:44:32,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:44:32,988 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:44:33,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:44:33,017 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:44:33,017 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:44:33,018 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining)
[2023-10-27 12:44:33,018 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2023-10-27 12:44:33,018 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2023-10-27 12:44:33,018 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2023-10-27 12:44:33,018 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2023-10-27 12:44:33,019 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2023-10-27 12:44:33,019 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining)
[2023-10-27 12:44:33,019 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 15 remaining)
[2023-10-27 12:44:33,019 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2023-10-27 12:44:33,019 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2023-10-27 12:44:33,019 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2023-10-27 12:44:33,020 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2023-10-27 12:44:33,020 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2023-10-27 12:44:33,020 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2023-10-27 12:44:33,020 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2023-10-27 12:44:33,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-10-27 12:44:33,020 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:44:33,021 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:44:33,021 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-10-27 12:44:33,064 INFO  L144    ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions.
[2023-10-27 12:44:33,067 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 242 places, 235 transitions, 558 flow
[2023-10-27 12:44:33,253 INFO  L130       PetriNetUnfolder]: 91/1682 cut-off events.
[2023-10-27 12:44:33,253 INFO  L131       PetriNetUnfolder]: For 96/96 co-relation queries the response was YES.
[2023-10-27 12:44:33,258 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 1682 events. 91/1682 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8919 event pairs, 23 based on Foata normal form. 0/1460 useless extension candidates. Maximal degree in co-relation 1790. Up to 80 conditions per place. 
[2023-10-27 12:44:33,258 INFO  L82        GeneralOperation]: Start removeDead. Operand has 242 places, 235 transitions, 558 flow
[2023-10-27 12:44:33,261 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 190 places, 186 transitions, 422 flow
[2023-10-27 12:44:33,261 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:44:33,261 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 186 transitions, 422 flow
[2023-10-27 12:44:33,261 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 186 transitions, 422 flow
[2023-10-27 12:44:33,262 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 190 places, 186 transitions, 422 flow
[2023-10-27 12:44:33,386 INFO  L130       PetriNetUnfolder]: 91/1682 cut-off events.
[2023-10-27 12:44:33,386 INFO  L131       PetriNetUnfolder]: For 96/96 co-relation queries the response was YES.
[2023-10-27 12:44:33,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 1682 events. 91/1682 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8951 event pairs, 23 based on Foata normal form. 0/1460 useless extension candidates. Maximal degree in co-relation 979. Up to 80 conditions per place. 
[2023-10-27 12:44:33,428 INFO  L119        LiptonReduction]: Number of co-enabled transitions 14280
[2023-10-27 12:44:38,754 INFO  L134        LiptonReduction]: Checked pairs total: 33335
[2023-10-27 12:44:38,754 INFO  L136        LiptonReduction]: Total number of compositions: 145
[2023-10-27 12:44:38,755 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:44:38,755 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;@c1c64f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:44:38,755 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 17 error locations.
[2023-10-27 12:44:38,756 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-10-27 12:44:38,756 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:44:38,756 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:44:38,756 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-27 12:44:38,756 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2023-10-27 12:44:38,756 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:44:38,756 INFO  L85        PathProgramCache]: Analyzing trace with hash 48699, now seen corresponding path program 1 times
[2023-10-27 12:44:38,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:44:38,756 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118281245]
[2023-10-27 12:44:38,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:44:38,757 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:44:38,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:44:38,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:44:38,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:44:38,783 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118281245]
[2023-10-27 12:44:38,783 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118281245] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:44:38,783 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:44:38,783 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-27 12:44:38,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486907220]
[2023-10-27 12:44:38,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:44:38,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:44:38,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:44:38,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:44:38,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:44:38,785 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 216 out of 380
[2023-10-27 12:44:38,786 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 168 flow. Second operand  has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 0 states have call successors, (0), 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-10-27 12:44:38,786 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:44:38,786 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 380
[2023-10-27 12:44:38,786 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:44:58,407 INFO  L130       PetriNetUnfolder]: 165209/231430 cut-off events.
[2023-10-27 12:44:58,408 INFO  L131       PetriNetUnfolder]: For 17698/17698 co-relation queries the response was YES.
[2023-10-27 12:44:58,931 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 456607 conditions, 231430 events. 165209/231430 cut-off events. For 17698/17698 co-relation queries the response was YES. Maximal size of possible extension queue 5561. Compared 1754395 event pairs, 163655 based on Foata normal form. 0/218136 useless extension candidates. Maximal degree in co-relation 65195. Up to 214973 conditions per place. 
[2023-10-27 12:45:00,677 INFO  L137   encePairwiseOnDemand]: 375/380 looper letters, 40 selfloop transitions, 0 changer transitions 0/54 dead transitions.
[2023-10-27 12:45:00,677 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 238 flow
[2023-10-27 12:45:00,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:45:00,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:45:00,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 477 transitions.
[2023-10-27 12:45:00,679 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6276315789473684
[2023-10-27 12:45:00,679 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 477 transitions.
[2023-10-27 12:45:00,679 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 477 transitions.
[2023-10-27 12:45:00,679 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:45:00,679 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 477 transitions.
[2023-10-27 12:45:00,680 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 238.5) internal successors, (477), 2 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-10-27 12:45:00,681 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 380.0) internal successors, (1140), 3 states have internal predecessors, (1140), 0 states have call successors, (0), 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-10-27 12:45:00,682 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 380.0) internal successors, (1140), 3 states have internal predecessors, (1140), 0 states have call successors, (0), 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-10-27 12:45:00,682 INFO  L175             Difference]: Start difference. First operand has 66 places, 59 transitions, 168 flow. Second operand 2 states and 477 transitions.
[2023-10-27 12:45:00,682 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 238 flow
[2023-10-27 12:45:00,721 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:45:00,721 INFO  L231             Difference]: Finished difference. Result has 60 places, 54 transitions, 154 flow
[2023-10-27 12:45:00,722 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=154, PETRI_PLACES=60, PETRI_TRANSITIONS=54}
[2023-10-27 12:45:00,722 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places.
[2023-10-27 12:45:00,722 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 154 flow
[2023-10-27 12:45:00,723 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 0 states have call successors, (0), 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-10-27 12:45:00,723 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:45:00,723 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-27 12:45:00,723 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-10-27 12:45:00,723 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2023-10-27 12:45:00,727 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:45:00,727 INFO  L85        PathProgramCache]: Analyzing trace with hash 2065214140, now seen corresponding path program 1 times
[2023-10-27 12:45:00,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:45:00,728 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002979662]
[2023-10-27 12:45:00,728 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:45:00,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:45:00,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:45:00,788 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:45:00,788 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:45:00,788 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002979662]
[2023-10-27 12:45:00,788 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002979662] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:45:00,788 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:45:00,788 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:45:00,789 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560638484]
[2023-10-27 12:45:00,789 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:45:00,789 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:45:00,789 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:45:00,790 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:45:00,790 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:45:00,820 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 205 out of 380
[2023-10-27 12:45:00,821 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 154 flow. Second operand  has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 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-10-27 12:45:00,821 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:45:00,821 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 380
[2023-10-27 12:45:00,821 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
