./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/per-thread-struct-tid-join.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid-join.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --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 c78e5c0cfa2f4bf3326d6e46ba5ac9d8f8eb60e6659b4e4ca45ae2af9e210b36
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 01:08:32,788 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 01:08:32,828 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-12 01:08:32,831 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 01:08:32,831 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 01:08:32,847 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 01:08:32,847 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 01:08:32,848 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 01:08:32,848 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 01:08:32,848 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 01:08:32,849 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 01:08:32,849 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 01:08:32,849 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 01:08:32,850 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 01:08:32,850 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 01:08:32,850 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 01:08:32,851 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 01:08:32,851 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 01:08:32,851 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 01:08:32,851 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 01:08:32,852 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 01:08:32,852 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 01:08:32,852 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 01:08:32,853 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 01:08:32,853 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 01:08:32,853 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 01:08:32,853 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 01:08:32,854 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 01:08:32,854 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 01:08:32,854 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 01:08:32,854 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:08:32,855 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 01:08:32,855 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 01:08:32,855 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 01:08:32,855 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 01:08:32,856 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 01:08:32,856 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 01:08:32,856 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 01:08:32,856 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 01:08:32,856 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 01:08:32,857 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 01:08:32,857 INFO  L153        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-pldi24/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-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> c78e5c0cfa2f4bf3326d6e46ba5ac9d8f8eb60e6659b4e4ca45ae2af9e210b36
[2024-03-12 01:08:33,021 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 01:08:33,045 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 01:08:33,048 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 01:08:33,050 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 01:08:33,050 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 01:08:33,051 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid-join.i
[2024-03-12 01:08:34,182 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 01:08:34,367 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 01:08:34,367 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid-join.i
[2024-03-12 01:08:34,380 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/49192d78c/525ae83bf0774ca8a8b5c5bea7cb94a8/FLAGa752e1e99
[2024-03-12 01:08:34,390 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/49192d78c/525ae83bf0774ca8a8b5c5bea7cb94a8
[2024-03-12 01:08:34,392 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 01:08:34,393 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 01:08:34,394 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 01:08:34,394 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 01:08:34,398 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 01:08:34,398 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,399 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720d36ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34, skipping insertion in model container
[2024-03-12 01:08:34,399 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,436 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 01:08:34,729 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:08:34,739 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 01:08:34,769 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:08:34,826 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 01:08:34,826 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34 WrapperNode
[2024-03-12 01:08:34,826 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 01:08:34,827 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 01:08:34,827 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 01:08:34,827 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 01:08:34,832 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,847 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,866 INFO  L138                Inliner]: procedures = 267, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86
[2024-03-12 01:08:34,867 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 01:08:34,867 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 01:08:34,867 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 01:08:34,868 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 01:08:34,875 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,875 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,879 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,879 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,886 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,888 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,890 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,891 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,894 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 01:08:34,894 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 01:08:34,894 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 01:08:34,894 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 01:08:34,895 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (1/1) ...
[2024-03-12 01:08:34,900 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:08:34,908 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:08:34,936 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-12 01:08:34,940 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-12 01:08:34,965 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-12 01:08:34,965 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 01:08:34,965 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-12 01:08:34,965 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 01:08:34,966 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 01:08:34,966 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-12 01:08:34,966 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-12 01:08:34,966 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-12 01:08:34,966 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2024-03-12 01:08:34,967 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-12 01:08:34,967 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 01:08:34,967 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 01:08:34,967 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 01:08:34,967 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 01:08:34,969 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-12 01:08:35,103 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 01:08:35,105 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 01:08:35,277 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 01:08:35,290 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 01:08:35,290 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 01:08:35,291 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:08:35 BoogieIcfgContainer
[2024-03-12 01:08:35,291 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 01:08:35,293 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 01:08:35,293 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 01:08:35,295 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 01:08:35,295 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 01:08:34" (1/3) ...
[2024-03-12 01:08:35,295 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391944a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:08:35, skipping insertion in model container
[2024-03-12 01:08:35,296 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:08:34" (2/3) ...
[2024-03-12 01:08:35,296 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391944a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:08:35, skipping insertion in model container
[2024-03-12 01:08:35,296 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:08:35" (3/3) ...
[2024-03-12 01:08:35,297 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid-join.i
[2024-03-12 01:08:35,303 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 01:08:35,309 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 01:08:35,310 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2024-03-12 01:08:35,310 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 01:08:35,347 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 01:08:35,372 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 111 places, 112 transitions, 231 flow
[2024-03-12 01:08:35,414 INFO  L124   PetriNetUnfolderBase]: 6/158 cut-off events.
[2024-03-12 01:08:35,414 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 01:08:35,418 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 163 conditions, 158 events. 6/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 256 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. 
[2024-03-12 01:08:35,418 INFO  L82        GeneralOperation]: Start removeDead. Operand has 111 places, 112 transitions, 231 flow
[2024-03-12 01:08:35,422 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 111 places, 112 transitions, 231 flow
[2024-03-12 01:08:35,430 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:08:35,435 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=LoopHeads, 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;@7a0e39ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:08:35,435 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-12 01:08:35,444 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:08:35,444 INFO  L124   PetriNetUnfolderBase]: 3/50 cut-off events.
[2024-03-12 01:08:35,444 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:08:35,444 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:35,444 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:35,445 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:08:35,449 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:35,449 INFO  L85        PathProgramCache]: Analyzing trace with hash 1678757547, now seen corresponding path program 1 times
[2024-03-12 01:08:35,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:35,456 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966015142]
[2024-03-12 01:08:35,456 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:35,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:35,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:35,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:35,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:35,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966015142]
[2024-03-12 01:08:35,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966015142] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:35,630 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:35,630 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:08:35,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889291262]
[2024-03-12 01:08:35,632 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:35,637 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:35,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:35,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:35,660 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:35,673 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 112
[2024-03-12 01:08:35,676 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 112 transitions, 231 flow. Second operand  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:35,676 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:35,676 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 112
[2024-03-12 01:08:35,677 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:35,722 INFO  L124   PetriNetUnfolderBase]: 8/196 cut-off events.
[2024-03-12 01:08:35,723 INFO  L125   PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES.
[2024-03-12 01:08:35,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 230 conditions, 196 events. 8/196 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 486 event pairs, 1 based on Foata normal form. 9/185 useless extension candidates. Maximal degree in co-relation 133. Up to 16 conditions per place. 
[2024-03-12 01:08:35,724 INFO  L140   encePairwiseOnDemand]: 105/112 looper letters, 8 selfloop transitions, 3 changer transitions 2/113 dead transitions.
[2024-03-12 01:08:35,724 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 113 transitions, 257 flow
[2024-03-12 01:08:35,726 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:35,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:35,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions.
[2024-03-12 01:08:35,734 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9494047619047619
[2024-03-12 01:08:35,735 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 319 transitions.
[2024-03-12 01:08:35,735 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions.
[2024-03-12 01:08:35,736 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:35,738 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions.
[2024-03-12 01:08:35,740 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:35,744 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:35,744 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:35,746 INFO  L175             Difference]: Start difference. First operand has 111 places, 112 transitions, 231 flow. Second operand 3 states and 319 transitions.
[2024-03-12 01:08:35,746 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 113 transitions, 257 flow
[2024-03-12 01:08:35,749 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 113 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:08:35,751 INFO  L231             Difference]: Finished difference. Result has 115 places, 110 transitions, 245 flow
[2024-03-12 01:08:35,753 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=115, PETRI_TRANSITIONS=110}
[2024-03-12 01:08:35,755 INFO  L281   CegarLoopForPetriNet]: 111 programPoint places, 4 predicate places.
[2024-03-12 01:08:35,756 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 245 flow
[2024-03-12 01:08:35,756 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:35,756 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:35,756 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:35,756 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 01:08:35,757 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:08:35,757 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:35,757 INFO  L85        PathProgramCache]: Analyzing trace with hash -486785488, now seen corresponding path program 1 times
[2024-03-12 01:08:35,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:35,757 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791831899]
[2024-03-12 01:08:35,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:35,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:35,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:35,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:35,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:35,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791831899]
[2024-03-12 01:08:35,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791831899] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:35,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:35,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:35,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758148265]
[2024-03-12 01:08:35,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:35,905 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:08:35,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:35,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:08:35,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:08:36,063 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 112
[2024-03-12 01:08:36,064 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 245 flow. Second operand  has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 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)
[2024-03-12 01:08:36,064 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:36,064 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 112
[2024-03-12 01:08:36,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:36,121 INFO  L124   PetriNetUnfolderBase]: 17/278 cut-off events.
[2024-03-12 01:08:36,122 INFO  L125   PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES.
[2024-03-12 01:08:36,123 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 368 conditions, 278 events. 17/278 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 952 event pairs, 7 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 266. Up to 49 conditions per place. 
[2024-03-12 01:08:36,123 INFO  L140   encePairwiseOnDemand]: 104/112 looper letters, 15 selfloop transitions, 2 changer transitions 5/117 dead transitions.
[2024-03-12 01:08:36,124 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 303 flow
[2024-03-12 01:08:36,124 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:36,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:36,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions.
[2024-03-12 01:08:36,127 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8735119047619048
[2024-03-12 01:08:36,127 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 587 transitions.
[2024-03-12 01:08:36,127 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 587 transitions.
[2024-03-12 01:08:36,128 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:36,128 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 587 transitions.
[2024-03-12 01:08:36,130 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,132 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,132 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,133 INFO  L175             Difference]: Start difference. First operand has 115 places, 110 transitions, 245 flow. Second operand 6 states and 587 transitions.
[2024-03-12 01:08:36,133 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 303 flow
[2024-03-12 01:08:36,134 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:08:36,136 INFO  L231             Difference]: Finished difference. Result has 121 places, 110 transitions, 257 flow
[2024-03-12 01:08:36,136 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=121, PETRI_TRANSITIONS=110}
[2024-03-12 01:08:36,137 INFO  L281   CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places.
[2024-03-12 01:08:36,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 110 transitions, 257 flow
[2024-03-12 01:08:36,137 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 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)
[2024-03-12 01:08:36,137 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:36,138 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:36,138 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 01:08:36,138 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:08:36,138 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:36,139 INFO  L85        PathProgramCache]: Analyzing trace with hash -1518449972, now seen corresponding path program 1 times
[2024-03-12 01:08:36,139 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:36,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257312526]
[2024-03-12 01:08:36,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:36,139 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:36,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:36,424 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:36,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:36,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257312526]
[2024-03-12 01:08:36,425 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257312526] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:36,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:36,425 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:36,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335382545]
[2024-03-12 01:08:36,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:36,426 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:08:36,426 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:36,426 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:08:36,426 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:08:36,582 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 112
[2024-03-12 01:08:36,583 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 110 transitions, 257 flow. Second operand  has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,583 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:36,584 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 112
[2024-03-12 01:08:36,584 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:36,683 INFO  L124   PetriNetUnfolderBase]: 38/336 cut-off events.
[2024-03-12 01:08:36,683 INFO  L125   PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES.
[2024-03-12 01:08:36,684 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 509 conditions, 336 events. 38/336 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1438 event pairs, 27 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 411. Up to 93 conditions per place. 
[2024-03-12 01:08:36,686 INFO  L140   encePairwiseOnDemand]: 106/112 looper letters, 32 selfloop transitions, 5 changer transitions 0/117 dead transitions.
[2024-03-12 01:08:36,686 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 117 transitions, 345 flow
[2024-03-12 01:08:36,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:36,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:36,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 512 transitions.
[2024-03-12 01:08:36,688 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7619047619047619
[2024-03-12 01:08:36,688 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 512 transitions.
[2024-03-12 01:08:36,688 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 512 transitions.
[2024-03-12 01:08:36,688 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:36,688 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 512 transitions.
[2024-03-12 01:08:36,690 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,691 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,691 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,692 INFO  L175             Difference]: Start difference. First operand has 121 places, 110 transitions, 257 flow. Second operand 6 states and 512 transitions.
[2024-03-12 01:08:36,692 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 117 transitions, 345 flow
[2024-03-12 01:08:36,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 331 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-03-12 01:08:36,695 INFO  L231             Difference]: Finished difference. Result has 117 places, 109 transitions, 251 flow
[2024-03-12 01:08:36,695 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=117, PETRI_TRANSITIONS=109}
[2024-03-12 01:08:36,696 INFO  L281   CegarLoopForPetriNet]: 111 programPoint places, 6 predicate places.
[2024-03-12 01:08:36,696 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 251 flow
[2024-03-12 01:08:36,696 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,697 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:36,697 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:36,697 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 01:08:36,697 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:08:36,698 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:36,698 INFO  L85        PathProgramCache]: Analyzing trace with hash -1524640108, now seen corresponding path program 1 times
[2024-03-12 01:08:36,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:36,698 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690741270]
[2024-03-12 01:08:36,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:36,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:36,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:36,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:36,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:36,740 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690741270]
[2024-03-12 01:08:36,740 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690741270] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:36,741 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:36,741 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:08:36,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818108035]
[2024-03-12 01:08:36,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:36,742 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:36,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:36,743 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:36,743 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:36,753 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 112
[2024-03-12 01:08:36,753 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 251 flow. Second operand  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,753 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:36,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 112
[2024-03-12 01:08:36,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:36,787 INFO  L124   PetriNetUnfolderBase]: 5/204 cut-off events.
[2024-03-12 01:08:36,787 INFO  L125   PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES.
[2024-03-12 01:08:36,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 275 conditions, 204 events. 5/204 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 559 event pairs, 3 based on Foata normal form. 1/191 useless extension candidates. Maximal degree in co-relation 211. Up to 25 conditions per place. 
[2024-03-12 01:08:36,788 INFO  L140   encePairwiseOnDemand]: 107/112 looper letters, 8 selfloop transitions, 4 changer transitions 3/112 dead transitions.
[2024-03-12 01:08:36,789 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 287 flow
[2024-03-12 01:08:36,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:36,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:36,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions.
[2024-03-12 01:08:36,790 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9255952380952381
[2024-03-12 01:08:36,790 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 311 transitions.
[2024-03-12 01:08:36,790 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions.
[2024-03-12 01:08:36,791 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:36,791 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions.
[2024-03-12 01:08:36,791 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,792 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,793 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,793 INFO  L175             Difference]: Start difference. First operand has 117 places, 109 transitions, 251 flow. Second operand 3 states and 311 transitions.
[2024-03-12 01:08:36,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 287 flow
[2024-03-12 01:08:36,794 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 277 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:08:36,796 INFO  L231             Difference]: Finished difference. Result has 116 places, 109 transitions, 263 flow
[2024-03-12 01:08:36,796 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=116, PETRI_TRANSITIONS=109}
[2024-03-12 01:08:36,797 INFO  L281   CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places.
[2024-03-12 01:08:36,797 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 109 transitions, 263 flow
[2024-03-12 01:08:36,797 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:36,798 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:36,798 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:36,798 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 01:08:36,798 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:08:36,799 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:36,799 INFO  L85        PathProgramCache]: Analyzing trace with hash 1709824943, now seen corresponding path program 1 times
[2024-03-12 01:08:36,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:36,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891382406]
[2024-03-12 01:08:36,800 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:36,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:36,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:37,069 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:08:37,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:37,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891382406]
[2024-03-12 01:08:37,069 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891382406] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:37,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:37,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:37,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537079825]
[2024-03-12 01:08:37,070 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:37,070 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:08:37,071 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:37,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:08:37,071 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:08:37,271 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 112
[2024-03-12 01:08:37,272 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 109 transitions, 263 flow. Second operand  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,272 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:37,272 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 112
[2024-03-12 01:08:37,272 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:37,350 INFO  L124   PetriNetUnfolderBase]: 25/328 cut-off events.
[2024-03-12 01:08:37,351 INFO  L125   PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES.
[2024-03-12 01:08:37,352 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 509 conditions, 328 events. 25/328 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1388 event pairs, 15 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 395. Up to 55 conditions per place. 
[2024-03-12 01:08:37,353 INFO  L140   encePairwiseOnDemand]: 105/112 looper letters, 27 selfloop transitions, 5 changer transitions 0/115 dead transitions.
[2024-03-12 01:08:37,353 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 339 flow
[2024-03-12 01:08:37,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:37,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:37,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions.
[2024-03-12 01:08:37,358 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7916666666666666
[2024-03-12 01:08:37,358 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 532 transitions.
[2024-03-12 01:08:37,358 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 532 transitions.
[2024-03-12 01:08:37,359 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:37,359 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 532 transitions.
[2024-03-12 01:08:37,361 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,363 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,363 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,363 INFO  L175             Difference]: Start difference. First operand has 116 places, 109 transitions, 263 flow. Second operand 6 states and 532 transitions.
[2024-03-12 01:08:37,364 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 339 flow
[2024-03-12 01:08:37,366 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 115 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:08:37,368 INFO  L231             Difference]: Finished difference. Result has 117 places, 107 transitions, 261 flow
[2024-03-12 01:08:37,368 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=117, PETRI_TRANSITIONS=107}
[2024-03-12 01:08:37,369 INFO  L281   CegarLoopForPetriNet]: 111 programPoint places, 6 predicate places.
[2024-03-12 01:08:37,370 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 261 flow
[2024-03-12 01:08:37,370 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,370 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:37,371 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:37,371 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 01:08:37,371 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:08:37,372 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:37,372 INFO  L85        PathProgramCache]: Analyzing trace with hash 330308076, now seen corresponding path program 1 times
[2024-03-12 01:08:37,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:37,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808710848]
[2024-03-12 01:08:37,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:37,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:37,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:08:37,395 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:08:37,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:08:37,426 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:08:37,426 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:08:37,427 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2024-03-12 01:08:37,429 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-03-12 01:08:37,429 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-03-12 01:08:37,429 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2024-03-12 01:08:37,429 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-03-12 01:08:37,430 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-03-12 01:08:37,430 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-03-12 01:08:37,430 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-03-12 01:08:37,430 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 01:08:37,430 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:37,432 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:08:37,433 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 01:08:37,447 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 01:08:37,449 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 130 places, 130 transitions, 276 flow
[2024-03-12 01:08:37,470 INFO  L124   PetriNetUnfolderBase]: 11/283 cut-off events.
[2024-03-12 01:08:37,471 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-12 01:08:37,471 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 295 conditions, 283 events. 11/283 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 570 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. 
[2024-03-12 01:08:37,472 INFO  L82        GeneralOperation]: Start removeDead. Operand has 130 places, 130 transitions, 276 flow
[2024-03-12 01:08:37,473 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 130 places, 130 transitions, 276 flow
[2024-03-12 01:08:37,474 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:08:37,475 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=LoopHeads, 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;@7a0e39ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:08:37,475 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-12 01:08:37,478 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:08:37,478 INFO  L124   PetriNetUnfolderBase]: 3/50 cut-off events.
[2024-03-12 01:08:37,478 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:08:37,478 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:37,478 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:37,478 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:08:37,479 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:37,479 INFO  L85        PathProgramCache]: Analyzing trace with hash 1997562603, now seen corresponding path program 1 times
[2024-03-12 01:08:37,479 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:37,479 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328560357]
[2024-03-12 01:08:37,479 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:37,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:37,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:37,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:37,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:37,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328560357]
[2024-03-12 01:08:37,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328560357] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:37,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:37,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:08:37,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401587421]
[2024-03-12 01:08:37,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:37,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:37,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:37,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:37,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:37,506 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 130
[2024-03-12 01:08:37,507 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 276 flow. Second operand  has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,507 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:37,507 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 130
[2024-03-12 01:08:37,507 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:37,610 INFO  L124   PetriNetUnfolderBase]: 119/853 cut-off events.
[2024-03-12 01:08:37,611 INFO  L125   PetriNetUnfolderBase]: For 60/103 co-relation queries the response was YES.
[2024-03-12 01:08:37,613 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 853 events. 119/853 cut-off events. For 60/103 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4780 event pairs, 50 based on Foata normal form. 39/792 useless extension candidates. Maximal degree in co-relation 828. Up to 139 conditions per place. 
[2024-03-12 01:08:37,615 INFO  L140   encePairwiseOnDemand]: 122/130 looper letters, 16 selfloop transitions, 4 changer transitions 1/134 dead transitions.
[2024-03-12 01:08:37,615 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 134 transitions, 324 flow
[2024-03-12 01:08:37,616 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:37,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:37,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions.
[2024-03-12 01:08:37,617 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9384615384615385
[2024-03-12 01:08:37,617 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 366 transitions.
[2024-03-12 01:08:37,618 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions.
[2024-03-12 01:08:37,618 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:37,618 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions.
[2024-03-12 01:08:37,619 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,619 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,620 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,620 INFO  L175             Difference]: Start difference. First operand has 130 places, 130 transitions, 276 flow. Second operand 3 states and 366 transitions.
[2024-03-12 01:08:37,620 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 134 transitions, 324 flow
[2024-03-12 01:08:37,621 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 134 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:08:37,622 INFO  L231             Difference]: Finished difference. Result has 134 places, 129 transitions, 298 flow
[2024-03-12 01:08:37,622 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=134, PETRI_TRANSITIONS=129}
[2024-03-12 01:08:37,623 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 4 predicate places.
[2024-03-12 01:08:37,623 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 298 flow
[2024-03-12 01:08:37,624 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,624 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:37,624 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:37,624 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-12 01:08:37,624 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:08:37,625 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:37,625 INFO  L85        PathProgramCache]: Analyzing trace with hash 942199472, now seen corresponding path program 1 times
[2024-03-12 01:08:37,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:37,625 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141282569]
[2024-03-12 01:08:37,625 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:37,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:37,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:37,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:37,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:37,672 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141282569]
[2024-03-12 01:08:37,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141282569] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:37,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:37,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:37,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465156036]
[2024-03-12 01:08:37,673 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:37,673 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:08:37,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:37,674 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:08:37,674 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:08:37,772 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 130
[2024-03-12 01:08:37,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 298 flow. Second operand  has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,773 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:37,774 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 130
[2024-03-12 01:08:37,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:37,934 INFO  L124   PetriNetUnfolderBase]: 189/1333 cut-off events.
[2024-03-12 01:08:37,934 INFO  L125   PetriNetUnfolderBase]: For 71/72 co-relation queries the response was YES.
[2024-03-12 01:08:37,937 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 1333 events. 189/1333 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9364 event pairs, 131 based on Foata normal form. 1/1218 useless extension candidates. Maximal degree in co-relation 1232. Up to 314 conditions per place. 
[2024-03-12 01:08:37,940 INFO  L140   encePairwiseOnDemand]: 122/130 looper letters, 20 selfloop transitions, 2 changer transitions 5/137 dead transitions.
[2024-03-12 01:08:37,940 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 137 transitions, 368 flow
[2024-03-12 01:08:37,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:37,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:37,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 676 transitions.
[2024-03-12 01:08:37,942 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8666666666666667
[2024-03-12 01:08:37,942 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 676 transitions.
[2024-03-12 01:08:37,943 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 676 transitions.
[2024-03-12 01:08:37,943 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:37,943 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 676 transitions.
[2024-03-12 01:08:37,945 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,946 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,946 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,946 INFO  L175             Difference]: Start difference. First operand has 134 places, 129 transitions, 298 flow. Second operand 6 states and 676 transitions.
[2024-03-12 01:08:37,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 137 transitions, 368 flow
[2024-03-12 01:08:37,948 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 137 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:08:37,949 INFO  L231             Difference]: Finished difference. Result has 140 places, 130 transitions, 312 flow
[2024-03-12 01:08:37,950 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=140, PETRI_TRANSITIONS=130}
[2024-03-12 01:08:37,950 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 10 predicate places.
[2024-03-12 01:08:37,950 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 130 transitions, 312 flow
[2024-03-12 01:08:37,951 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:37,951 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:37,951 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:37,951 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 01:08:37,951 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:08:37,952 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:37,952 INFO  L85        PathProgramCache]: Analyzing trace with hash -169589042, now seen corresponding path program 1 times
[2024-03-12 01:08:37,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:37,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988095045]
[2024-03-12 01:08:37,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:37,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:37,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:38,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:38,140 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:38,140 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988095045]
[2024-03-12 01:08:38,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988095045] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:38,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:38,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:38,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637278184]
[2024-03-12 01:08:38,141 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:38,141 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:08:38,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:38,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:08:38,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:08:38,253 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 130
[2024-03-12 01:08:38,254 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 130 transitions, 312 flow. Second operand  has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:38,254 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:38,254 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 130
[2024-03-12 01:08:38,254 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:38,484 INFO  L124   PetriNetUnfolderBase]: 384/2007 cut-off events.
[2024-03-12 01:08:38,485 INFO  L125   PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES.
[2024-03-12 01:08:38,488 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2972 conditions, 2007 events. 384/2007 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 16062 event pairs, 278 based on Foata normal form. 0/1782 useless extension candidates. Maximal degree in co-relation 2873. Up to 545 conditions per place. 
[2024-03-12 01:08:38,494 INFO  L140   encePairwiseOnDemand]: 124/130 looper letters, 45 selfloop transitions, 5 changer transitions 0/145 dead transitions.
[2024-03-12 01:08:38,494 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 145 transitions, 442 flow
[2024-03-12 01:08:38,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:38,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:38,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 608 transitions.
[2024-03-12 01:08:38,496 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7794871794871795
[2024-03-12 01:08:38,497 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 608 transitions.
[2024-03-12 01:08:38,497 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 608 transitions.
[2024-03-12 01:08:38,497 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:38,497 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 608 transitions.
[2024-03-12 01:08:38,498 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:38,499 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:38,500 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:38,500 INFO  L175             Difference]: Start difference. First operand has 140 places, 130 transitions, 312 flow. Second operand 6 states and 608 transitions.
[2024-03-12 01:08:38,500 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 145 transitions, 442 flow
[2024-03-12 01:08:38,501 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 145 transitions, 430 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 01:08:38,503 INFO  L231             Difference]: Finished difference. Result has 137 places, 129 transitions, 308 flow
[2024-03-12 01:08:38,503 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=137, PETRI_TRANSITIONS=129}
[2024-03-12 01:08:38,503 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 7 predicate places.
[2024-03-12 01:08:38,504 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 129 transitions, 308 flow
[2024-03-12 01:08:38,504 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:38,504 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:38,504 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:38,504 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-12 01:08:38,505 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:08:38,505 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:38,505 INFO  L85        PathProgramCache]: Analyzing trace with hash 95869638, now seen corresponding path program 1 times
[2024-03-12 01:08:38,505 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:38,505 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730554185]
[2024-03-12 01:08:38,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:38,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:38,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:38,536 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:38,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:38,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730554185]
[2024-03-12 01:08:38,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730554185] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:38,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:38,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:08:38,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187863535]
[2024-03-12 01:08:38,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:38,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:38,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:38,539 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:38,539 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:38,554 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130
[2024-03-12 01:08:38,555 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 129 transitions, 308 flow. Second operand  has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:38,555 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:38,555 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130
[2024-03-12 01:08:38,556 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:38,663 INFO  L124   PetriNetUnfolderBase]: 172/1259 cut-off events.
[2024-03-12 01:08:38,664 INFO  L125   PetriNetUnfolderBase]: For 198/359 co-relation queries the response was YES.
[2024-03-12 01:08:38,665 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1259 events. 172/1259 cut-off events. For 198/359 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8821 event pairs, 75 based on Foata normal form. 4/1103 useless extension candidates. Maximal degree in co-relation 1561. Up to 270 conditions per place. 
[2024-03-12 01:08:38,669 INFO  L140   encePairwiseOnDemand]: 124/130 looper letters, 19 selfloop transitions, 7 changer transitions 0/138 dead transitions.
[2024-03-12 01:08:38,669 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 138 transitions, 392 flow
[2024-03-12 01:08:38,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:38,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:38,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions.
[2024-03-12 01:08:38,671 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9230769230769231
[2024-03-12 01:08:38,671 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 360 transitions.
[2024-03-12 01:08:38,671 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions.
[2024-03-12 01:08:38,671 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:38,671 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions.
[2024-03-12 01:08:38,672 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:38,673 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:38,673 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:38,673 INFO  L175             Difference]: Start difference. First operand has 137 places, 129 transitions, 308 flow. Second operand 3 states and 360 transitions.
[2024-03-12 01:08:38,673 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 138 transitions, 392 flow
[2024-03-12 01:08:38,674 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 138 transitions, 382 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:08:38,675 INFO  L231             Difference]: Finished difference. Result has 136 places, 134 transitions, 354 flow
[2024-03-12 01:08:38,676 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=136, PETRI_TRANSITIONS=134}
[2024-03-12 01:08:38,676 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places.
[2024-03-12 01:08:38,676 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 354 flow
[2024-03-12 01:08:38,676 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:38,677 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:38,677 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:38,677 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 01:08:38,677 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:08:38,677 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:38,677 INFO  L85        PathProgramCache]: Analyzing trace with hash -1939836127, now seen corresponding path program 1 times
[2024-03-12 01:08:38,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:38,678 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426806129]
[2024-03-12 01:08:38,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:38,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:38,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:38,883 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:08:38,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:38,883 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426806129]
[2024-03-12 01:08:38,883 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426806129] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:38,883 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:38,883 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:38,884 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743168901]
[2024-03-12 01:08:38,884 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:38,884 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:08:38,884 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:38,885 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:08:38,885 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:08:39,030 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130
[2024-03-12 01:08:39,031 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 354 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:39,031 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:39,031 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130
[2024-03-12 01:08:39,031 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:39,272 INFO  L124   PetriNetUnfolderBase]: 383/2112 cut-off events.
[2024-03-12 01:08:39,272 INFO  L125   PetriNetUnfolderBase]: For 322/359 co-relation queries the response was YES.
[2024-03-12 01:08:39,276 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 2112 events. 383/2112 cut-off events. For 322/359 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 17575 event pairs, 180 based on Foata normal form. 3/1933 useless extension candidates. Maximal degree in co-relation 2625. Up to 362 conditions per place. 
[2024-03-12 01:08:39,280 INFO  L140   encePairwiseOnDemand]: 123/130 looper letters, 39 selfloop transitions, 5 changer transitions 0/148 dead transitions.
[2024-03-12 01:08:39,280 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 148 transitions, 470 flow
[2024-03-12 01:08:39,281 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:39,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:39,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions.
[2024-03-12 01:08:39,283 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8051282051282052
[2024-03-12 01:08:39,283 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 628 transitions.
[2024-03-12 01:08:39,283 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 628 transitions.
[2024-03-12 01:08:39,284 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:39,284 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 628 transitions.
[2024-03-12 01:08:39,285 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:39,286 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:39,286 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:39,287 INFO  L175             Difference]: Start difference. First operand has 136 places, 134 transitions, 354 flow. Second operand 6 states and 628 transitions.
[2024-03-12 01:08:39,287 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 148 transitions, 470 flow
[2024-03-12 01:08:39,289 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 148 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:08:39,290 INFO  L231             Difference]: Finished difference. Result has 137 places, 132 transitions, 346 flow
[2024-03-12 01:08:39,290 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=137, PETRI_TRANSITIONS=132}
[2024-03-12 01:08:39,291 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 7 predicate places.
[2024-03-12 01:08:39,291 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 346 flow
[2024-03-12 01:08:39,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:39,292 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:39,292 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:39,292 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-12 01:08:39,292 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:08:39,292 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:39,293 INFO  L85        PathProgramCache]: Analyzing trace with hash 773970806, now seen corresponding path program 1 times
[2024-03-12 01:08:39,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:39,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942798000]
[2024-03-12 01:08:39,293 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:39,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:39,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:39,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:39,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:39,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942798000]
[2024-03-12 01:08:39,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942798000] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:08:39,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6892045]
[2024-03-12 01:08:39,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:39,366 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:08:39,366 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:08:39,367 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:08:39,370 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-12 01:08:39,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:39,493 INFO  L262         TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-12 01:08:39,495 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:08:39,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:39,577 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:08:39,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:39,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [6892045] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:08:39,622 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:08:39,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-12 01:08:39,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146174068]
[2024-03-12 01:08:39,623 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:08:39,623 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-12 01:08:39,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:39,624 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-12 01:08:39,624 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-12 01:08:39,790 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 130
[2024-03-12 01:08:39,791 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 346 flow. Second operand  has 9 states, 9 states have (on average 108.22222222222223) internal successors, (974), 9 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:39,791 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:39,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 130
[2024-03-12 01:08:39,791 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:39,963 INFO  L124   PetriNetUnfolderBase]: 159/1312 cut-off events.
[2024-03-12 01:08:39,963 INFO  L125   PetriNetUnfolderBase]: For 133/156 co-relation queries the response was YES.
[2024-03-12 01:08:39,965 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 1312 events. 159/1312 cut-off events. For 133/156 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 8853 event pairs, 50 based on Foata normal form. 0/1218 useless extension candidates. Maximal degree in co-relation 983. Up to 159 conditions per place. 
[2024-03-12 01:08:39,967 INFO  L140   encePairwiseOnDemand]: 120/130 looper letters, 32 selfloop transitions, 10 changer transitions 3/154 dead transitions.
[2024-03-12 01:08:39,968 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 154 transitions, 484 flow
[2024-03-12 01:08:39,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-12 01:08:39,968 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-12 01:08:39,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 894 transitions.
[2024-03-12 01:08:39,970 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8596153846153847
[2024-03-12 01:08:39,970 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 894 transitions.
[2024-03-12 01:08:39,970 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 894 transitions.
[2024-03-12 01:08:39,970 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:39,971 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 894 transitions.
[2024-03-12 01:08:39,972 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 111.75) internal successors, (894), 8 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)
[2024-03-12 01:08:39,973 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 130.0) internal successors, (1170), 9 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:39,974 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 130.0) internal successors, (1170), 9 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:39,974 INFO  L175             Difference]: Start difference. First operand has 137 places, 132 transitions, 346 flow. Second operand 8 states and 894 transitions.
[2024-03-12 01:08:39,974 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 154 transitions, 484 flow
[2024-03-12 01:08:39,975 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 154 transitions, 472 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:08:39,977 INFO  L231             Difference]: Finished difference. Result has 142 places, 134 transitions, 374 flow
[2024-03-12 01:08:39,977 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=374, PETRI_PLACES=142, PETRI_TRANSITIONS=134}
[2024-03-12 01:08:39,977 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places.
[2024-03-12 01:08:39,978 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 134 transitions, 374 flow
[2024-03-12 01:08:39,978 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 108.22222222222223) internal successors, (974), 9 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:39,978 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:39,978 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:39,984 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-03-12 01:08:40,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:08:40,183 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:08:40,183 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:40,183 INFO  L85        PathProgramCache]: Analyzing trace with hash 1586129916, now seen corresponding path program 1 times
[2024-03-12 01:08:40,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:40,184 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149843057]
[2024-03-12 01:08:40,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:40,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:40,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:40,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:08:40,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:40,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149843057]
[2024-03-12 01:08:40,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149843057] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:40,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:40,407 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:40,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061228113]
[2024-03-12 01:08:40,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:40,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:08:40,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:40,408 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:08:40,408 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:08:40,525 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 130
[2024-03-12 01:08:40,526 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 134 transitions, 374 flow. Second operand  has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,526 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:40,526 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 130
[2024-03-12 01:08:40,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:40,671 INFO  L124   PetriNetUnfolderBase]: 249/1397 cut-off events.
[2024-03-12 01:08:40,671 INFO  L125   PetriNetUnfolderBase]: For 119/142 co-relation queries the response was YES.
[2024-03-12 01:08:40,674 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 1397 events. 249/1397 cut-off events. For 119/142 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 9923 event pairs, 114 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 1598. Up to 236 conditions per place. 
[2024-03-12 01:08:40,677 INFO  L140   encePairwiseOnDemand]: 124/130 looper letters, 32 selfloop transitions, 5 changer transitions 1/149 dead transitions.
[2024-03-12 01:08:40,677 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 149 transitions, 478 flow
[2024-03-12 01:08:40,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:40,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:40,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions.
[2024-03-12 01:08:40,679 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8564102564102564
[2024-03-12 01:08:40,679 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 668 transitions.
[2024-03-12 01:08:40,679 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions.
[2024-03-12 01:08:40,680 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:40,680 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions.
[2024-03-12 01:08:40,681 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,682 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,682 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,683 INFO  L175             Difference]: Start difference. First operand has 142 places, 134 transitions, 374 flow. Second operand 6 states and 668 transitions.
[2024-03-12 01:08:40,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 149 transitions, 478 flow
[2024-03-12 01:08:40,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 149 transitions, 472 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 01:08:40,685 INFO  L231             Difference]: Finished difference. Result has 143 places, 132 transitions, 371 flow
[2024-03-12 01:08:40,686 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=143, PETRI_TRANSITIONS=132}
[2024-03-12 01:08:40,686 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 13 predicate places.
[2024-03-12 01:08:40,686 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 371 flow
[2024-03-12 01:08:40,686 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,686 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:40,687 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:40,687 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-12 01:08:40,687 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:08:40,687 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:40,688 INFO  L85        PathProgramCache]: Analyzing trace with hash -1175743644, now seen corresponding path program 1 times
[2024-03-12 01:08:40,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:40,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694880673]
[2024-03-12 01:08:40,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:40,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:40,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:40,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-12 01:08:40,729 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:40,729 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694880673]
[2024-03-12 01:08:40,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694880673] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:40,729 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:40,729 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:08:40,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298087792]
[2024-03-12 01:08:40,730 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:40,730 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:40,730 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:40,731 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:40,731 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:40,741 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130
[2024-03-12 01:08:40,741 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 371 flow. Second operand  has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:40,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130
[2024-03-12 01:08:40,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:40,822 INFO  L124   PetriNetUnfolderBase]: 56/857 cut-off events.
[2024-03-12 01:08:40,823 INFO  L125   PetriNetUnfolderBase]: For 243/428 co-relation queries the response was YES.
[2024-03-12 01:08:40,824 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 857 events. 56/857 cut-off events. For 243/428 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5261 event pairs, 30 based on Foata normal form. 3/835 useless extension candidates. Maximal degree in co-relation 1184. Up to 119 conditions per place. 
[2024-03-12 01:08:40,826 INFO  L140   encePairwiseOnDemand]: 124/130 looper letters, 19 selfloop transitions, 7 changer transitions 1/139 dead transitions.
[2024-03-12 01:08:40,826 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 139 transitions, 448 flow
[2024-03-12 01:08:40,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:40,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:40,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions.
[2024-03-12 01:08:40,828 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9205128205128205
[2024-03-12 01:08:40,828 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 359 transitions.
[2024-03-12 01:08:40,828 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions.
[2024-03-12 01:08:40,829 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:40,829 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions.
[2024-03-12 01:08:40,830 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,830 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,831 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,831 INFO  L175             Difference]: Start difference. First operand has 143 places, 132 transitions, 371 flow. Second operand 3 states and 359 transitions.
[2024-03-12 01:08:40,831 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 139 transitions, 448 flow
[2024-03-12 01:08:40,832 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 139 transitions, 438 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:08:40,833 INFO  L231             Difference]: Finished difference. Result has 142 places, 135 transitions, 411 flow
[2024-03-12 01:08:40,834 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=142, PETRI_TRANSITIONS=135}
[2024-03-12 01:08:40,834 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places.
[2024-03-12 01:08:40,834 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 135 transitions, 411 flow
[2024-03-12 01:08:40,835 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,835 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:40,835 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:40,835 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-12 01:08:40,835 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:08:40,836 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:40,836 INFO  L85        PathProgramCache]: Analyzing trace with hash -453610322, now seen corresponding path program 1 times
[2024-03-12 01:08:40,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:40,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676755596]
[2024-03-12 01:08:40,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:40,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:40,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:40,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-12 01:08:40,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:40,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676755596]
[2024-03-12 01:08:40,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676755596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:40,904 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:40,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 01:08:40,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737920291]
[2024-03-12 01:08:40,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:40,905 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:40,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:40,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:40,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:40,913 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 130
[2024-03-12 01:08:40,914 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 135 transitions, 411 flow. Second operand  has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,914 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:40,914 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 130
[2024-03-12 01:08:40,914 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:40,970 INFO  L124   PetriNetUnfolderBase]: 12/507 cut-off events.
[2024-03-12 01:08:40,970 INFO  L125   PetriNetUnfolderBase]: For 125/146 co-relation queries the response was YES.
[2024-03-12 01:08:40,971 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 744 conditions, 507 events. 12/507 cut-off events. For 125/146 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2220 event pairs, 2 based on Foata normal form. 4/505 useless extension candidates. Maximal degree in co-relation 570. Up to 26 conditions per place. 
[2024-03-12 01:08:40,972 INFO  L140   encePairwiseOnDemand]: 126/130 looper letters, 8 selfloop transitions, 4 changer transitions 4/136 dead transitions.
[2024-03-12 01:08:40,972 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 432 flow
[2024-03-12 01:08:40,973 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:40,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:40,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions.
[2024-03-12 01:08:40,974 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9435897435897436
[2024-03-12 01:08:40,974 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 368 transitions.
[2024-03-12 01:08:40,974 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions.
[2024-03-12 01:08:40,974 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:40,974 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions.
[2024-03-12 01:08:40,975 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,976 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,976 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,976 INFO  L175             Difference]: Start difference. First operand has 142 places, 135 transitions, 411 flow. Second operand 3 states and 368 transitions.
[2024-03-12 01:08:40,976 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 136 transitions, 432 flow
[2024-03-12 01:08:40,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 136 transitions, 420 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-03-12 01:08:40,979 INFO  L231             Difference]: Finished difference. Result has 142 places, 129 transitions, 371 flow
[2024-03-12 01:08:40,979 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=142, PETRI_TRANSITIONS=129}
[2024-03-12 01:08:40,979 INFO  L281   CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places.
[2024-03-12 01:08:40,979 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 129 transitions, 371 flow
[2024-03-12 01:08:40,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:40,980 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:40,980 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:40,980 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-12 01:08:40,980 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 01:08:40,981 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:40,981 INFO  L85        PathProgramCache]: Analyzing trace with hash -2094452676, now seen corresponding path program 1 times
[2024-03-12 01:08:40,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:40,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134562084]
[2024-03-12 01:08:40,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:40,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:41,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:08:41,009 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:08:41,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:08:41,030 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:08:41,030 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:08:41,030 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-12 01:08:41,030 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-12 01:08:41,031 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-12 01:08:41,031 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-12 01:08:41,031 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-12 01:08:41,031 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-12 01:08:41,031 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-12 01:08:41,031 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-12 01:08:41,031 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-12 01:08:41,032 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-12 01:08:41,032 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:41,032 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:08:41,032 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-12 01:08:41,048 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-12 01:08:41,050 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 149 places, 148 transitions, 323 flow
[2024-03-12 01:08:41,083 INFO  L124   PetriNetUnfolderBase]: 21/493 cut-off events.
[2024-03-12 01:08:41,083 INFO  L125   PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES.
[2024-03-12 01:08:41,084 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 518 conditions, 493 events. 21/493 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1332 event pairs, 1 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 291. Up to 16 conditions per place. 
[2024-03-12 01:08:41,084 INFO  L82        GeneralOperation]: Start removeDead. Operand has 149 places, 148 transitions, 323 flow
[2024-03-12 01:08:41,086 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 149 places, 148 transitions, 323 flow
[2024-03-12 01:08:41,086 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:08:41,087 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=LoopHeads, 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;@7a0e39ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:08:41,087 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-12 01:08:41,089 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:08:41,089 INFO  L124   PetriNetUnfolderBase]: 3/50 cut-off events.
[2024-03-12 01:08:41,089 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:08:41,089 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:41,089 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:41,089 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:08:41,090 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:41,090 INFO  L85        PathProgramCache]: Analyzing trace with hash 774675819, now seen corresponding path program 1 times
[2024-03-12 01:08:41,090 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:41,090 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218614976]
[2024-03-12 01:08:41,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:41,090 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:41,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:41,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:41,103 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:41,103 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218614976]
[2024-03-12 01:08:41,103 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218614976] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:41,103 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:41,103 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:08:41,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108056241]
[2024-03-12 01:08:41,104 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:41,104 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:41,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:41,104 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:41,104 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:41,114 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 127 out of 148
[2024-03-12 01:08:41,115 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 323 flow. Second operand  has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:41,115 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:41,115 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 148
[2024-03-12 01:08:41,115 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:41,550 INFO  L124   PetriNetUnfolderBase]: 1071/4713 cut-off events.
[2024-03-12 01:08:41,551 INFO  L125   PetriNetUnfolderBase]: For 456/804 co-relation queries the response was YES.
[2024-03-12 01:08:41,561 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6628 conditions, 4713 events. 1071/4713 cut-off events. For 456/804 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 42263 event pairs, 542 based on Foata normal form. 178/4381 useless extension candidates. Maximal degree in co-relation 5211. Up to 1110 conditions per place. 
[2024-03-12 01:08:41,578 INFO  L140   encePairwiseOnDemand]: 139/148 looper letters, 23 selfloop transitions, 5 changer transitions 1/155 dead transitions.
[2024-03-12 01:08:41,578 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 155 transitions, 393 flow
[2024-03-12 01:08:41,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:41,579 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:41,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions.
[2024-03-12 01:08:41,579 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9301801801801802
[2024-03-12 01:08:41,620 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 413 transitions.
[2024-03-12 01:08:41,621 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions.
[2024-03-12 01:08:41,621 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:41,621 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions.
[2024-03-12 01:08:41,622 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:41,623 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:41,623 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:41,623 INFO  L175             Difference]: Start difference. First operand has 149 places, 148 transitions, 323 flow. Second operand 3 states and 413 transitions.
[2024-03-12 01:08:41,623 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 155 transitions, 393 flow
[2024-03-12 01:08:41,624 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 155 transitions, 393 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:08:41,625 INFO  L231             Difference]: Finished difference. Result has 153 places, 148 transitions, 353 flow
[2024-03-12 01:08:41,625 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=153, PETRI_TRANSITIONS=148}
[2024-03-12 01:08:41,626 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 4 predicate places.
[2024-03-12 01:08:41,626 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 148 transitions, 353 flow
[2024-03-12 01:08:41,626 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:41,626 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:41,626 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:41,626 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-12 01:08:41,626 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:08:41,626 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:41,627 INFO  L85        PathProgramCache]: Analyzing trace with hash -1725923408, now seen corresponding path program 1 times
[2024-03-12 01:08:41,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:41,627 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443139766]
[2024-03-12 01:08:41,627 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:41,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:41,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:41,661 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:41,661 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:41,661 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443139766]
[2024-03-12 01:08:41,661 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443139766] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:41,661 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:41,661 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:41,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048853480]
[2024-03-12 01:08:41,661 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:41,661 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:08:41,662 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:41,662 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:08:41,662 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:08:41,708 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 148
[2024-03-12 01:08:41,709 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 148 transitions, 353 flow. Second operand  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:41,709 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:41,709 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 148
[2024-03-12 01:08:41,709 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:42,243 INFO  L124   PetriNetUnfolderBase]: 1326/6647 cut-off events.
[2024-03-12 01:08:42,243 INFO  L125   PetriNetUnfolderBase]: For 408/416 co-relation queries the response was YES.
[2024-03-12 01:08:42,256 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9469 conditions, 6647 events. 1326/6647 cut-off events. For 408/416 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 65551 event pairs, 760 based on Foata normal form. 1/5867 useless extension candidates. Maximal degree in co-relation 5824. Up to 1720 conditions per place. 
[2024-03-12 01:08:42,273 INFO  L140   encePairwiseOnDemand]: 140/148 looper letters, 24 selfloop transitions, 2 changer transitions 5/156 dead transitions.
[2024-03-12 01:08:42,273 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 156 transitions, 431 flow
[2024-03-12 01:08:42,274 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:42,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:42,275 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions.
[2024-03-12 01:08:42,275 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8603603603603603
[2024-03-12 01:08:42,275 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 764 transitions.
[2024-03-12 01:08:42,275 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions.
[2024-03-12 01:08:42,276 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:42,276 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions.
[2024-03-12 01:08:42,277 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:42,278 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:42,279 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:42,279 INFO  L175             Difference]: Start difference. First operand has 153 places, 148 transitions, 353 flow. Second operand 6 states and 764 transitions.
[2024-03-12 01:08:42,279 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 156 transitions, 431 flow
[2024-03-12 01:08:42,283 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 156 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:08:42,284 INFO  L231             Difference]: Finished difference. Result has 159 places, 149 transitions, 365 flow
[2024-03-12 01:08:42,284 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=159, PETRI_TRANSITIONS=149}
[2024-03-12 01:08:42,285 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 10 predicate places.
[2024-03-12 01:08:42,285 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 149 transitions, 365 flow
[2024-03-12 01:08:42,285 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:42,285 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:42,285 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:42,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-12 01:08:42,285 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:08:42,285 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:42,286 INFO  L85        PathProgramCache]: Analyzing trace with hash -1277019550, now seen corresponding path program 1 times
[2024-03-12 01:08:42,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:42,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432772120]
[2024-03-12 01:08:42,286 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:42,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:42,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:42,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:42,420 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:42,420 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432772120]
[2024-03-12 01:08:42,420 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432772120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:42,420 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:42,420 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:42,420 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899690706]
[2024-03-12 01:08:42,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:42,421 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:08:42,421 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:42,421 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:08:42,421 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:08:42,549 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 148
[2024-03-12 01:08:42,550 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 149 transitions, 365 flow. Second operand  has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:42,550 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:42,550 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 148
[2024-03-12 01:08:42,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:43,581 INFO  L124   PetriNetUnfolderBase]: 2795/10801 cut-off events.
[2024-03-12 01:08:43,581 INFO  L125   PetriNetUnfolderBase]: For 513/515 co-relation queries the response was YES.
[2024-03-12 01:08:43,607 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16323 conditions, 10801 events. 2795/10801 cut-off events. For 513/515 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 114610 event pairs, 2100 based on Foata normal form. 0/9424 useless extension candidates. Maximal degree in co-relation 16223. Up to 3268 conditions per place. 
[2024-03-12 01:08:43,638 INFO  L140   encePairwiseOnDemand]: 142/148 looper letters, 57 selfloop transitions, 5 changer transitions 0/172 dead transitions.
[2024-03-12 01:08:43,638 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 172 transitions, 535 flow
[2024-03-12 01:08:43,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:43,639 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:43,640 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions.
[2024-03-12 01:08:43,640 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7927927927927928
[2024-03-12 01:08:43,640 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 704 transitions.
[2024-03-12 01:08:43,640 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 704 transitions.
[2024-03-12 01:08:43,641 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:43,641 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 704 transitions.
[2024-03-12 01:08:43,642 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:43,643 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:43,643 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:43,644 INFO  L175             Difference]: Start difference. First operand has 159 places, 149 transitions, 365 flow. Second operand 6 states and 704 transitions.
[2024-03-12 01:08:43,644 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 172 transitions, 535 flow
[2024-03-12 01:08:43,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 172 transitions, 523 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 01:08:43,649 INFO  L231             Difference]: Finished difference. Result has 156 places, 148 transitions, 361 flow
[2024-03-12 01:08:43,649 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=361, PETRI_PLACES=156, PETRI_TRANSITIONS=148}
[2024-03-12 01:08:43,650 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 7 predicate places.
[2024-03-12 01:08:43,650 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 148 transitions, 361 flow
[2024-03-12 01:08:43,650 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:43,650 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:43,650 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:43,650 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-12 01:08:43,651 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:08:43,651 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:43,651 INFO  L85        PathProgramCache]: Analyzing trace with hash 1968266986, now seen corresponding path program 1 times
[2024-03-12 01:08:43,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:43,651 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453668458]
[2024-03-12 01:08:43,652 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:43,652 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:43,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:43,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:43,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:43,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453668458]
[2024-03-12 01:08:43,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453668458] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:43,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:43,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:08:43,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21273665]
[2024-03-12 01:08:43,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:43,676 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:43,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:43,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:43,677 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:43,689 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 148
[2024-03-12 01:08:43,690 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 148 transitions, 361 flow. Second operand  has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:43,690 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:43,690 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 148
[2024-03-12 01:08:43,690 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:44,359 INFO  L124   PetriNetUnfolderBase]: 1743/7636 cut-off events.
[2024-03-12 01:08:44,359 INFO  L125   PetriNetUnfolderBase]: For 1574/2656 co-relation queries the response was YES.
[2024-03-12 01:08:44,378 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11967 conditions, 7636 events. 1743/7636 cut-off events. For 1574/2656 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 79311 event pairs, 967 based on Foata normal form. 10/6732 useless extension candidates. Maximal degree in co-relation 10404. Up to 2242 conditions per place. 
[2024-03-12 01:08:44,402 INFO  L140   encePairwiseOnDemand]: 141/148 looper letters, 29 selfloop transitions, 9 changer transitions 0/163 dead transitions.
[2024-03-12 01:08:44,403 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 163 transitions, 495 flow
[2024-03-12 01:08:44,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:44,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:44,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions.
[2024-03-12 01:08:44,404 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9211711711711712
[2024-03-12 01:08:44,404 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 409 transitions.
[2024-03-12 01:08:44,404 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions.
[2024-03-12 01:08:44,404 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:44,404 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions.
[2024-03-12 01:08:44,405 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:44,406 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:44,406 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:44,406 INFO  L175             Difference]: Start difference. First operand has 156 places, 148 transitions, 361 flow. Second operand 3 states and 409 transitions.
[2024-03-12 01:08:44,406 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 163 transitions, 495 flow
[2024-03-12 01:08:44,407 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 163 transitions, 485 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:08:44,409 INFO  L231             Difference]: Finished difference. Result has 155 places, 155 transitions, 427 flow
[2024-03-12 01:08:44,409 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=155, PETRI_TRANSITIONS=155}
[2024-03-12 01:08:44,409 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 6 predicate places.
[2024-03-12 01:08:44,410 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 155 transitions, 427 flow
[2024-03-12 01:08:44,410 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:44,410 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:44,410 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:44,410 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-03-12 01:08:44,410 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:08:44,411 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:44,411 INFO  L85        PathProgramCache]: Analyzing trace with hash 124079013, now seen corresponding path program 1 times
[2024-03-12 01:08:44,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:44,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922373701]
[2024-03-12 01:08:44,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:44,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:44,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:44,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:08:44,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:44,645 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922373701]
[2024-03-12 01:08:44,645 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922373701] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:44,645 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:44,645 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:44,645 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174404959]
[2024-03-12 01:08:44,645 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:44,646 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:08:44,646 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:44,646 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:08:44,646 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:08:44,785 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 148
[2024-03-12 01:08:44,786 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 155 transitions, 427 flow. Second operand  has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:44,786 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:44,786 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 148
[2024-03-12 01:08:44,786 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:45,922 INFO  L124   PetriNetUnfolderBase]: 3239/12110 cut-off events.
[2024-03-12 01:08:45,922 INFO  L125   PetriNetUnfolderBase]: For 1843/2394 co-relation queries the response was YES.
[2024-03-12 01:08:45,948 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19965 conditions, 12110 events. 3239/12110 cut-off events. For 1843/2394 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 132762 event pairs, 1413 based on Foata normal form. 17/10821 useless extension candidates. Maximal degree in co-relation 15509. Up to 2157 conditions per place. 
[2024-03-12 01:08:45,978 INFO  L140   encePairwiseOnDemand]: 141/148 looper letters, 51 selfloop transitions, 5 changer transitions 0/177 dead transitions.
[2024-03-12 01:08:45,979 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 177 transitions, 583 flow
[2024-03-12 01:08:45,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:45,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:45,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions.
[2024-03-12 01:08:45,981 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8153153153153153
[2024-03-12 01:08:45,981 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 724 transitions.
[2024-03-12 01:08:45,981 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions.
[2024-03-12 01:08:45,981 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:45,981 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions.
[2024-03-12 01:08:45,983 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:45,984 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:45,985 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:45,985 INFO  L175             Difference]: Start difference. First operand has 155 places, 155 transitions, 427 flow. Second operand 6 states and 724 transitions.
[2024-03-12 01:08:45,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 177 transitions, 583 flow
[2024-03-12 01:08:45,994 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 177 transitions, 565 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:08:45,996 INFO  L231             Difference]: Finished difference. Result has 156 places, 153 transitions, 415 flow
[2024-03-12 01:08:45,996 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=415, PETRI_PLACES=156, PETRI_TRANSITIONS=153}
[2024-03-12 01:08:45,997 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 7 predicate places.
[2024-03-12 01:08:45,997 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 415 flow
[2024-03-12 01:08:45,997 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:45,998 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:45,998 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:45,998 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-03-12 01:08:45,998 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:08:45,998 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:45,998 INFO  L85        PathProgramCache]: Analyzing trace with hash -687312094, now seen corresponding path program 1 times
[2024-03-12 01:08:45,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:45,999 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137177226]
[2024-03-12 01:08:45,999 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:45,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:46,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:46,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:46,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:46,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137177226]
[2024-03-12 01:08:46,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137177226] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:08:46,082 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591311918]
[2024-03-12 01:08:46,082 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:46,082 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:08:46,082 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:08:46,083 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:08:46,084 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-12 01:08:46,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:46,193 INFO  L262         TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-12 01:08:46,196 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:08:46,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:46,251 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:08:46,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:46,306 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [591311918] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:08:46,307 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:08:46,307 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-12 01:08:46,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654912267]
[2024-03-12 01:08:46,307 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:08:46,307 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-12 01:08:46,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:46,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-12 01:08:46,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-12 01:08:46,487 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 148
[2024-03-12 01:08:46,488 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 415 flow. Second operand  has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:46,488 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:46,488 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 148
[2024-03-12 01:08:46,488 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:47,560 INFO  L124   PetriNetUnfolderBase]: 1466/8030 cut-off events.
[2024-03-12 01:08:47,560 INFO  L125   PetriNetUnfolderBase]: For 963/1188 co-relation queries the response was YES.
[2024-03-12 01:08:47,573 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12365 conditions, 8030 events. 1466/8030 cut-off events. For 963/1188 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 83353 event pairs, 536 based on Foata normal form. 1/7296 useless extension candidates. Maximal degree in co-relation 6750. Up to 1078 conditions per place. 
[2024-03-12 01:08:47,585 INFO  L140   encePairwiseOnDemand]: 138/148 looper letters, 48 selfloop transitions, 10 changer transitions 0/185 dead transitions.
[2024-03-12 01:08:47,585 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 185 transitions, 606 flow
[2024-03-12 01:08:47,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-12 01:08:47,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-12 01:08:47,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1019 transitions.
[2024-03-12 01:08:47,588 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8606418918918919
[2024-03-12 01:08:47,588 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1019 transitions.
[2024-03-12 01:08:47,588 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1019 transitions.
[2024-03-12 01:08:47,588 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:47,588 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1019 transitions.
[2024-03-12 01:08:47,590 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 127.375) internal successors, (1019), 8 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:47,592 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 148.0) internal successors, (1332), 9 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:47,592 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 148.0) internal successors, (1332), 9 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:47,592 INFO  L175             Difference]: Start difference. First operand has 156 places, 153 transitions, 415 flow. Second operand 8 states and 1019 transitions.
[2024-03-12 01:08:47,592 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 185 transitions, 606 flow
[2024-03-12 01:08:47,595 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 185 transitions, 594 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:08:47,596 INFO  L231             Difference]: Finished difference. Result has 161 places, 156 transitions, 449 flow
[2024-03-12 01:08:47,596 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=449, PETRI_PLACES=161, PETRI_TRANSITIONS=156}
[2024-03-12 01:08:47,597 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 12 predicate places.
[2024-03-12 01:08:47,597 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 156 transitions, 449 flow
[2024-03-12 01:08:47,597 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:47,597 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:47,597 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:47,604 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-12 01:08:47,798 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2024-03-12 01:08:47,798 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:08:47,799 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:47,799 INFO  L85        PathProgramCache]: Analyzing trace with hash 339486976, now seen corresponding path program 1 times
[2024-03-12 01:08:47,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:47,800 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934329230]
[2024-03-12 01:08:47,800 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:47,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:47,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:47,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:08:47,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:47,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934329230]
[2024-03-12 01:08:47,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934329230] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:47,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:47,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:47,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504729598]
[2024-03-12 01:08:47,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:47,983 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:08:47,983 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:47,983 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:08:47,983 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:08:48,116 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 148
[2024-03-12 01:08:48,118 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 156 transitions, 449 flow. Second operand  has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:48,118 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:48,118 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 148
[2024-03-12 01:08:48,118 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:48,895 INFO  L124   PetriNetUnfolderBase]: 2161/8242 cut-off events.
[2024-03-12 01:08:48,895 INFO  L125   PetriNetUnfolderBase]: For 834/1139 co-relation queries the response was YES.
[2024-03-12 01:08:48,920 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13644 conditions, 8242 events. 2161/8242 cut-off events. For 834/1139 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 84066 event pairs, 945 based on Foata normal form. 6/7479 useless extension candidates. Maximal degree in co-relation 9840. Up to 1477 conditions per place. 
[2024-03-12 01:08:48,942 INFO  L140   encePairwiseOnDemand]: 142/148 looper letters, 44 selfloop transitions, 5 changer transitions 0/179 dead transitions.
[2024-03-12 01:08:48,942 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 179 transitions, 593 flow
[2024-03-12 01:08:48,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:48,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:48,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions.
[2024-03-12 01:08:48,944 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8603603603603603
[2024-03-12 01:08:48,944 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 764 transitions.
[2024-03-12 01:08:48,944 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions.
[2024-03-12 01:08:48,945 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:48,945 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions.
[2024-03-12 01:08:48,947 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:48,948 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:48,948 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:48,948 INFO  L175             Difference]: Start difference. First operand has 161 places, 156 transitions, 449 flow. Second operand 6 states and 764 transitions.
[2024-03-12 01:08:48,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 179 transitions, 593 flow
[2024-03-12 01:08:48,951 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 179 transitions, 587 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 01:08:48,953 INFO  L231             Difference]: Finished difference. Result has 162 places, 155 transitions, 451 flow
[2024-03-12 01:08:48,953 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=162, PETRI_TRANSITIONS=155}
[2024-03-12 01:08:48,953 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 13 predicate places.
[2024-03-12 01:08:48,953 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 155 transitions, 451 flow
[2024-03-12 01:08:48,954 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:48,954 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:48,954 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:48,954 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-12 01:08:48,954 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:08:48,954 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:48,954 INFO  L85        PathProgramCache]: Analyzing trace with hash -1989409948, now seen corresponding path program 1 times
[2024-03-12 01:08:48,954 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:48,955 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481566864]
[2024-03-12 01:08:48,955 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:48,955 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:48,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:49,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-12 01:08:49,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:49,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481566864]
[2024-03-12 01:08:49,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481566864] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:49,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:49,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:08:49,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933214110]
[2024-03-12 01:08:49,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:49,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:49,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:49,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:49,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:49,049 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 148
[2024-03-12 01:08:49,050 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 155 transitions, 451 flow. Second operand  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:49,050 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:49,050 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 148
[2024-03-12 01:08:49,050 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:49,643 INFO  L124   PetriNetUnfolderBase]: 1085/6141 cut-off events.
[2024-03-12 01:08:49,643 INFO  L125   PetriNetUnfolderBase]: For 2620/4043 co-relation queries the response was YES.
[2024-03-12 01:08:49,664 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10781 conditions, 6141 events. 1085/6141 cut-off events. For 2620/4043 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 66147 event pairs, 578 based on Foata normal form. 14/5714 useless extension candidates. Maximal degree in co-relation 9687. Up to 1449 conditions per place. 
[2024-03-12 01:08:49,678 INFO  L140   encePairwiseOnDemand]: 141/148 looper letters, 31 selfloop transitions, 13 changer transitions 0/171 dead transitions.
[2024-03-12 01:08:49,679 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 171 transitions, 612 flow
[2024-03-12 01:08:49,679 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:49,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:49,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions.
[2024-03-12 01:08:49,680 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.918918918918919
[2024-03-12 01:08:49,680 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 408 transitions.
[2024-03-12 01:08:49,680 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions.
[2024-03-12 01:08:49,680 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:49,680 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions.
[2024-03-12 01:08:49,681 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:49,682 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:49,682 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:49,682 INFO  L175             Difference]: Start difference. First operand has 162 places, 155 transitions, 451 flow. Second operand 3 states and 408 transitions.
[2024-03-12 01:08:49,682 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 171 transitions, 612 flow
[2024-03-12 01:08:49,687 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 171 transitions, 602 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:08:49,688 INFO  L231             Difference]: Finished difference. Result has 161 places, 164 transitions, 559 flow
[2024-03-12 01:08:49,689 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=161, PETRI_TRANSITIONS=164}
[2024-03-12 01:08:49,689 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 12 predicate places.
[2024-03-12 01:08:49,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 164 transitions, 559 flow
[2024-03-12 01:08:49,689 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:49,689 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:49,689 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:49,689 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-12 01:08:49,690 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:08:49,690 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:49,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 318942446, now seen corresponding path program 1 times
[2024-03-12 01:08:49,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:49,690 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683576752]
[2024-03-12 01:08:49,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:49,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:49,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:49,752 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-12 01:08:49,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:49,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683576752]
[2024-03-12 01:08:49,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683576752] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:49,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:49,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 01:08:49,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14257440]
[2024-03-12 01:08:49,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:49,753 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:49,753 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:49,753 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:49,753 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:49,762 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 148
[2024-03-12 01:08:49,762 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 164 transitions, 559 flow. Second operand  has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:49,763 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:49,763 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 148
[2024-03-12 01:08:49,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:49,934 INFO  L124   PetriNetUnfolderBase]: 117/1837 cut-off events.
[2024-03-12 01:08:49,934 INFO  L125   PetriNetUnfolderBase]: For 754/934 co-relation queries the response was YES.
[2024-03-12 01:08:49,939 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 1837 events. 117/1837 cut-off events. For 754/934 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14391 event pairs, 43 based on Foata normal form. 24/1785 useless extension candidates. Maximal degree in co-relation 2347. Up to 144 conditions per place. 
[2024-03-12 01:08:49,941 INFO  L140   encePairwiseOnDemand]: 142/148 looper letters, 12 selfloop transitions, 6 changer transitions 0/159 dead transitions.
[2024-03-12 01:08:49,941 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 532 flow
[2024-03-12 01:08:49,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:49,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:49,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions.
[2024-03-12 01:08:49,943 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9391891891891891
[2024-03-12 01:08:49,943 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 417 transitions.
[2024-03-12 01:08:49,943 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions.
[2024-03-12 01:08:49,943 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:49,943 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions.
[2024-03-12 01:08:49,943 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:49,944 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:49,944 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:49,944 INFO  L175             Difference]: Start difference. First operand has 161 places, 164 transitions, 559 flow. Second operand 3 states and 417 transitions.
[2024-03-12 01:08:49,944 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 532 flow
[2024-03-12 01:08:49,947 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 518 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:08:49,948 INFO  L231             Difference]: Finished difference. Result has 161 places, 154 transitions, 463 flow
[2024-03-12 01:08:49,948 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=161, PETRI_TRANSITIONS=154}
[2024-03-12 01:08:49,948 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 12 predicate places.
[2024-03-12 01:08:49,949 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 463 flow
[2024-03-12 01:08:49,949 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:49,949 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:49,949 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:49,949 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-03-12 01:08:49,949 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:08:49,949 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:49,949 INFO  L85        PathProgramCache]: Analyzing trace with hash -431818199, now seen corresponding path program 1 times
[2024-03-12 01:08:49,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:49,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748178796]
[2024-03-12 01:08:49,950 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:49,950 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:49,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:49,985 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2024-03-12 01:08:49,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:49,985 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748178796]
[2024-03-12 01:08:49,985 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748178796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:49,985 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:49,985 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:08:49,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663508751]
[2024-03-12 01:08:49,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:49,986 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:49,986 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:49,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:49,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:49,999 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 148
[2024-03-12 01:08:50,000 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 463 flow. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:50,000 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:50,000 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 148
[2024-03-12 01:08:50,000 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:50,203 INFO  L124   PetriNetUnfolderBase]: 203/2114 cut-off events.
[2024-03-12 01:08:50,203 INFO  L125   PetriNetUnfolderBase]: For 1411/1902 co-relation queries the response was YES.
[2024-03-12 01:08:50,207 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 2114 events. 203/2114 cut-off events. For 1411/1902 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 17872 event pairs, 134 based on Foata normal form. 3/1970 useless extension candidates. Maximal degree in co-relation 3127. Up to 435 conditions per place. 
[2024-03-12 01:08:50,209 INFO  L140   encePairwiseOnDemand]: 143/148 looper letters, 25 selfloop transitions, 5 changer transitions 0/159 dead transitions.
[2024-03-12 01:08:50,209 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 545 flow
[2024-03-12 01:08:50,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:50,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:50,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions.
[2024-03-12 01:08:50,211 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9031531531531531
[2024-03-12 01:08:50,211 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 401 transitions.
[2024-03-12 01:08:50,211 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions.
[2024-03-12 01:08:50,211 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:50,211 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions.
[2024-03-12 01:08:50,211 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:50,212 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:50,212 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:50,212 INFO  L175             Difference]: Start difference. First operand has 161 places, 154 transitions, 463 flow. Second operand 3 states and 401 transitions.
[2024-03-12 01:08:50,212 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 545 flow
[2024-03-12 01:08:50,214 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 539 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:08:50,216 INFO  L231             Difference]: Finished difference. Result has 164 places, 157 transitions, 497 flow
[2024-03-12 01:08:50,216 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=164, PETRI_TRANSITIONS=157}
[2024-03-12 01:08:50,216 INFO  L281   CegarLoopForPetriNet]: 149 programPoint places, 15 predicate places.
[2024-03-12 01:08:50,216 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 157 transitions, 497 flow
[2024-03-12 01:08:50,216 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:50,216 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:50,216 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:50,217 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-12 01:08:50,217 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 01:08:50,217 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:50,217 INFO  L85        PathProgramCache]: Analyzing trace with hash -192084319, now seen corresponding path program 1 times
[2024-03-12 01:08:50,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:50,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690698536]
[2024-03-12 01:08:50,217 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:50,217 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:50,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:08:50,247 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:08:50,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:08:50,273 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:08:50,273 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:08:50,273 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining)
[2024-03-12 01:08:50,273 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2024-03-12 01:08:50,273 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2024-03-12 01:08:50,273 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining)
[2024-03-12 01:08:50,273 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2024-03-12 01:08:50,273 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2024-03-12 01:08:50,273 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2024-03-12 01:08:50,273 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2024-03-12 01:08:50,274 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2024-03-12 01:08:50,274 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2024-03-12 01:08:50,274 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-03-12 01:08:50,274 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:50,274 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:08:50,274 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-12 01:08:50,298 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-03-12 01:08:50,300 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 168 places, 166 transitions, 372 flow
[2024-03-12 01:08:50,382 INFO  L124   PetriNetUnfolderBase]: 43/875 cut-off events.
[2024-03-12 01:08:50,382 INFO  L125   PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES.
[2024-03-12 01:08:50,384 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 926 conditions, 875 events. 43/875 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3140 event pairs, 6 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 513. Up to 32 conditions per place. 
[2024-03-12 01:08:50,384 INFO  L82        GeneralOperation]: Start removeDead. Operand has 168 places, 166 transitions, 372 flow
[2024-03-12 01:08:50,386 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 168 places, 166 transitions, 372 flow
[2024-03-12 01:08:50,386 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:08:50,387 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=LoopHeads, 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;@7a0e39ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:08:50,387 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-03-12 01:08:50,388 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:08:50,388 INFO  L124   PetriNetUnfolderBase]: 3/50 cut-off events.
[2024-03-12 01:08:50,388 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:08:50,389 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:50,389 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:50,389 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:08:50,389 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:50,389 INFO  L85        PathProgramCache]: Analyzing trace with hash -1989902805, now seen corresponding path program 1 times
[2024-03-12 01:08:50,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:50,389 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994408877]
[2024-03-12 01:08:50,389 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:50,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:50,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:50,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:50,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:50,401 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994408877]
[2024-03-12 01:08:50,401 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994408877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:50,401 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:50,401 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:08:50,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049571646]
[2024-03-12 01:08:50,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:50,402 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:08:50,402 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:50,402 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:08:50,402 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:08:50,420 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 140 out of 166
[2024-03-12 01:08:50,420 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 372 flow. Second operand  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:50,420 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:50,420 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 166
[2024-03-12 01:08:50,421 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:53,086 INFO  L124   PetriNetUnfolderBase]: 7859/26495 cut-off events.
[2024-03-12 01:08:53,086 INFO  L125   PetriNetUnfolderBase]: For 2838/5061 co-relation queries the response was YES.
[2024-03-12 01:08:53,144 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38845 conditions, 26495 events. 7859/26495 cut-off events. For 2838/5061 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 307503 event pairs, 4292 based on Foata normal form. 814/24648 useless extension candidates. Maximal degree in co-relation 30842. Up to 7653 conditions per place. 
[2024-03-12 01:08:53,233 INFO  L140   encePairwiseOnDemand]: 156/166 looper letters, 30 selfloop transitions, 6 changer transitions 1/176 dead transitions.
[2024-03-12 01:08:53,233 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 176 transitions, 464 flow
[2024-03-12 01:08:53,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:08:53,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:08:53,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions.
[2024-03-12 01:08:53,235 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9236947791164659
[2024-03-12 01:08:53,235 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 460 transitions.
[2024-03-12 01:08:53,235 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions.
[2024-03-12 01:08:53,235 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:53,235 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions.
[2024-03-12 01:08:53,236 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 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)
[2024-03-12 01:08:53,236 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:53,236 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:53,237 INFO  L175             Difference]: Start difference. First operand has 168 places, 166 transitions, 372 flow. Second operand 3 states and 460 transitions.
[2024-03-12 01:08:53,237 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 176 transitions, 464 flow
[2024-03-12 01:08:53,238 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 176 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:08:53,240 INFO  L231             Difference]: Finished difference. Result has 172 places, 167 transitions, 410 flow
[2024-03-12 01:08:53,240 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=172, PETRI_TRANSITIONS=167}
[2024-03-12 01:08:53,240 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 4 predicate places.
[2024-03-12 01:08:53,240 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 167 transitions, 410 flow
[2024-03-12 01:08:53,240 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:53,241 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:53,241 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:53,241 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-12 01:08:53,241 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:08:53,241 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:53,241 INFO  L85        PathProgramCache]: Analyzing trace with hash 98780464, now seen corresponding path program 1 times
[2024-03-12 01:08:53,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:53,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742751870]
[2024-03-12 01:08:53,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:53,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:53,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:53,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:53,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:53,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742751870]
[2024-03-12 01:08:53,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742751870] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:53,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:53,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:53,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081063508]
[2024-03-12 01:08:53,282 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:53,282 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:08:53,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:53,282 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:08:53,283 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:08:53,380 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 166
[2024-03-12 01:08:53,381 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 167 transitions, 410 flow. Second operand  has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:53,381 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:53,382 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 166
[2024-03-12 01:08:53,382 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:57,524 INFO  L124   PetriNetUnfolderBase]: 9343/35718 cut-off events.
[2024-03-12 01:08:57,525 INFO  L125   PetriNetUnfolderBase]: For 2608/2732 co-relation queries the response was YES.
[2024-03-12 01:08:57,623 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52635 conditions, 35718 events. 9343/35718 cut-off events. For 2608/2732 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 446962 event pairs, 7523 based on Foata normal form. 1/31492 useless extension candidates. Maximal degree in co-relation 32417. Up to 10778 conditions per place. 
[2024-03-12 01:08:57,726 INFO  L140   encePairwiseOnDemand]: 158/166 looper letters, 28 selfloop transitions, 2 changer transitions 5/175 dead transitions.
[2024-03-12 01:08:57,726 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 175 transitions, 496 flow
[2024-03-12 01:08:57,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:57,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:57,727 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions.
[2024-03-12 01:08:57,727 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8554216867469879
[2024-03-12 01:08:57,728 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 852 transitions.
[2024-03-12 01:08:57,728 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 852 transitions.
[2024-03-12 01:08:57,728 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:57,728 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 852 transitions.
[2024-03-12 01:08:57,729 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:57,730 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:57,730 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:57,730 INFO  L175             Difference]: Start difference. First operand has 172 places, 167 transitions, 410 flow. Second operand 6 states and 852 transitions.
[2024-03-12 01:08:57,730 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 175 transitions, 496 flow
[2024-03-12 01:08:57,768 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 175 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:08:57,769 INFO  L231             Difference]: Finished difference. Result has 178 places, 168 transitions, 420 flow
[2024-03-12 01:08:57,770 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=178, PETRI_TRANSITIONS=168}
[2024-03-12 01:08:57,770 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 10 predicate places.
[2024-03-12 01:08:57,770 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 168 transitions, 420 flow
[2024-03-12 01:08:57,770 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:57,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:57,770 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:57,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-12 01:08:57,771 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:08:57,771 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:57,771 INFO  L85        PathProgramCache]: Analyzing trace with hash -545774200, now seen corresponding path program 1 times
[2024-03-12 01:08:57,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:57,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147011487]
[2024-03-12 01:08:57,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:57,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:57,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:57,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:08:57,889 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:57,889 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147011487]
[2024-03-12 01:08:57,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147011487] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:57,889 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:57,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:57,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309575168]
[2024-03-12 01:08:57,889 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:57,890 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:08:57,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:57,890 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:08:57,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:08:58,060 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166
[2024-03-12 01:08:58,061 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 168 transitions, 420 flow. Second operand  has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:58,061 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:58,061 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166
[2024-03-12 01:08:58,061 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:09:04,183 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][69], [189#true, threadThread1of4ForFork0InUse, 161#L1019-5true, 37#L1019-5true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 47#L1037true, Black: 171#true, 177#true, 112#L1020-3true, Black: 183#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 181#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 180#(<= |ULTIMATE.start_main_~breads_total~0#1| 0)])
[2024-03-12 01:09:04,183 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is cut-off event
[2024-03-12 01:09:04,183 INFO  L297   olderBase$Statistics]:   existing Event has 124 ancestors and is cut-off event
[2024-03-12 01:09:04,183 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-12 01:09:04,183 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-12 01:09:05,285 INFO  L124   PetriNetUnfolderBase]: 18626/62194 cut-off events.
[2024-03-12 01:09:05,285 INFO  L125   PetriNetUnfolderBase]: For 2773/2795 co-relation queries the response was YES.
[2024-03-12 01:09:05,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94160 conditions, 62194 events. 18626/62194 cut-off events. For 2773/2795 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 812796 event pairs, 14621 based on Foata normal form. 0/53689 useless extension candidates. Maximal degree in co-relation 94059. Up to 19383 conditions per place. 
[2024-03-12 01:09:05,711 INFO  L140   encePairwiseOnDemand]: 160/166 looper letters, 69 selfloop transitions, 5 changer transitions 0/199 dead transitions.
[2024-03-12 01:09:05,711 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 199 transitions, 630 flow
[2024-03-12 01:09:05,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:09:05,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:09:05,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions.
[2024-03-12 01:09:05,713 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8032128514056225
[2024-03-12 01:09:05,713 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 800 transitions.
[2024-03-12 01:09:05,713 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions.
[2024-03-12 01:09:05,713 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:09:05,713 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions.
[2024-03-12 01:09:05,714 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:05,715 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:05,715 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:05,716 INFO  L175             Difference]: Start difference. First operand has 178 places, 168 transitions, 420 flow. Second operand 6 states and 800 transitions.
[2024-03-12 01:09:05,716 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 199 transitions, 630 flow
[2024-03-12 01:09:05,764 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 199 transitions, 618 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 01:09:05,766 INFO  L231             Difference]: Finished difference. Result has 175 places, 167 transitions, 416 flow
[2024-03-12 01:09:05,766 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=416, PETRI_PLACES=175, PETRI_TRANSITIONS=167}
[2024-03-12 01:09:05,766 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 7 predicate places.
[2024-03-12 01:09:05,766 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 167 transitions, 416 flow
[2024-03-12 01:09:05,767 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:05,767 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:05,767 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:05,767 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-03-12 01:09:05,767 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:09:05,767 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:05,767 INFO  L85        PathProgramCache]: Analyzing trace with hash 321620656, now seen corresponding path program 1 times
[2024-03-12 01:09:05,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:05,768 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737935023]
[2024-03-12 01:09:05,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:05,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:05,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:05,789 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:09:05,789 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:09:05,789 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737935023]
[2024-03-12 01:09:05,789 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737935023] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:09:05,789 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:09:05,789 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:09:05,789 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008781561]
[2024-03-12 01:09:05,790 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:09:05,790 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:09:05,790 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:09:05,790 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:09:05,790 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:09:05,810 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166
[2024-03-12 01:09:05,810 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 167 transitions, 416 flow. Second operand  has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:05,810 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:09:05,810 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166
[2024-03-12 01:09:05,810 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:09:11,011 INFO  L124   PetriNetUnfolderBase]: 13833/49472 cut-off events.
[2024-03-12 01:09:11,011 INFO  L125   PetriNetUnfolderBase]: For 11568/20327 co-relation queries the response was YES.
[2024-03-12 01:09:11,146 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79192 conditions, 49472 events. 13833/49472 cut-off events. For 11568/20327 co-relation queries the response was YES. Maximal size of possible extension queue 1463. Compared 657348 event pairs, 7275 based on Foata normal form. 42/43145 useless extension candidates. Maximal degree in co-relation 35845. Up to 16026 conditions per place. 
[2024-03-12 01:09:11,311 INFO  L140   encePairwiseOnDemand]: 158/166 looper letters, 39 selfloop transitions, 11 changer transitions 0/188 dead transitions.
[2024-03-12 01:09:11,311 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 188 transitions, 602 flow
[2024-03-12 01:09:11,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:09:11,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:09:11,312 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions.
[2024-03-12 01:09:11,313 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9196787148594378
[2024-03-12 01:09:11,313 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 458 transitions.
[2024-03-12 01:09:11,313 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions.
[2024-03-12 01:09:11,313 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:09:11,313 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions.
[2024-03-12 01:09:11,313 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:11,314 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:11,314 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:11,314 INFO  L175             Difference]: Start difference. First operand has 175 places, 167 transitions, 416 flow. Second operand 3 states and 458 transitions.
[2024-03-12 01:09:11,314 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 188 transitions, 602 flow
[2024-03-12 01:09:11,318 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 188 transitions, 592 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:09:11,319 INFO  L231             Difference]: Finished difference. Result has 174 places, 176 transitions, 502 flow
[2024-03-12 01:09:11,319 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=174, PETRI_TRANSITIONS=176}
[2024-03-12 01:09:11,319 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 6 predicate places.
[2024-03-12 01:09:11,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 176 transitions, 502 flow
[2024-03-12 01:09:11,320 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:11,320 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:11,320 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:11,320 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-12 01:09:11,320 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:09:11,320 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:11,320 INFO  L85        PathProgramCache]: Analyzing trace with hash -688364229, now seen corresponding path program 1 times
[2024-03-12 01:09:11,320 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:11,320 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933946792]
[2024-03-12 01:09:11,320 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:11,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:11,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:11,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:09:11,480 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:09:11,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933946792]
[2024-03-12 01:09:11,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933946792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:09:11,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:09:11,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:09:11,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685528744]
[2024-03-12 01:09:11,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:09:11,481 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:09:11,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:09:11,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:09:11,482 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:09:11,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 166
[2024-03-12 01:09:11,624 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 176 transitions, 502 flow. Second operand  has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:11,624 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:09:11,624 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 166
[2024-03-12 01:09:11,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:09:17,418 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1019-4-->L1019-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][169], [72#L1018-3true, threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 173#(= |#race~data~0| 0), 141#L1020true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 196#true, 202#true])
[2024-03-12 01:09:17,418 INFO  L294   olderBase$Statistics]: this new event has 181 ancestors and is cut-off event
[2024-03-12 01:09:17,418 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-12 01:09:17,418 INFO  L297   olderBase$Statistics]:   existing Event has 181 ancestors and is cut-off event
[2024-03-12 01:09:17,418 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-12 01:09:17,539 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][204], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 99#L1019-6true, 37#L1019-5true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0InUse, Black: 173#(= |#race~data~0| 0), 4#L1019-5true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 196#true, 202#true])
[2024-03-12 01:09:17,539 INFO  L294   olderBase$Statistics]: this new event has 185 ancestors and is cut-off event
[2024-03-12 01:09:17,539 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-12 01:09:17,539 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-12 01:09:17,539 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-12 01:09:17,594 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1019-4-->L1019-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][169], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 173#(= |#race~data~0| 0), 35#L1019-5true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 196#true, 202#true, 23#threadErr0ASSERT_VIOLATIONDATA_RACEtrue])
[2024-03-12 01:09:17,594 INFO  L294   olderBase$Statistics]: this new event has 185 ancestors and is cut-off event
[2024-03-12 01:09:17,594 INFO  L297   olderBase$Statistics]:   existing Event has 122 ancestors and is cut-off event
[2024-03-12 01:09:17,594 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-12 01:09:17,594 INFO  L297   olderBase$Statistics]:   existing Event has 122 ancestors and is cut-off event
[2024-03-12 01:09:18,216 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][198], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0InUse, Black: 173#(= |#race~data~0| 0), 4#L1019-5true, 141#L1020true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 196#true, 202#true])
[2024-03-12 01:09:18,217 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event
[2024-03-12 01:09:18,217 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 01:09:18,217 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 01:09:18,217 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 01:09:18,964 INFO  L124   PetriNetUnfolderBase]: 23498/69422 cut-off events.
[2024-03-12 01:09:18,964 INFO  L125   PetriNetUnfolderBase]: For 10458/14172 co-relation queries the response was YES.
[2024-03-12 01:09:19,221 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 117984 conditions, 69422 events. 23498/69422 cut-off events. For 10458/14172 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 907171 event pairs, 9806 based on Foata normal form. 80/61261 useless extension candidates. Maximal degree in co-relation 91134. Up to 12712 conditions per place. 
[2024-03-12 01:09:19,466 INFO  L140   encePairwiseOnDemand]: 159/166 looper letters, 63 selfloop transitions, 5 changer transitions 0/206 dead transitions.
[2024-03-12 01:09:19,466 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 206 transitions, 698 flow
[2024-03-12 01:09:19,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:09:19,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:09:19,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions.
[2024-03-12 01:09:19,468 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8232931726907631
[2024-03-12 01:09:19,468 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 820 transitions.
[2024-03-12 01:09:19,468 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions.
[2024-03-12 01:09:19,469 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:09:19,469 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions.
[2024-03-12 01:09:19,469 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:19,470 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:19,471 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:19,471 INFO  L175             Difference]: Start difference. First operand has 174 places, 176 transitions, 502 flow. Second operand 6 states and 820 transitions.
[2024-03-12 01:09:19,471 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 206 transitions, 698 flow
[2024-03-12 01:09:19,546 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 206 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:09:19,548 INFO  L231             Difference]: Finished difference. Result has 175 places, 174 transitions, 486 flow
[2024-03-12 01:09:19,548 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=175, PETRI_TRANSITIONS=174}
[2024-03-12 01:09:19,549 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 7 predicate places.
[2024-03-12 01:09:19,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 174 transitions, 486 flow
[2024-03-12 01:09:19,549 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:19,549 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:19,549 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:19,550 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-03-12 01:09:19,550 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:09:19,550 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:19,550 INFO  L85        PathProgramCache]: Analyzing trace with hash -664645664, now seen corresponding path program 1 times
[2024-03-12 01:09:19,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:19,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649226308]
[2024-03-12 01:09:19,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:19,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:19,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:19,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:09:19,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:09:19,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649226308]
[2024-03-12 01:09:19,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649226308] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:09:19,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230982832]
[2024-03-12 01:09:19,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:19,734 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:09:19,734 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:09:19,735 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:09:19,739 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-12 01:09:19,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:19,874 INFO  L262         TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-12 01:09:19,876 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:09:19,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:09:19,933 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:09:19,976 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:09:19,976 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [230982832] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:09:19,976 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:09:19,976 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-12 01:09:19,977 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631339294]
[2024-03-12 01:09:19,977 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:09:19,977 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-12 01:09:19,977 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:09:19,978 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-12 01:09:19,978 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-12 01:09:20,138 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 166
[2024-03-12 01:09:20,139 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 174 transitions, 486 flow. Second operand  has 9 states, 9 states have (on average 136.22222222222223) internal successors, (1226), 9 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:20,139 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:09:20,139 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 166
[2024-03-12 01:09:20,139 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:09:23,799 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][212], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 99#L1019-6true, 37#L1019-5true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0InUse, 213#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), Black: 173#(= |#race~data~0| 0), 4#L1019-5true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 202#true])
[2024-03-12 01:09:23,799 INFO  L294   olderBase$Statistics]: this new event has 185 ancestors and is cut-off event
[2024-03-12 01:09:23,799 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-12 01:09:23,799 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-12 01:09:23,799 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-12 01:09:24,390 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][211], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), threadThread4of4ForFork0InUse, Black: 173#(= |#race~data~0| 0), 4#L1019-5true, 141#L1020true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true, 202#true])
[2024-03-12 01:09:24,390 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event
[2024-03-12 01:09:24,390 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 01:09:24,390 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 01:09:24,390 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 01:09:25,209 INFO  L124   PetriNetUnfolderBase]: 11250/46416 cut-off events.
[2024-03-12 01:09:25,210 INFO  L125   PetriNetUnfolderBase]: For 6128/7899 co-relation queries the response was YES.
[2024-03-12 01:09:25,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 73697 conditions, 46416 events. 11250/46416 cut-off events. For 6128/7899 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 621045 event pairs, 4609 based on Foata normal form. 9/41398 useless extension candidates. Maximal degree in co-relation 41030. Up to 6732 conditions per place. 
[2024-03-12 01:09:25,512 INFO  L140   encePairwiseOnDemand]: 156/166 looper letters, 61 selfloop transitions, 10 changer transitions 0/215 dead transitions.
[2024-03-12 01:09:25,512 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 215 transitions, 724 flow
[2024-03-12 01:09:25,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-12 01:09:25,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-12 01:09:25,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1144 transitions.
[2024-03-12 01:09:25,514 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8614457831325302
[2024-03-12 01:09:25,514 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1144 transitions.
[2024-03-12 01:09:25,514 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1144 transitions.
[2024-03-12 01:09:25,514 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:09:25,514 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1144 transitions.
[2024-03-12 01:09:25,515 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:25,516 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:25,517 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:25,517 INFO  L175             Difference]: Start difference. First operand has 175 places, 174 transitions, 486 flow. Second operand 8 states and 1144 transitions.
[2024-03-12 01:09:25,517 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 215 transitions, 724 flow
[2024-03-12 01:09:25,533 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 215 transitions, 712 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:09:25,535 INFO  L231             Difference]: Finished difference. Result has 180 places, 177 transitions, 520 flow
[2024-03-12 01:09:25,535 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=520, PETRI_PLACES=180, PETRI_TRANSITIONS=177}
[2024-03-12 01:09:25,535 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 12 predicate places.
[2024-03-12 01:09:25,535 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 177 transitions, 520 flow
[2024-03-12 01:09:25,536 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 136.22222222222223) internal successors, (1226), 9 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:25,536 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:25,536 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:25,543 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-12 01:09:25,736 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:09:25,741 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:09:25,741 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:25,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 1224009814, now seen corresponding path program 1 times
[2024-03-12 01:09:25,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:25,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88531214]
[2024-03-12 01:09:25,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:25,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:25,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:26,050 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:09:26,051 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:09:26,051 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88531214]
[2024-03-12 01:09:26,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88531214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:09:26,051 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:09:26,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:09:26,051 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233013415]
[2024-03-12 01:09:26,051 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:09:26,051 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:09:26,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:09:26,052 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:09:26,052 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:09:26,189 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 166
[2024-03-12 01:09:26,190 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 177 transitions, 520 flow. Second operand  has 6 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:26,190 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:09:26,190 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 166
[2024-03-12 01:09:26,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:09:30,120 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][207], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0NotInUse, 99#L1019-6true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), threadThread4of4ForFork0InUse, Black: 173#(= |#race~data~0| 0), 4#L1019-5true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true])
[2024-03-12 01:09:30,120 INFO  L294   olderBase$Statistics]: this new event has 185 ancestors and is cut-off event
[2024-03-12 01:09:30,120 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-12 01:09:30,120 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-12 01:09:30,120 INFO  L297   olderBase$Statistics]:   existing Event has 185 ancestors and is cut-off event
[2024-03-12 01:09:30,377 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1019-4-->L1019-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][206], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), threadThread4of4ForFork0InUse, Black: 173#(= |#race~data~0| 0), 4#L1019-5true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 141#L1020true, 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true])
[2024-03-12 01:09:30,378 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is cut-off event
[2024-03-12 01:09:30,378 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-12 01:09:30,378 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-12 01:09:30,378 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-12 01:09:31,496 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1019-4-->L1019-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][203], [threadThread1of4ForFork0InUse, 99#L1019-6true, 37#L1019-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0NotInUse, 213#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), Black: 173#(= |#race~data~0| 0), Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true])
[2024-03-12 01:09:31,496 INFO  L294   olderBase$Statistics]: this new event has 219 ancestors and is cut-off event
[2024-03-12 01:09:31,496 INFO  L297   olderBase$Statistics]:   existing Event has 156 ancestors and is cut-off event
[2024-03-12 01:09:31,496 INFO  L297   olderBase$Statistics]:   existing Event has 156 ancestors and is cut-off event
[2024-03-12 01:09:31,496 INFO  L297   olderBase$Statistics]:   existing Event has 219 ancestors and is cut-off event
[2024-03-12 01:09:31,537 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1019-4-->L1019-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][202], [threadThread1of4ForFork0InUse, 37#L1019-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0NotInUse, 213#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), Black: 173#(= |#race~data~0| 0), Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 141#L1020true, 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L1037-1true])
[2024-03-12 01:09:31,537 INFO  L294   olderBase$Statistics]: this new event has 221 ancestors and is cut-off event
[2024-03-12 01:09:31,537 INFO  L297   olderBase$Statistics]:   existing Event has 221 ancestors and is cut-off event
[2024-03-12 01:09:31,537 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-12 01:09:31,537 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-12 01:09:31,594 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][150], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 37#L1019-5true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0NotInUse, 47#L1037true, 213#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), Black: 171#true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 141#L1020true, 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0)])
[2024-03-12 01:09:31,594 INFO  L294   olderBase$Statistics]: this new event has 220 ancestors and is cut-off event
[2024-03-12 01:09:31,594 INFO  L297   olderBase$Statistics]:   existing Event has 157 ancestors and is cut-off event
[2024-03-12 01:09:31,594 INFO  L297   olderBase$Statistics]:   existing Event has 220 ancestors and is cut-off event
[2024-03-12 01:09:31,594 INFO  L297   olderBase$Statistics]:   existing Event has 220 ancestors and is cut-off event
[2024-03-12 01:09:31,768 INFO  L124   PetriNetUnfolderBase]: 16070/47844 cut-off events.
[2024-03-12 01:09:31,768 INFO  L125   PetriNetUnfolderBase]: For 5503/8073 co-relation queries the response was YES.
[2024-03-12 01:09:31,919 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82394 conditions, 47844 events. 16070/47844 cut-off events. For 5503/8073 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 599070 event pairs, 6983 based on Foata normal form. 122/42671 useless extension candidates. Maximal degree in co-relation 59273. Up to 9119 conditions per place. 
[2024-03-12 01:09:32,066 INFO  L140   encePairwiseOnDemand]: 160/166 looper letters, 56 selfloop transitions, 5 changer transitions 0/208 dead transitions.
[2024-03-12 01:09:32,066 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 208 transitions, 704 flow
[2024-03-12 01:09:32,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:09:32,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:09:32,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 860 transitions.
[2024-03-12 01:09:32,068 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8634538152610441
[2024-03-12 01:09:32,068 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 860 transitions.
[2024-03-12 01:09:32,068 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 860 transitions.
[2024-03-12 01:09:32,068 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:09:32,068 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 860 transitions.
[2024-03-12 01:09:32,069 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:32,070 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:32,070 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:32,070 INFO  L175             Difference]: Start difference. First operand has 180 places, 177 transitions, 520 flow. Second operand 6 states and 860 transitions.
[2024-03-12 01:09:32,070 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 208 transitions, 704 flow
[2024-03-12 01:09:32,081 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 208 transitions, 698 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 01:09:32,083 INFO  L231             Difference]: Finished difference. Result has 181 places, 176 transitions, 522 flow
[2024-03-12 01:09:32,083 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=181, PETRI_TRANSITIONS=176}
[2024-03-12 01:09:32,084 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 13 predicate places.
[2024-03-12 01:09:32,084 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 522 flow
[2024-03-12 01:09:32,084 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:32,084 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:32,084 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:32,084 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-03-12 01:09:32,084 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:09:32,085 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:32,085 INFO  L85        PathProgramCache]: Analyzing trace with hash 1672764532, now seen corresponding path program 1 times
[2024-03-12 01:09:32,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:32,085 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837667421]
[2024-03-12 01:09:32,085 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:32,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:32,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:32,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-12 01:09:32,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:09:32,115 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837667421]
[2024-03-12 01:09:32,115 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837667421] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:09:32,115 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:09:32,115 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:09:32,115 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10270298]
[2024-03-12 01:09:32,115 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:09:32,116 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:09:32,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:09:32,116 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:09:32,116 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:09:32,136 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166
[2024-03-12 01:09:32,136 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 522 flow. Second operand  has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:32,136 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:09:32,136 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166
[2024-03-12 01:09:32,136 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:09:37,151 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][183], [threadThread1of4ForFork0InUse, 99#L1019-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 41#L1020true, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), 47#L1037true, Black: 171#true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 605#true])
[2024-03-12 01:09:37,152 INFO  L294   olderBase$Statistics]: this new event has 221 ancestors and is cut-off event
[2024-03-12 01:09:37,152 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-12 01:09:37,152 INFO  L297   olderBase$Statistics]:   existing Event has 221 ancestors and is cut-off event
[2024-03-12 01:09:37,152 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-12 01:09:37,167 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([645] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][183], [threadThread1of4ForFork0InUse, 99#L1019-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 47#L1037true, 213#(<= 1 |ULTIMATE.start_main_~breads_total~0#1|), Black: 171#true, 112#L1020-3true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 605#true])
[2024-03-12 01:09:37,167 INFO  L294   olderBase$Statistics]: this new event has 222 ancestors and is cut-off event
[2024-03-12 01:09:37,167 INFO  L297   olderBase$Statistics]:   existing Event has 222 ancestors and is cut-off event
[2024-03-12 01:09:37,167 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-03-12 01:09:37,167 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is cut-off event
[2024-03-12 01:09:37,267 INFO  L124   PetriNetUnfolderBase]: 11770/46164 cut-off events.
[2024-03-12 01:09:37,267 INFO  L125   PetriNetUnfolderBase]: For 23976/36637 co-relation queries the response was YES.
[2024-03-12 01:09:37,517 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85233 conditions, 46164 events. 11770/46164 cut-off events. For 23976/36637 co-relation queries the response was YES. Maximal size of possible extension queue 1508. Compared 643519 event pairs, 6450 based on Foata normal form. 50/41999 useless extension candidates. Maximal degree in co-relation 76233. Up to 13606 conditions per place. 
[2024-03-12 01:09:37,655 INFO  L140   encePairwiseOnDemand]: 158/166 looper letters, 43 selfloop transitions, 18 changer transitions 0/201 dead transitions.
[2024-03-12 01:09:37,656 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 201 transitions, 767 flow
[2024-03-12 01:09:37,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:09:37,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:09:37,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions.
[2024-03-12 01:09:37,657 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9176706827309237
[2024-03-12 01:09:37,657 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 457 transitions.
[2024-03-12 01:09:37,658 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions.
[2024-03-12 01:09:37,658 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:09:37,658 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions.
[2024-03-12 01:09:37,658 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:37,659 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:37,659 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:37,659 INFO  L175             Difference]: Start difference. First operand has 181 places, 176 transitions, 522 flow. Second operand 3 states and 457 transitions.
[2024-03-12 01:09:37,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 201 transitions, 767 flow
[2024-03-12 01:09:37,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 201 transitions, 757 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:09:37,694 INFO  L231             Difference]: Finished difference. Result has 180 places, 190 transitions, 690 flow
[2024-03-12 01:09:37,694 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=180, PETRI_TRANSITIONS=190}
[2024-03-12 01:09:37,695 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 12 predicate places.
[2024-03-12 01:09:37,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 190 transitions, 690 flow
[2024-03-12 01:09:37,695 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:37,695 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:37,695 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:37,696 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-03-12 01:09:37,696 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:09:37,696 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:37,696 INFO  L85        PathProgramCache]: Analyzing trace with hash 849959134, now seen corresponding path program 1 times
[2024-03-12 01:09:37,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:37,696 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900751927]
[2024-03-12 01:09:37,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:37,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:37,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:37,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-03-12 01:09:37,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:09:37,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900751927]
[2024-03-12 01:09:37,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900751927] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:09:37,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:09:37,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 01:09:37,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519481279]
[2024-03-12 01:09:37,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:09:37,745 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:09:37,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:09:37,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:09:37,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:09:37,755 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 166
[2024-03-12 01:09:37,756 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 190 transitions, 690 flow. Second operand  has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:37,756 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:09:37,756 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 166
[2024-03-12 01:09:37,756 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:09:38,484 INFO  L124   PetriNetUnfolderBase]: 660/7154 cut-off events.
[2024-03-12 01:09:38,484 INFO  L125   PetriNetUnfolderBase]: For 3309/4024 co-relation queries the response was YES.
[2024-03-12 01:09:38,507 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11917 conditions, 7154 events. 660/7154 cut-off events. For 3309/4024 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 80144 event pairs, 237 based on Foata normal form. 185/6908 useless extension candidates. Maximal degree in co-relation 9194. Up to 678 conditions per place. 
[2024-03-12 01:09:38,517 INFO  L140   encePairwiseOnDemand]: 158/166 looper letters, 16 selfloop transitions, 8 changer transitions 0/180 dead transitions.
[2024-03-12 01:09:38,518 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 180 transitions, 623 flow
[2024-03-12 01:09:38,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:09:38,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:09:38,519 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions.
[2024-03-12 01:09:38,519 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357429718875502
[2024-03-12 01:09:38,519 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 466 transitions.
[2024-03-12 01:09:38,519 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions.
[2024-03-12 01:09:38,519 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:09:38,519 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions.
[2024-03-12 01:09:38,520 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:38,520 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:38,520 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:38,520 INFO  L175             Difference]: Start difference. First operand has 180 places, 190 transitions, 690 flow. Second operand 3 states and 466 transitions.
[2024-03-12 01:09:38,520 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 180 transitions, 623 flow
[2024-03-12 01:09:38,529 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 180 transitions, 609 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:09:38,530 INFO  L231             Difference]: Finished difference. Result has 180 places, 173 transitions, 530 flow
[2024-03-12 01:09:38,530 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=180, PETRI_TRANSITIONS=173}
[2024-03-12 01:09:38,531 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 12 predicate places.
[2024-03-12 01:09:38,531 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 173 transitions, 530 flow
[2024-03-12 01:09:38,531 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:38,531 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:38,531 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:38,531 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-03-12 01:09:38,531 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:09:38,531 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:38,532 INFO  L85        PathProgramCache]: Analyzing trace with hash -1875256257, now seen corresponding path program 1 times
[2024-03-12 01:09:38,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:38,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984030839]
[2024-03-12 01:09:38,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:38,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:38,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:38,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2024-03-12 01:09:38,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:09:38,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984030839]
[2024-03-12 01:09:38,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984030839] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:09:38,566 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:09:38,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:09:38,566 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523352678]
[2024-03-12 01:09:38,566 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:09:38,567 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:09:38,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:09:38,567 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:09:38,567 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:09:38,586 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166
[2024-03-12 01:09:38,586 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 173 transitions, 530 flow. Second operand  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:38,587 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:09:38,587 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166
[2024-03-12 01:09:38,587 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:09:39,529 INFO  L124   PetriNetUnfolderBase]: 1138/9053 cut-off events.
[2024-03-12 01:09:39,530 INFO  L125   PetriNetUnfolderBase]: For 6897/8926 co-relation queries the response was YES.
[2024-03-12 01:09:39,557 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16816 conditions, 9053 events. 1138/9053 cut-off events. For 6897/8926 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 107015 event pairs, 661 based on Foata normal form. 13/8292 useless extension candidates. Maximal degree in co-relation 13201. Up to 2082 conditions per place. 
[2024-03-12 01:09:39,572 INFO  L140   encePairwiseOnDemand]: 161/166 looper letters, 33 selfloop transitions, 5 changer transitions 0/180 dead transitions.
[2024-03-12 01:09:39,572 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 180 transitions, 644 flow
[2024-03-12 01:09:39,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:09:39,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:09:39,573 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions.
[2024-03-12 01:09:39,573 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8975903614457831
[2024-03-12 01:09:39,573 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 447 transitions.
[2024-03-12 01:09:39,573 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions.
[2024-03-12 01:09:39,573 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:09:39,574 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions.
[2024-03-12 01:09:39,574 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:39,574 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:39,575 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:39,575 INFO  L175             Difference]: Start difference. First operand has 180 places, 173 transitions, 530 flow. Second operand 3 states and 447 transitions.
[2024-03-12 01:09:39,575 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 180 transitions, 644 flow
[2024-03-12 01:09:39,579 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 180 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:09:39,581 INFO  L231             Difference]: Finished difference. Result has 183 places, 176 transitions, 562 flow
[2024-03-12 01:09:39,581 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=183, PETRI_TRANSITIONS=176}
[2024-03-12 01:09:39,581 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 15 predicate places.
[2024-03-12 01:09:39,581 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 176 transitions, 562 flow
[2024-03-12 01:09:39,581 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:39,582 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:39,582 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:39,582 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-03-12 01:09:39,582 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:09:39,582 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:39,582 INFO  L85        PathProgramCache]: Analyzing trace with hash 868185731, now seen corresponding path program 1 times
[2024-03-12 01:09:39,582 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:39,582 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538935592]
[2024-03-12 01:09:39,582 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:39,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:39,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:39,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked.
[2024-03-12 01:09:39,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:09:39,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538935592]
[2024-03-12 01:09:39,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538935592] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:09:39,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:09:39,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:09:39,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559256005]
[2024-03-12 01:09:39,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:09:39,626 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:09:39,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:09:39,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:09:39,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:09:39,649 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166
[2024-03-12 01:09:39,650 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 176 transitions, 562 flow. Second operand  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:39,650 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:09:39,650 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166
[2024-03-12 01:09:39,650 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:09:40,623 INFO  L124   PetriNetUnfolderBase]: 1121/8783 cut-off events.
[2024-03-12 01:09:40,623 INFO  L125   PetriNetUnfolderBase]: For 9167/11724 co-relation queries the response was YES.
[2024-03-12 01:09:40,643 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17181 conditions, 8783 events. 1121/8783 cut-off events. For 9167/11724 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 103784 event pairs, 707 based on Foata normal form. 13/8087 useless extension candidates. Maximal degree in co-relation 13650. Up to 2095 conditions per place. 
[2024-03-12 01:09:40,655 INFO  L140   encePairwiseOnDemand]: 161/166 looper letters, 33 selfloop transitions, 5 changer transitions 0/182 dead transitions.
[2024-03-12 01:09:40,656 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 182 transitions, 667 flow
[2024-03-12 01:09:40,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:09:40,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:09:40,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions.
[2024-03-12 01:09:40,658 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8955823293172691
[2024-03-12 01:09:40,658 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 446 transitions.
[2024-03-12 01:09:40,658 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions.
[2024-03-12 01:09:40,658 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:09:40,658 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions.
[2024-03-12 01:09:40,659 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:40,660 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:40,661 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:40,661 INFO  L175             Difference]: Start difference. First operand has 183 places, 176 transitions, 562 flow. Second operand 3 states and 446 transitions.
[2024-03-12 01:09:40,661 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 182 transitions, 667 flow
[2024-03-12 01:09:40,672 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 653 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:09:40,674 INFO  L231             Difference]: Finished difference. Result has 185 places, 179 transitions, 590 flow
[2024-03-12 01:09:40,674 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=185, PETRI_TRANSITIONS=179}
[2024-03-12 01:09:40,674 INFO  L281   CegarLoopForPetriNet]: 168 programPoint places, 17 predicate places.
[2024-03-12 01:09:40,674 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 179 transitions, 590 flow
[2024-03-12 01:09:40,675 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:40,675 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:40,675 INFO  L208   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:40,675 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-03-12 01:09:40,675 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-12 01:09:40,675 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:40,675 INFO  L85        PathProgramCache]: Analyzing trace with hash -1880205221, now seen corresponding path program 1 times
[2024-03-12 01:09:40,675 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:40,675 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712875079]
[2024-03-12 01:09:40,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:40,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:40,717 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:09:40,718 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:09:40,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:09:40,748 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:09:40,748 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:09:40,748 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-03-12 01:09:40,748 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-03-12 01:09:40,748 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-03-12 01:09:40,748 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-03-12 01:09:40,748 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-03-12 01:09:40,748 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-03-12 01:09:40,749 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-03-12 01:09:40,749 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-03-12 01:09:40,749 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-03-12 01:09:40,749 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-03-12 01:09:40,749 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-03-12 01:09:40,749 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-03-12 01:09:40,749 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:40,749 WARN  L233   ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:09:40,749 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances.
[2024-03-12 01:09:40,775 INFO  L144    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2024-03-12 01:09:40,777 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 187 places, 184 transitions, 423 flow
[2024-03-12 01:09:40,923 INFO  L124   PetriNetUnfolderBase]: 93/1605 cut-off events.
[2024-03-12 01:09:40,923 INFO  L125   PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES.
[2024-03-12 01:09:40,928 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 1605 events. 93/1605 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7686 event pairs, 23 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 920. Up to 80 conditions per place. 
[2024-03-12 01:09:40,928 INFO  L82        GeneralOperation]: Start removeDead. Operand has 187 places, 184 transitions, 423 flow
[2024-03-12 01:09:40,932 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 187 places, 184 transitions, 423 flow
[2024-03-12 01:09:40,933 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:09:40,933 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=LoopHeads, 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;@7a0e39ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:09:40,933 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2024-03-12 01:09:40,935 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:09:40,935 INFO  L124   PetriNetUnfolderBase]: 3/50 cut-off events.
[2024-03-12 01:09:40,935 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:09:40,935 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:40,935 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:40,935 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:09:40,935 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:40,935 INFO  L85        PathProgramCache]: Analyzing trace with hash -2001205973, now seen corresponding path program 1 times
[2024-03-12 01:09:40,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:40,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838459778]
[2024-03-12 01:09:40,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:40,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:40,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:40,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:09:40,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:09:40,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838459778]
[2024-03-12 01:09:40,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838459778] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:09:40,963 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:09:40,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:09:40,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088609903]
[2024-03-12 01:09:40,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:09:40,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:09:40,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:09:40,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:09:40,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:09:40,990 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 153 out of 184
[2024-03-12 01:09:40,991 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 184 transitions, 423 flow. Second operand  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:40,991 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:09:40,991 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 184
[2024-03-12 01:09:40,991 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:09:57,565 INFO  L124   PetriNetUnfolderBase]: 51883/146711 cut-off events.
[2024-03-12 01:09:57,566 INFO  L125   PetriNetUnfolderBase]: For 15094/28208 co-relation queries the response was YES.
[2024-03-12 01:09:58,121 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 222016 conditions, 146711 events. 51883/146711 cut-off events. For 15094/28208 co-relation queries the response was YES. Maximal size of possible extension queue 3112. Compared 2013095 event pairs, 29580 based on Foata normal form. 3730/136571 useless extension candidates. Maximal degree in co-relation 176681. Up to 48608 conditions per place. 
[2024-03-12 01:09:58,716 INFO  L140   encePairwiseOnDemand]: 173/184 looper letters, 37 selfloop transitions, 7 changer transitions 1/197 dead transitions.
[2024-03-12 01:09:58,717 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 197 transitions, 537 flow
[2024-03-12 01:09:58,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:09:58,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:09:58,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions.
[2024-03-12 01:09:58,718 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9184782608695652
[2024-03-12 01:09:58,718 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 507 transitions.
[2024-03-12 01:09:58,718 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions.
[2024-03-12 01:09:58,718 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:09:58,718 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions.
[2024-03-12 01:09:58,719 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:58,719 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:58,719 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:58,719 INFO  L175             Difference]: Start difference. First operand has 187 places, 184 transitions, 423 flow. Second operand 3 states and 507 transitions.
[2024-03-12 01:09:58,720 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 197 transitions, 537 flow
[2024-03-12 01:09:58,746 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 197 transitions, 537 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:09:58,748 INFO  L231             Difference]: Finished difference. Result has 191 places, 186 transitions, 469 flow
[2024-03-12 01:09:58,748 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=191, PETRI_TRANSITIONS=186}
[2024-03-12 01:09:58,748 INFO  L281   CegarLoopForPetriNet]: 187 programPoint places, 4 predicate places.
[2024-03-12 01:09:58,749 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 186 transitions, 469 flow
[2024-03-12 01:09:58,749 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:58,749 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:58,749 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:09:58,749 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-03-12 01:09:58,749 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:09:58,749 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:58,749 INFO  L85        PathProgramCache]: Analyzing trace with hash 2121343792, now seen corresponding path program 1 times
[2024-03-12 01:09:58,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:58,749 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273643455]
[2024-03-12 01:09:58,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:58,750 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:58,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:58,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:09:58,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:09:58,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273643455]
[2024-03-12 01:09:58,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273643455] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:09:58,785 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:09:58,785 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:09:58,785 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236998084]
[2024-03-12 01:09:58,785 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:09:58,785 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:09:58,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:09:58,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:09:58,786 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:09:58,854 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 184
[2024-03-12 01:09:58,854 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 186 transitions, 469 flow. Second operand  has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:09:58,854 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:09:58,855 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 184
[2024-03-12 01:09:58,855 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:10:21,210 INFO  L124   PetriNetUnfolderBase]: 56512/185999 cut-off events.
[2024-03-12 01:10:21,210 INFO  L125   PetriNetUnfolderBase]: For 14079/14858 co-relation queries the response was YES.
[2024-03-12 01:10:22,163 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 281841 conditions, 185999 events. 56512/185999 cut-off events. For 14079/14858 co-relation queries the response was YES. Maximal size of possible extension queue 3453. Compared 2770356 event pairs, 39436 based on Foata normal form. 1/159996 useless extension candidates. Maximal degree in co-relation 152584. Up to 58232 conditions per place. 
[2024-03-12 01:10:23,066 INFO  L140   encePairwiseOnDemand]: 176/184 looper letters, 32 selfloop transitions, 2 changer transitions 5/194 dead transitions.
[2024-03-12 01:10:23,066 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 194 transitions, 563 flow
[2024-03-12 01:10:23,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:10:23,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:10:23,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 940 transitions.
[2024-03-12 01:10:23,068 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8514492753623188
[2024-03-12 01:10:23,068 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 940 transitions.
[2024-03-12 01:10:23,068 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 940 transitions.
[2024-03-12 01:10:23,069 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:10:23,069 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 940 transitions.
[2024-03-12 01:10:23,070 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:10:23,070 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:10:23,071 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:10:23,071 INFO  L175             Difference]: Start difference. First operand has 191 places, 186 transitions, 469 flow. Second operand 6 states and 940 transitions.
[2024-03-12 01:10:23,071 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 194 transitions, 563 flow
[2024-03-12 01:10:24,907 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 194 transitions, 549 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:10:24,909 INFO  L231             Difference]: Finished difference. Result has 197 places, 187 transitions, 477 flow
[2024-03-12 01:10:24,910 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=197, PETRI_TRANSITIONS=187}
[2024-03-12 01:10:24,910 INFO  L281   CegarLoopForPetriNet]: 187 programPoint places, 10 predicate places.
[2024-03-12 01:10:24,910 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 187 transitions, 477 flow
[2024-03-12 01:10:24,910 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:10:24,910 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:10:24,910 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:10:24,911 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-03-12 01:10:24,911 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:10:24,911 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:10:24,911 INFO  L85        PathProgramCache]: Analyzing trace with hash 2024147008, now seen corresponding path program 1 times
[2024-03-12 01:10:24,911 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:10:24,911 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750300071]
[2024-03-12 01:10:24,911 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:10:24,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:10:24,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:10:25,024 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:10:25,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:10:25,024 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750300071]
[2024-03-12 01:10:25,025 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750300071] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:10:25,025 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:10:25,025 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:10:25,025 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835803804]
[2024-03-12 01:10:25,025 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:10:25,025 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:10:25,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:10:25,026 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:10:25,026 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:10:25,174 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 184
[2024-03-12 01:10:25,174 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 187 transitions, 477 flow. Second operand  has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:10:25,174 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:10:25,174 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 184
[2024-03-12 01:10:25,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:10:47,865 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][68], [8#L1019-5true, Black: 190#true, 50#L1037true, 152#L1020-3true, Black: 200#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0NotInUse, threadThread5of5ForFork0NotInUse, 196#true, 92#L1019-5true])
[2024-03-12 01:10:47,865 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is cut-off event
[2024-03-12 01:10:47,865 INFO  L297   olderBase$Statistics]:   existing Event has 124 ancestors and is cut-off event
[2024-03-12 01:10:47,865 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-12 01:10:47,865 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is cut-off event
[2024-03-12 01:10:48,879 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_9|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~breads_total~0#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~t~0#1.base][86], [8#L1019-5true, Black: 190#true, 133#L1019-5true, 152#L1020-3true, Black: 200#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 136#L1020-3true, 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 82#ULTIMATE.startFINALtrue, threadThread5of5ForFork0InUse, 196#true, 92#L1019-5true])
[2024-03-12 01:10:48,880 INFO  L294   olderBase$Statistics]: this new event has 190 ancestors and is cut-off event
[2024-03-12 01:10:48,880 INFO  L297   olderBase$Statistics]:   existing Event has 190 ancestors and is cut-off event
[2024-03-12 01:10:48,880 INFO  L297   olderBase$Statistics]:   existing Event has 190 ancestors and is cut-off event
[2024-03-12 01:10:48,880 INFO  L297   olderBase$Statistics]:   existing Event has 190 ancestors and is cut-off event
[2024-03-12 01:10:57,808 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_9|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~breads_total~0#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~t~0#1.base][86], [8#L1019-5true, Black: 190#true, 59#L1018-3true, 41#L1018-3true, Black: 200#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1020-3true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true])
[2024-03-12 01:10:57,809 INFO  L294   olderBase$Statistics]: this new event has 208 ancestors and is cut-off event
[2024-03-12 01:10:57,809 INFO  L297   olderBase$Statistics]:   existing Event has 145 ancestors and is cut-off event
[2024-03-12 01:10:57,809 INFO  L297   olderBase$Statistics]:   existing Event has 208 ancestors and is cut-off event
[2024-03-12 01:10:57,809 INFO  L297   olderBase$Statistics]:   existing Event has 145 ancestors and is cut-off event
[2024-03-12 01:10:57,826 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][68], [8#L1019-5true, Black: 190#true, 50#L1037true, 152#L1020-3true, Black: 200#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 13#$Ultimate##0true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 196#true, 92#L1019-5true])
[2024-03-12 01:10:57,827 INFO  L294   olderBase$Statistics]: this new event has 208 ancestors and is cut-off event
[2024-03-12 01:10:57,827 INFO  L297   olderBase$Statistics]:   existing Event has 208 ancestors and is cut-off event
[2024-03-12 01:10:57,827 INFO  L297   olderBase$Statistics]:   existing Event has 145 ancestors and is cut-off event
[2024-03-12 01:10:57,827 INFO  L297   olderBase$Statistics]:   existing Event has 208 ancestors and is cut-off event
[2024-03-12 01:11:01,732 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_9|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~breads_total~0#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~t~0#1.base][86], [120#L1020-3true, Black: 190#true, 42#L1019-5true, 37#$Ultimate##0true, Black: 200#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1020-3true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true])
[2024-03-12 01:11:01,733 INFO  L294   olderBase$Statistics]: this new event has 216 ancestors and is cut-off event
[2024-03-12 01:11:01,733 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is cut-off event
[2024-03-12 01:11:01,733 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is cut-off event
[2024-03-12 01:11:01,733 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is cut-off event
[2024-03-12 01:11:02,131 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_9|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~breads_total~0#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~t~0#1.base][86], [Black: 190#true, 8#L1019-5true, 41#L1018-3true, 152#L1020-3true, Black: 200#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1020-3true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true])
[2024-03-12 01:11:02,132 INFO  L294   olderBase$Statistics]: this new event has 218 ancestors and is cut-off event
[2024-03-12 01:11:02,132 INFO  L297   olderBase$Statistics]:   existing Event has 218 ancestors and is cut-off event
[2024-03-12 01:11:02,132 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-12 01:11:02,132 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-12 01:11:02,289 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_9|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~breads_total~0#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~t~0#1.base][86], [120#L1020-3true, 111#L1018-3true, 42#L1019-5true, Black: 190#true, Black: 200#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1020-3true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true])
[2024-03-12 01:11:02,290 INFO  L294   olderBase$Statistics]: this new event has 218 ancestors and is cut-off event
[2024-03-12 01:11:02,290 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-12 01:11:02,290 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-12 01:11:02,290 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-12 01:11:03,683 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_9|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~breads_total~0#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~t~0#1.base][86], [120#L1020-3true, 8#L1019-5true, Black: 190#true, 152#L1020-3true, Black: 200#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true, 92#L1019-5true])
[2024-03-12 01:11:03,683 INFO  L294   olderBase$Statistics]: this new event has 224 ancestors and is cut-off event
[2024-03-12 01:11:03,683 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-12 01:11:03,683 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-12 01:11:03,683 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-12 01:11:04,380 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_~breads_total~0#1=|v_ULTIMATE.start_main_~breads_total~0#1_9|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~breads_total~0#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~t~0#1.base][86], [120#L1020-3true, Black: 190#true, 42#L1019-5true, 36#L1020-3true, Black: 200#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1020-3true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 82#ULTIMATE.startFINALtrue, 196#true])
[2024-03-12 01:11:04,380 INFO  L294   olderBase$Statistics]: this new event has 228 ancestors and is cut-off event
[2024-03-12 01:11:04,380 INFO  L297   olderBase$Statistics]:   existing Event has 165 ancestors and is cut-off event
[2024-03-12 01:11:04,381 INFO  L297   olderBase$Statistics]:   existing Event has 165 ancestors and is cut-off event
[2024-03-12 01:11:04,381 INFO  L297   olderBase$Statistics]:   existing Event has 165 ancestors and is cut-off event
[2024-03-12 01:11:06,239 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] L1036-1-->L1037: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][68], [42#L1019-5true, 8#L1019-5true, Black: 190#true, 50#L1037true, Black: 200#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0NotInUse, threadThread5of5ForFork0NotInUse, 196#true, 92#L1019-5true])
[2024-03-12 01:11:06,239 INFO  L294   olderBase$Statistics]: this new event has 246 ancestors and is cut-off event
[2024-03-12 01:11:06,239 INFO  L297   olderBase$Statistics]:   existing Event has 120 ancestors and is cut-off event
[2024-03-12 01:11:06,239 INFO  L297   olderBase$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-12 01:11:06,239 INFO  L297   olderBase$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-12 01:11:10,400 INFO  L124   PetriNetUnfolderBase]: 118478/344314 cut-off events.
[2024-03-12 01:11:10,400 INFO  L125   PetriNetUnfolderBase]: For 15389/15543 co-relation queries the response was YES.
[2024-03-12 01:11:12,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 529896 conditions, 344314 events. 118478/344314 cut-off events. For 15389/15543 co-relation queries the response was YES. Maximal size of possible extension queue 6260. Compared 5279882 event pairs, 95879 based on Foata normal form. 0/294188 useless extension candidates. Maximal degree in co-relation 529794. Up to 115602 conditions per place. 
[2024-03-12 01:11:14,079 INFO  L140   encePairwiseOnDemand]: 178/184 looper letters, 81 selfloop transitions, 5 changer transitions 0/226 dead transitions.
[2024-03-12 01:11:14,079 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 226 transitions, 727 flow
[2024-03-12 01:11:14,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:11:14,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:11:14,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions.
[2024-03-12 01:11:14,081 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8115942028985508
[2024-03-12 01:11:14,081 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 896 transitions.
[2024-03-12 01:11:14,081 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 896 transitions.
[2024-03-12 01:11:14,081 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:11:14,081 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 896 transitions.
[2024-03-12 01:11:14,082 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 149.33333333333334) internal successors, (896), 6 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:14,083 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:14,083 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:14,083 INFO  L175             Difference]: Start difference. First operand has 197 places, 187 transitions, 477 flow. Second operand 6 states and 896 transitions.
[2024-03-12 01:11:14,083 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 226 transitions, 727 flow
[2024-03-12 01:11:15,433 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 226 transitions, 715 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 01:11:15,435 INFO  L231             Difference]: Finished difference. Result has 194 places, 186 transitions, 473 flow
[2024-03-12 01:11:15,435 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=473, PETRI_PLACES=194, PETRI_TRANSITIONS=186}
[2024-03-12 01:11:15,436 INFO  L281   CegarLoopForPetriNet]: 187 programPoint places, 7 predicate places.
[2024-03-12 01:11:15,436 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 186 transitions, 473 flow
[2024-03-12 01:11:15,436 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:15,436 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:11:15,436 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:11:15,437 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-03-12 01:11:15,437 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-12 01:11:15,437 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:11:15,437 INFO  L85        PathProgramCache]: Analyzing trace with hash 1713456712, now seen corresponding path program 1 times
[2024-03-12 01:11:15,437 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:11:15,437 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690300124]
[2024-03-12 01:11:15,437 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:11:15,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:11:15,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:11:15,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:11:15,463 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:11:15,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690300124]
[2024-03-12 01:11:15,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690300124] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:11:15,463 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:11:15,463 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:11:15,463 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659423212]
[2024-03-12 01:11:15,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:11:15,464 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:11:15,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:15,464 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:11:15,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:11:15,502 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 184
[2024-03-12 01:11:15,503 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 186 transitions, 473 flow. Second operand  has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:11:15,503 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:15,503 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 184
[2024-03-12 01:11:15,503 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
