./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-index-bitmask-race.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-index-bitmask-race.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 6c4ed3e2a82a65e4e5822106607d69caac9bb1b03d24f9127c093cc95d8a8150
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-02-28 20:19:45,457 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 20:19:45,493 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 20:19:45,497 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-02-28 20:19:45,497 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-02-28 20:19:45,512 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 20:19:45,512 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 20:19:45,512 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 20:19:45,513 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 20:19:45,513 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 20:19:45,514 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 20:19:45,514 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 20:19:45,514 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-02-28 20:19:45,514 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 20:19:45,515 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 20:19:45,515 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-02-28 20:19:45,515 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 20:19:45,516 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 20:19:45,516 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 20:19:45,516 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 20:19:45,516 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 20:19:45,517 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 20:19:45,517 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 20:19:45,518 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-02-28 20:19:45,518 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-02-28 20:19:45,518 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 20:19:45,518 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-02-28 20:19:45,519 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 20:19:45,519 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 20:19:45,519 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 20:19:45,519 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 20:19:45,520 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 20:19:45,520 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 20:19:45,520 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-02-28 20:19:45,520 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 20:19:45,520 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 20:19:45,524 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-02-28 20:19:45,525 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 20:19:45,525 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 20:19:45,525 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 20:19:45,525 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 20:19:45,526 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 -> 6c4ed3e2a82a65e4e5822106607d69caac9bb1b03d24f9127c093cc95d8a8150
[2024-02-28 20:19:45,694 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 20:19:45,711 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 20:19:45,713 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 20:19:45,714 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-02-28 20:19:45,715 INFO  L274        PluginConnector]: CDTParser initialized
[2024-02-28 20:19:45,715 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-02-28 20:19:46,747 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 20:19:46,956 INFO  L384              CDTParser]: Found 1 translation units.
[2024-02-28 20:19:46,956 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-02-28 20:19:46,967 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/8fbe2117d/48b79f06e130475b99c47f0093bc05f0/FLAG443c21af7
[2024-02-28 20:19:46,979 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/8fbe2117d/48b79f06e130475b99c47f0093bc05f0
[2024-02-28 20:19:46,980 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 20:19:46,981 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 20:19:46,982 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 20:19:46,983 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 20:19:46,986 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 20:19:46,987 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 08:19:46" (1/1) ...
[2024-02-28 20:19:46,988 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cead842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:46, skipping insertion in model container
[2024-02-28 20:19:46,988 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 08:19:46" (1/1) ...
[2024-02-28 20:19:47,025 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-02-28 20:19:47,304 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 20:19:47,311 INFO  L202         MainTranslator]: Completed pre-run
[2024-02-28 20:19:47,343 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 20:19:47,373 WARN  L675               CHandler]: The function ffs is called, but not defined or handled by StandardFunctionHandler.
[2024-02-28 20:19:47,379 INFO  L206         MainTranslator]: Completed translation
[2024-02-28 20:19:47,380 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47 WrapperNode
[2024-02-28 20:19:47,380 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 20:19:47,381 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 20:19:47,381 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 20:19:47,381 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 20:19:47,386 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (1/1) ...
[2024-02-28 20:19:47,400 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (1/1) ...
[2024-02-28 20:19:47,422 INFO  L138                Inliner]: procedures = 277, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119
[2024-02-28 20:19:47,422 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 20:19:47,423 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 20:19:47,423 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 20:19:47,423 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 20:19:47,430 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (1/1) ...
[2024-02-28 20:19:47,430 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (1/1) ...
[2024-02-28 20:19:47,434 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (1/1) ...
[2024-02-28 20:19:47,434 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (1/1) ...
[2024-02-28 20:19:47,442 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (1/1) ...
[2024-02-28 20:19:47,444 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (1/1) ...
[2024-02-28 20:19:47,446 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (1/1) ...
[2024-02-28 20:19:47,447 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (1/1) ...
[2024-02-28 20:19:47,449 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 20:19:47,450 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 20:19:47,450 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 20:19:47,450 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-02-28 20:19:47,451 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (1/1) ...
[2024-02-28 20:19:47,456 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 20:19:47,463 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:19:47,474 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-02-28 20:19:47,477 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-02-28 20:19:47,502 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 20:19:47,502 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 20:19:47,503 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 20:19:47,503 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 20:19:47,503 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 20:19:47,503 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 20:19:47,503 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 20:19:47,503 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-02-28 20:19:47,503 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 20:19:47,503 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 20:19:47,503 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 20:19:47,503 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 20:19:47,504 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-02-28 20:19:47,626 INFO  L241             CfgBuilder]: Building ICFG
[2024-02-28 20:19:47,627 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 20:19:47,887 INFO  L282             CfgBuilder]: Performing block encoding
[2024-02-28 20:19:47,899 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 20:19:47,899 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 20:19:47,900 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 08:19:47 BoogieIcfgContainer
[2024-02-28 20:19:47,900 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 20:19:47,902 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 20:19:47,902 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 20:19:47,905 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-02-28 20:19:47,905 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 08:19:46" (1/3) ...
[2024-02-28 20:19:47,906 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc63344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 08:19:47, skipping insertion in model container
[2024-02-28 20:19:47,906 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:19:47" (2/3) ...
[2024-02-28 20:19:47,906 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc63344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 08:19:47, skipping insertion in model container
[2024-02-28 20:19:47,906 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 08:19:47" (3/3) ...
[2024-02-28 20:19:47,907 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2024-02-28 20:19:47,915 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 20:19:47,926 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 20:19:47,926 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-02-28 20:19:47,926 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 20:19:47,976 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 20:19:48,004 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 373 flow
[2024-02-28 20:19:48,073 INFO  L124   PetriNetUnfolderBase]: 16/268 cut-off events.
[2024-02-28 20:19:48,073 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-02-28 20:19:48,079 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 273 conditions, 268 events. 16/268 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 606 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 136. Up to 6 conditions per place. 
[2024-02-28 20:19:48,079 INFO  L82        GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 373 flow
[2024-02-28 20:19:48,084 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 175 places, 183 transitions, 373 flow
[2024-02-28 20:19:48,091 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 20:19:48,097 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;@4744a2aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 20:19:48,097 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-02-28 20:19:48,102 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 20:19:48,102 INFO  L124   PetriNetUnfolderBase]: 2/34 cut-off events.
[2024-02-28 20:19:48,102 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 20:19:48,102 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:48,103 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]
[2024-02-28 20:19:48,103 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:48,107 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:48,108 INFO  L85        PathProgramCache]: Analyzing trace with hash -181513379, now seen corresponding path program 1 times
[2024-02-28 20:19:48,114 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:48,114 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100429792]
[2024-02-28 20:19:48,114 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:48,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:48,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:48,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:48,277 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:48,277 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100429792]
[2024-02-28 20:19:48,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100429792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:48,278 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:48,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:19:48,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264947184]
[2024-02-28 20:19:48,280 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:48,286 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:19:48,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:48,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:19:48,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:19:48,330 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-02-28 20:19:48,333 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 183 transitions, 373 flow. Second operand  has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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-02-28 20:19:48,333 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:48,334 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-02-28 20:19:48,334 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:48,396 INFO  L124   PetriNetUnfolderBase]: 18/349 cut-off events.
[2024-02-28 20:19:48,396 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-02-28 20:19:48,398 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 371 conditions, 349 events. 18/349 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 927 event pairs, 2 based on Foata normal form. 6/304 useless extension candidates. Maximal degree in co-relation 229. Up to 15 conditions per place. 
[2024-02-28 20:19:48,400 INFO  L140   encePairwiseOnDemand]: 176/183 looper letters, 8 selfloop transitions, 2 changer transitions 2/178 dead transitions.
[2024-02-28 20:19:48,400 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 178 transitions, 383 flow
[2024-02-28 20:19:48,401 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:19:48,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:19:48,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions.
[2024-02-28 20:19:48,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9453551912568307
[2024-02-28 20:19:48,412 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 519 transitions.
[2024-02-28 20:19:48,412 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions.
[2024-02-28 20:19:48,413 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:48,415 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions.
[2024-02-28 20:19:48,419 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 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-02-28 20:19:48,423 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:19:48,423 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:19:48,425 INFO  L175             Difference]: Start difference. First operand has 175 places, 183 transitions, 373 flow. Second operand 3 states and 519 transitions.
[2024-02-28 20:19:48,425 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 178 transitions, 383 flow
[2024-02-28 20:19:48,428 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 178 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:19:48,431 INFO  L231             Difference]: Finished difference. Result has 176 places, 176 transitions, 363 flow
[2024-02-28 20:19:48,433 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=176, PETRI_TRANSITIONS=176}
[2024-02-28 20:19:48,436 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 1 predicate places.
[2024-02-28 20:19:48,436 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 176 transitions, 363 flow
[2024-02-28 20:19:48,436 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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-02-28 20:19:48,437 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:48,437 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-02-28 20:19:48,437 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 20:19:48,437 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:48,438 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:48,438 INFO  L85        PathProgramCache]: Analyzing trace with hash -1545155910, now seen corresponding path program 1 times
[2024-02-28 20:19:48,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:48,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382407310]
[2024-02-28 20:19:48,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:48,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:48,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:48,501 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:48,501 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:48,501 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382407310]
[2024-02-28 20:19:48,501 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382407310] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:48,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:48,502 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:19:48,502 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334823869]
[2024-02-28 20:19:48,502 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:48,503 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:19:48,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:48,504 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:19:48,504 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:19:48,525 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 183
[2024-02-28 20:19:48,525 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 176 transitions, 363 flow. Second operand  has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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-02-28 20:19:48,526 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:48,526 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 183
[2024-02-28 20:19:48,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:48,580 INFO  L124   PetriNetUnfolderBase]: 46/496 cut-off events.
[2024-02-28 20:19:48,580 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-02-28 20:19:48,582 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 559 conditions, 496 events. 46/496 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2039 event pairs, 7 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 520. Up to 36 conditions per place. 
[2024-02-28 20:19:48,583 INFO  L140   encePairwiseOnDemand]: 172/183 looper letters, 13 selfloop transitions, 8 changer transitions 0/184 dead transitions.
[2024-02-28 20:19:48,584 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 184 transitions, 421 flow
[2024-02-28 20:19:48,584 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:19:48,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:19:48,585 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions.
[2024-02-28 20:19:48,586 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9508196721311475
[2024-02-28 20:19:48,587 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 522 transitions.
[2024-02-28 20:19:48,587 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions.
[2024-02-28 20:19:48,587 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:48,587 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions.
[2024-02-28 20:19:48,588 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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-02-28 20:19:48,590 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:19:48,590 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:19:48,590 INFO  L175             Difference]: Start difference. First operand has 176 places, 176 transitions, 363 flow. Second operand 3 states and 522 transitions.
[2024-02-28 20:19:48,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 184 transitions, 421 flow
[2024-02-28 20:19:48,592 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 184 transitions, 417 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:19:48,594 INFO  L231             Difference]: Finished difference. Result has 176 places, 184 transitions, 429 flow
[2024-02-28 20:19:48,594 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=176, PETRI_TRANSITIONS=184}
[2024-02-28 20:19:48,595 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 1 predicate places.
[2024-02-28 20:19:48,595 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 184 transitions, 429 flow
[2024-02-28 20:19:48,596 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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-02-28 20:19:48,596 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:48,596 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]
[2024-02-28 20:19:48,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 20:19:48,596 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:48,597 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:48,597 INFO  L85        PathProgramCache]: Analyzing trace with hash 945540951, now seen corresponding path program 1 times
[2024-02-28 20:19:48,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:48,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388135100]
[2024-02-28 20:19:48,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:48,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:48,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:48,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:48,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:48,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388135100]
[2024-02-28 20:19:48,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388135100] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:48,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:48,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:19:48,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339248937]
[2024-02-28 20:19:48,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:48,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-02-28 20:19:48,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:48,713 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-02-28 20:19:48,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-02-28 20:19:48,788 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 183
[2024-02-28 20:19:48,789 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 184 transitions, 429 flow. Second operand  has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 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-02-28 20:19:48,790 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:48,790 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 183
[2024-02-28 20:19:48,790 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:48,850 INFO  L124   PetriNetUnfolderBase]: 46/507 cut-off events.
[2024-02-28 20:19:48,850 INFO  L125   PetriNetUnfolderBase]: For 18/25 co-relation queries the response was YES.
[2024-02-28 20:19:48,851 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 608 conditions, 507 events. 46/507 cut-off events. For 18/25 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1996 event pairs, 6 based on Foata normal form. 2/448 useless extension candidates. Maximal degree in co-relation 434. Up to 36 conditions per place. 
[2024-02-28 20:19:48,852 INFO  L140   encePairwiseOnDemand]: 175/183 looper letters, 11 selfloop transitions, 6 changer transitions 1/189 dead transitions.
[2024-02-28 20:19:48,852 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 189 transitions, 475 flow
[2024-02-28 20:19:48,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:19:48,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:19:48,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1015 transitions.
[2024-02-28 20:19:48,855 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.924408014571949
[2024-02-28 20:19:48,855 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1015 transitions.
[2024-02-28 20:19:48,855 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1015 transitions.
[2024-02-28 20:19:48,856 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:48,856 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1015 transitions.
[2024-02-28 20:19:48,858 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 169.16666666666666) internal successors, (1015), 6 states have internal predecessors, (1015), 0 states have call successors, (0), 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-02-28 20:19:48,860 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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-02-28 20:19:48,861 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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-02-28 20:19:48,861 INFO  L175             Difference]: Start difference. First operand has 176 places, 184 transitions, 429 flow. Second operand 6 states and 1015 transitions.
[2024-02-28 20:19:48,861 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 189 transitions, 475 flow
[2024-02-28 20:19:48,863 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 189 transitions, 459 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:19:48,865 INFO  L231             Difference]: Finished difference. Result has 183 places, 188 transitions, 455 flow
[2024-02-28 20:19:48,865 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=183, PETRI_TRANSITIONS=188}
[2024-02-28 20:19:48,866 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 8 predicate places.
[2024-02-28 20:19:48,866 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 188 transitions, 455 flow
[2024-02-28 20:19:48,867 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 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-02-28 20:19:48,867 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:48,867 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]
[2024-02-28 20:19:48,867 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 20:19:48,867 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:48,868 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:48,868 INFO  L85        PathProgramCache]: Analyzing trace with hash 338203420, now seen corresponding path program 1 times
[2024-02-28 20:19:48,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:48,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742373726]
[2024-02-28 20:19:48,868 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:48,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:48,887 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:49,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:49,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:49,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742373726]
[2024-02-28 20:19:49,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742373726] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:49,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:49,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:19:49,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066139351]
[2024-02-28 20:19:49,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:49,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:19:49,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:49,136 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:19:49,136 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:19:49,341 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183
[2024-02-28 20:19:49,342 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 188 transitions, 455 flow. Second operand  has 6 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 0 states have call successors, (0), 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-02-28 20:19:49,342 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:49,342 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183
[2024-02-28 20:19:49,342 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:49,512 INFO  L124   PetriNetUnfolderBase]: 212/1367 cut-off events.
[2024-02-28 20:19:49,513 INFO  L125   PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES.
[2024-02-28 20:19:49,515 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 1367 events. 212/1367 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 9365 event pairs, 15 based on Foata normal form. 1/1201 useless extension candidates. Maximal degree in co-relation 1687. Up to 195 conditions per place. 
[2024-02-28 20:19:49,518 INFO  L140   encePairwiseOnDemand]: 160/183 looper letters, 38 selfloop transitions, 29 changer transitions 0/227 dead transitions.
[2024-02-28 20:19:49,518 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 227 transitions, 670 flow
[2024-02-28 20:19:49,519 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:19:49,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:19:49,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 976 transitions.
[2024-02-28 20:19:49,521 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8888888888888888
[2024-02-28 20:19:49,521 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 976 transitions.
[2024-02-28 20:19:49,521 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 976 transitions.
[2024-02-28 20:19:49,521 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:49,521 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 976 transitions.
[2024-02-28 20:19:49,523 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 162.66666666666666) internal successors, (976), 6 states have internal predecessors, (976), 0 states have call successors, (0), 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-02-28 20:19:49,525 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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-02-28 20:19:49,526 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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-02-28 20:19:49,526 INFO  L175             Difference]: Start difference. First operand has 183 places, 188 transitions, 455 flow. Second operand 6 states and 976 transitions.
[2024-02-28 20:19:49,526 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 227 transitions, 670 flow
[2024-02-28 20:19:49,528 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 227 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 20:19:49,531 INFO  L231             Difference]: Finished difference. Result has 192 places, 217 transitions, 673 flow
[2024-02-28 20:19:49,531 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=673, PETRI_PLACES=192, PETRI_TRANSITIONS=217}
[2024-02-28 20:19:49,532 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 17 predicate places.
[2024-02-28 20:19:49,532 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 217 transitions, 673 flow
[2024-02-28 20:19:49,532 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 0 states have call successors, (0), 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-02-28 20:19:49,533 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:49,533 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]
[2024-02-28 20:19:49,533 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 20:19:49,533 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:49,534 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:49,534 INFO  L85        PathProgramCache]: Analyzing trace with hash -641227376, now seen corresponding path program 1 times
[2024-02-28 20:19:49,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:49,534 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044326348]
[2024-02-28 20:19:49,534 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:49,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:49,548 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:49,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:49,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:49,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044326348]
[2024-02-28 20:19:49,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044326348] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:49,566 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:49,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:19:49,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82482411]
[2024-02-28 20:19:49,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:49,567 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:19:49,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:49,567 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:19:49,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:19:49,578 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 170 out of 183
[2024-02-28 20:19:49,578 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 217 transitions, 673 flow. Second operand  has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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-02-28 20:19:49,579 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:49,579 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 183
[2024-02-28 20:19:49,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:49,680 INFO  L124   PetriNetUnfolderBase]: 178/1305 cut-off events.
[2024-02-28 20:19:49,680 INFO  L125   PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES.
[2024-02-28 20:19:49,682 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 1305 events. 178/1305 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 8975 event pairs, 11 based on Foata normal form. 0/1162 useless extension candidates. Maximal degree in co-relation 1641. Up to 106 conditions per place. 
[2024-02-28 20:19:49,685 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 7 selfloop transitions, 2 changer transitions 4/217 dead transitions.
[2024-02-28 20:19:49,685 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 217 transitions, 691 flow
[2024-02-28 20:19:49,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:19:49,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:19:49,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions.
[2024-02-28 20:19:49,687 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9489981785063752
[2024-02-28 20:19:49,687 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 521 transitions.
[2024-02-28 20:19:49,687 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions.
[2024-02-28 20:19:49,687 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:49,687 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions.
[2024-02-28 20:19:49,689 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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-02-28 20:19:49,689 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:19:49,690 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:19:49,690 INFO  L175             Difference]: Start difference. First operand has 192 places, 217 transitions, 673 flow. Second operand 3 states and 521 transitions.
[2024-02-28 20:19:49,690 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 217 transitions, 691 flow
[2024-02-28 20:19:49,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 217 transitions, 691 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:19:49,696 INFO  L231             Difference]: Finished difference. Result has 193 places, 213 transitions, 659 flow
[2024-02-28 20:19:49,697 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=193, PETRI_TRANSITIONS=213}
[2024-02-28 20:19:49,697 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 18 predicate places.
[2024-02-28 20:19:49,697 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 213 transitions, 659 flow
[2024-02-28 20:19:49,698 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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-02-28 20:19:49,698 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:49,698 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-02-28 20:19:49,698 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 20:19:49,698 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:49,698 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:49,699 INFO  L85        PathProgramCache]: Analyzing trace with hash 438199009, now seen corresponding path program 1 times
[2024-02-28 20:19:49,699 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:49,699 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792734042]
[2024-02-28 20:19:49,699 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:49,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:49,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:49,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:49,759 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:49,759 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792734042]
[2024-02-28 20:19:49,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792734042] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:49,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:49,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:19:49,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425316177]
[2024-02-28 20:19:49,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:49,760 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:19:49,760 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:49,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:19:49,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:19:49,805 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-02-28 20:19:49,806 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 213 transitions, 659 flow. Second operand  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 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-02-28 20:19:49,806 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:49,806 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-02-28 20:19:49,806 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:49,921 INFO  L124   PetriNetUnfolderBase]: 166/1202 cut-off events.
[2024-02-28 20:19:49,921 INFO  L125   PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES.
[2024-02-28 20:19:49,924 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 1202 events. 166/1202 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8044 event pairs, 15 based on Foata normal form. 1/1076 useless extension candidates. Maximal degree in co-relation 1666. Up to 94 conditions per place. 
[2024-02-28 20:19:49,926 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 4 changer transitions 0/218 dead transitions.
[2024-02-28 20:19:49,926 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 218 transitions, 701 flow
[2024-02-28 20:19:49,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:19:49,927 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:19:49,928 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions.
[2024-02-28 20:19:49,929 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9412568306010929
[2024-02-28 20:19:49,929 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 689 transitions.
[2024-02-28 20:19:49,929 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 689 transitions.
[2024-02-28 20:19:49,929 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:49,929 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 689 transitions.
[2024-02-28 20:19:49,931 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 0 states have call successors, (0), 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-02-28 20:19:49,932 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:19:49,933 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:19:49,933 INFO  L175             Difference]: Start difference. First operand has 193 places, 213 transitions, 659 flow. Second operand 4 states and 689 transitions.
[2024-02-28 20:19:49,933 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 218 transitions, 701 flow
[2024-02-28 20:19:49,937 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 218 transitions, 689 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-02-28 20:19:49,939 INFO  L231             Difference]: Finished difference. Result has 191 places, 216 transitions, 672 flow
[2024-02-28 20:19:49,939 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=672, PETRI_PLACES=191, PETRI_TRANSITIONS=216}
[2024-02-28 20:19:49,942 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 16 predicate places.
[2024-02-28 20:19:49,942 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 216 transitions, 672 flow
[2024-02-28 20:19:49,942 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 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-02-28 20:19:49,942 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:49,942 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-02-28 20:19:49,942 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 20:19:49,943 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:49,943 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:49,943 INFO  L85        PathProgramCache]: Analyzing trace with hash 1118757527, now seen corresponding path program 1 times
[2024-02-28 20:19:49,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:49,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926443193]
[2024-02-28 20:19:49,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:49,944 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:49,955 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:50,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:50,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:50,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926443193]
[2024-02-28 20:19:50,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926443193] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:50,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:50,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:19:50,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304145294]
[2024-02-28 20:19:50,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:50,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:19:50,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:50,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:19:50,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:19:50,086 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-02-28 20:19:50,087 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 216 transitions, 672 flow. Second operand  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 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-02-28 20:19:50,087 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:50,087 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-02-28 20:19:50,087 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:50,197 INFO  L124   PetriNetUnfolderBase]: 165/1200 cut-off events.
[2024-02-28 20:19:50,197 INFO  L125   PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES.
[2024-02-28 20:19:50,199 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 1200 events. 165/1200 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8030 event pairs, 15 based on Foata normal form. 1/1071 useless extension candidates. Maximal degree in co-relation 1666. Up to 94 conditions per place. 
[2024-02-28 20:19:50,202 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 11 selfloop transitions, 4 changer transitions 0/217 dead transitions.
[2024-02-28 20:19:50,202 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 217 transitions, 704 flow
[2024-02-28 20:19:50,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:19:50,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:19:50,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 688 transitions.
[2024-02-28 20:19:50,204 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9398907103825137
[2024-02-28 20:19:50,204 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 688 transitions.
[2024-02-28 20:19:50,204 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 688 transitions.
[2024-02-28 20:19:50,204 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:50,204 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 688 transitions.
[2024-02-28 20:19:50,206 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 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-02-28 20:19:50,207 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:19:50,207 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:19:50,207 INFO  L175             Difference]: Start difference. First operand has 191 places, 216 transitions, 672 flow. Second operand 4 states and 688 transitions.
[2024-02-28 20:19:50,207 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 217 transitions, 704 flow
[2024-02-28 20:19:50,210 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 217 transitions, 704 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:19:50,212 INFO  L231             Difference]: Finished difference. Result has 196 places, 217 transitions, 691 flow
[2024-02-28 20:19:50,212 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=691, PETRI_PLACES=196, PETRI_TRANSITIONS=217}
[2024-02-28 20:19:50,213 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 21 predicate places.
[2024-02-28 20:19:50,213 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 217 transitions, 691 flow
[2024-02-28 20:19:50,213 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 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-02-28 20:19:50,213 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:50,213 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]
[2024-02-28 20:19:50,213 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 20:19:50,214 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:50,214 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:50,214 INFO  L85        PathProgramCache]: Analyzing trace with hash -934862560, now seen corresponding path program 1 times
[2024-02-28 20:19:50,214 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:50,214 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387595497]
[2024-02-28 20:19:50,214 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:50,215 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:50,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:50,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:50,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:50,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387595497]
[2024-02-28 20:19:50,272 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387595497] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:50,272 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:50,272 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:19:50,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49175909]
[2024-02-28 20:19:50,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:50,273 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:19:50,273 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:50,274 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:19:50,274 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:19:50,320 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-02-28 20:19:50,321 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 217 transitions, 691 flow. Second operand  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 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-02-28 20:19:50,321 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:50,321 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-02-28 20:19:50,321 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:50,427 INFO  L124   PetriNetUnfolderBase]: 164/1198 cut-off events.
[2024-02-28 20:19:50,427 INFO  L125   PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES.
[2024-02-28 20:19:50,429 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 1198 events. 164/1198 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8060 event pairs, 15 based on Foata normal form. 1/1075 useless extension candidates. Maximal degree in co-relation 1730. Up to 94 conditions per place. 
[2024-02-28 20:19:50,431 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 4 changer transitions 0/218 dead transitions.
[2024-02-28 20:19:50,432 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 218 transitions, 725 flow
[2024-02-28 20:19:50,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:19:50,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:19:50,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions.
[2024-02-28 20:19:50,434 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9412568306010929
[2024-02-28 20:19:50,434 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 689 transitions.
[2024-02-28 20:19:50,434 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 689 transitions.
[2024-02-28 20:19:50,434 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:50,434 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 689 transitions.
[2024-02-28 20:19:50,436 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 0 states have call successors, (0), 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-02-28 20:19:50,437 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:19:50,437 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:19:50,437 INFO  L175             Difference]: Start difference. First operand has 196 places, 217 transitions, 691 flow. Second operand 4 states and 689 transitions.
[2024-02-28 20:19:50,437 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 218 transitions, 725 flow
[2024-02-28 20:19:50,440 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 218 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 20:19:50,442 INFO  L231             Difference]: Finished difference. Result has 199 places, 217 transitions, 700 flow
[2024-02-28 20:19:50,442 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=700, PETRI_PLACES=199, PETRI_TRANSITIONS=217}
[2024-02-28 20:19:50,443 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 24 predicate places.
[2024-02-28 20:19:50,443 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 217 transitions, 700 flow
[2024-02-28 20:19:50,443 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 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-02-28 20:19:50,443 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:19:50,444 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 20:19:50,444 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:50,444 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:50,444 INFO  L85        PathProgramCache]: Analyzing trace with hash -1312384982, now seen corresponding path program 1 times
[2024-02-28 20:19:50,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:50,445 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845450153]
[2024-02-28 20:19:50,445 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:50,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:50,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:50,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:50,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:50,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845450153]
[2024-02-28 20:19:50,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845450153] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:50,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:50,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:19:50,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028084282]
[2024-02-28 20:19:50,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:50,498 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:19:50,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:50,499 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:19:50,499 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:19:50,538 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 167 out of 183
[2024-02-28 20:19:50,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 217 transitions, 700 flow. Second operand  has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 0 states have call successors, (0), 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-02-28 20:19:50,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:50,539 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 183
[2024-02-28 20:19:50,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:50,648 INFO  L124   PetriNetUnfolderBase]: 164/1197 cut-off events.
[2024-02-28 20:19:50,648 INFO  L125   PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES.
[2024-02-28 20:19:50,651 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 1197 events. 164/1197 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8060 event pairs, 16 based on Foata normal form. 1/1073 useless extension candidates. Maximal degree in co-relation 1736. Up to 94 conditions per place. 
[2024-02-28 20:19:50,654 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 4 changer transitions 0/217 dead transitions.
[2024-02-28 20:19:50,654 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 217 transitions, 732 flow
[2024-02-28 20:19:50,654 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:19:50,655 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:19:50,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 685 transitions.
[2024-02-28 20:19:50,656 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357923497267759
[2024-02-28 20:19:50,656 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 685 transitions.
[2024-02-28 20:19:50,656 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 685 transitions.
[2024-02-28 20:19:50,656 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:50,656 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 685 transitions.
[2024-02-28 20:19:50,658 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 0 states have call successors, (0), 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-02-28 20:19:50,659 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:19:50,659 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:19:50,659 INFO  L175             Difference]: Start difference. First operand has 199 places, 217 transitions, 700 flow. Second operand 4 states and 685 transitions.
[2024-02-28 20:19:50,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 217 transitions, 732 flow
[2024-02-28 20:19:50,662 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 217 transitions, 724 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 20:19:50,664 INFO  L231             Difference]: Finished difference. Result has 200 places, 217 transitions, 704 flow
[2024-02-28 20:19:50,664 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=704, PETRI_PLACES=200, PETRI_TRANSITIONS=217}
[2024-02-28 20:19:50,665 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 25 predicate places.
[2024-02-28 20:19:50,665 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 217 transitions, 704 flow
[2024-02-28 20:19:50,665 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 0 states have call successors, (0), 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-02-28 20:19:50,665 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:50,665 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]
[2024-02-28 20:19:50,665 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 20:19:50,665 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:50,666 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:50,666 INFO  L85        PathProgramCache]: Analyzing trace with hash -258834773, now seen corresponding path program 1 times
[2024-02-28 20:19:50,666 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:50,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454562275]
[2024-02-28 20:19:50,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:50,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:50,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:50,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:50,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:50,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454562275]
[2024-02-28 20:19:50,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454562275] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:50,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:50,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:19:50,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845842034]
[2024-02-28 20:19:50,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:50,692 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:19:50,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:50,693 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:19:50,693 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:19:50,715 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 183
[2024-02-28 20:19:50,715 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 217 transitions, 704 flow. Second operand  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:19:50,716 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:50,716 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 183
[2024-02-28 20:19:50,716 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:50,813 INFO  L124   PetriNetUnfolderBase]: 177/1240 cut-off events.
[2024-02-28 20:19:50,813 INFO  L125   PetriNetUnfolderBase]: For 168/178 co-relation queries the response was YES.
[2024-02-28 20:19:50,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 1240 events. 177/1240 cut-off events. For 168/178 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8525 event pairs, 13 based on Foata normal form. 0/1108 useless extension candidates. Maximal degree in co-relation 1872. Up to 94 conditions per place. 
[2024-02-28 20:19:50,820 INFO  L140   encePairwiseOnDemand]: 177/183 looper letters, 16 selfloop transitions, 7 changer transitions 0/222 dead transitions.
[2024-02-28 20:19:50,820 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 222 transitions, 766 flow
[2024-02-28 20:19:50,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:19:50,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:19:50,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions.
[2024-02-28 20:19:50,821 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9398907103825137
[2024-02-28 20:19:50,821 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 516 transitions.
[2024-02-28 20:19:50,821 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions.
[2024-02-28 20:19:50,822 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:50,822 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions.
[2024-02-28 20:19:50,823 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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-02-28 20:19:50,823 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:19:50,824 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:19:50,824 INFO  L175             Difference]: Start difference. First operand has 200 places, 217 transitions, 704 flow. Second operand 3 states and 516 transitions.
[2024-02-28 20:19:50,824 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 222 transitions, 766 flow
[2024-02-28 20:19:50,827 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 222 transitions, 758 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 20:19:50,829 INFO  L231             Difference]: Finished difference. Result has 201 places, 222 transitions, 752 flow
[2024-02-28 20:19:50,829 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=201, PETRI_TRANSITIONS=222}
[2024-02-28 20:19:50,830 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 26 predicate places.
[2024-02-28 20:19:50,830 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 222 transitions, 752 flow
[2024-02-28 20:19:50,830 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:19:50,830 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:50,830 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:19:50,830 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 20:19:50,830 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:50,831 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:50,831 INFO  L85        PathProgramCache]: Analyzing trace with hash -1294870332, now seen corresponding path program 1 times
[2024-02-28 20:19:50,831 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:50,831 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538928787]
[2024-02-28 20:19:50,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:50,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:50,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:51,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:51,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:51,091 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538928787]
[2024-02-28 20:19:51,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538928787] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:51,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:51,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:19:51,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933097883]
[2024-02-28 20:19:51,091 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:51,091 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:19:51,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:51,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:19:51,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:19:51,208 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183
[2024-02-28 20:19:51,209 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 222 transitions, 752 flow. Second operand  has 6 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 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-02-28 20:19:51,209 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:51,209 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183
[2024-02-28 20:19:51,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:51,485 INFO  L124   PetriNetUnfolderBase]: 452/2104 cut-off events.
[2024-02-28 20:19:51,485 INFO  L125   PetriNetUnfolderBase]: For 551/649 co-relation queries the response was YES.
[2024-02-28 20:19:51,489 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3975 conditions, 2104 events. 452/2104 cut-off events. For 551/649 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 16402 event pairs, 69 based on Foata normal form. 13/1925 useless extension candidates. Maximal degree in co-relation 3928. Up to 609 conditions per place. 
[2024-02-28 20:19:51,495 INFO  L140   encePairwiseOnDemand]: 160/183 looper letters, 52 selfloop transitions, 83 changer transitions 0/303 dead transitions.
[2024-02-28 20:19:51,495 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 303 transitions, 1358 flow
[2024-02-28 20:19:51,496 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:19:51,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:19:51,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 999 transitions.
[2024-02-28 20:19:51,498 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9098360655737705
[2024-02-28 20:19:51,498 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 999 transitions.
[2024-02-28 20:19:51,498 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 999 transitions.
[2024-02-28 20:19:51,499 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:51,499 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 999 transitions.
[2024-02-28 20:19:51,500 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 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-02-28 20:19:51,502 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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-02-28 20:19:51,502 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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-02-28 20:19:51,502 INFO  L175             Difference]: Start difference. First operand has 201 places, 222 transitions, 752 flow. Second operand 6 states and 999 transitions.
[2024-02-28 20:19:51,502 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 303 transitions, 1358 flow
[2024-02-28 20:19:51,507 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 303 transitions, 1344 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:19:51,510 INFO  L231             Difference]: Finished difference. Result has 209 places, 303 transitions, 1474 flow
[2024-02-28 20:19:51,511 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1474, PETRI_PLACES=209, PETRI_TRANSITIONS=303}
[2024-02-28 20:19:51,511 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 34 predicate places.
[2024-02-28 20:19:51,511 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 303 transitions, 1474 flow
[2024-02-28 20:19:51,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 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-02-28 20:19:51,512 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:51,512 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:19:51,512 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 20:19:51,512 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:51,513 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:51,513 INFO  L85        PathProgramCache]: Analyzing trace with hash -1976419936, now seen corresponding path program 1 times
[2024-02-28 20:19:51,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:51,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838669488]
[2024-02-28 20:19:51,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:51,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:51,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:51,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:19:51,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:51,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838669488]
[2024-02-28 20:19:51,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838669488] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:51,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:51,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:19:51,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416781825]
[2024-02-28 20:19:51,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:51,850 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:19:51,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:51,850 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:19:51,850 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:19:52,089 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 183
[2024-02-28 20:19:52,090 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 303 transitions, 1474 flow. Second operand  has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 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-02-28 20:19:52,090 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:52,090 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 183
[2024-02-28 20:19:52,090 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:52,318 INFO  L124   PetriNetUnfolderBase]: 458/2086 cut-off events.
[2024-02-28 20:19:52,318 INFO  L125   PetriNetUnfolderBase]: For 1313/1360 co-relation queries the response was YES.
[2024-02-28 20:19:52,323 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4650 conditions, 2086 events. 458/2086 cut-off events. For 1313/1360 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 16144 event pairs, 42 based on Foata normal form. 8/1952 useless extension candidates. Maximal degree in co-relation 4599. Up to 339 conditions per place. 
[2024-02-28 20:19:52,328 INFO  L140   encePairwiseOnDemand]: 172/183 looper letters, 46 selfloop transitions, 43 changer transitions 8/343 dead transitions.
[2024-02-28 20:19:52,328 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 343 transitions, 1933 flow
[2024-02-28 20:19:52,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:19:52,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:19:52,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1002 transitions.
[2024-02-28 20:19:52,330 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.912568306010929
[2024-02-28 20:19:52,330 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1002 transitions.
[2024-02-28 20:19:52,330 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1002 transitions.
[2024-02-28 20:19:52,331 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:52,331 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1002 transitions.
[2024-02-28 20:19:52,333 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 167.0) internal successors, (1002), 6 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:19:52,334 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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-02-28 20:19:52,334 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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-02-28 20:19:52,334 INFO  L175             Difference]: Start difference. First operand has 209 places, 303 transitions, 1474 flow. Second operand 6 states and 1002 transitions.
[2024-02-28 20:19:52,335 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 343 transitions, 1933 flow
[2024-02-28 20:19:52,342 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 343 transitions, 1879 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-02-28 20:19:52,346 INFO  L231             Difference]: Finished difference. Result has 219 places, 335 transitions, 1877 flow
[2024-02-28 20:19:52,346 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1877, PETRI_PLACES=219, PETRI_TRANSITIONS=335}
[2024-02-28 20:19:52,348 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 44 predicate places.
[2024-02-28 20:19:52,348 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 335 transitions, 1877 flow
[2024-02-28 20:19:52,348 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 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-02-28 20:19:52,348 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:52,348 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:19:52,348 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-02-28 20:19:52,349 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:52,349 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:52,349 INFO  L85        PathProgramCache]: Analyzing trace with hash -364694327, now seen corresponding path program 1 times
[2024-02-28 20:19:52,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:52,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483770603]
[2024-02-28 20:19:52,349 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:52,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:52,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:52,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:52,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:52,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483770603]
[2024-02-28 20:19:52,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483770603] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:52,743 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:52,743 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-02-28 20:19:52,743 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826076089]
[2024-02-28 20:19:52,743 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:52,744 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 20:19:52,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:52,744 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 20:19:52,744 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-02-28 20:19:53,345 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 183
[2024-02-28 20:19:53,347 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 335 transitions, 1877 flow. Second operand  has 10 states, 10 states have (on average 145.9) internal successors, (1459), 10 states have internal predecessors, (1459), 0 states have call successors, (0), 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-02-28 20:19:53,347 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:53,347 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 183
[2024-02-28 20:19:53,347 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:53,996 INFO  L124   PetriNetUnfolderBase]: 497/2132 cut-off events.
[2024-02-28 20:19:53,996 INFO  L125   PetriNetUnfolderBase]: For 1937/2199 co-relation queries the response was YES.
[2024-02-28 20:19:54,002 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5497 conditions, 2132 events. 497/2132 cut-off events. For 1937/2199 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 17061 event pairs, 60 based on Foata normal form. 106/2092 useless extension candidates. Maximal degree in co-relation 5441. Up to 352 conditions per place. 
[2024-02-28 20:19:54,009 INFO  L140   encePairwiseOnDemand]: 167/183 looper letters, 207 selfloop transitions, 73 changer transitions 0/437 dead transitions.
[2024-02-28 20:19:54,009 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 437 transitions, 3123 flow
[2024-02-28 20:19:54,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-02-28 20:19:54,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-02-28 20:19:54,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1704 transitions.
[2024-02-28 20:19:54,014 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8464977645305514
[2024-02-28 20:19:54,014 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1704 transitions.
[2024-02-28 20:19:54,014 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1704 transitions.
[2024-02-28 20:19:54,015 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:54,015 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1704 transitions.
[2024-02-28 20:19:54,018 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 154.9090909090909) internal successors, (1704), 11 states have internal predecessors, (1704), 0 states have call successors, (0), 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-02-28 20:19:54,021 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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-02-28 20:19:54,021 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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-02-28 20:19:54,021 INFO  L175             Difference]: Start difference. First operand has 219 places, 335 transitions, 1877 flow. Second operand 11 states and 1704 transitions.
[2024-02-28 20:19:54,021 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 437 transitions, 3123 flow
[2024-02-28 20:19:54,033 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 437 transitions, 3087 flow, removed 18 selfloop flow, removed 0 redundant places.
[2024-02-28 20:19:54,038 INFO  L231             Difference]: Finished difference. Result has 231 places, 359 transitions, 2309 flow
[2024-02-28 20:19:54,038 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1841, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2309, PETRI_PLACES=231, PETRI_TRANSITIONS=359}
[2024-02-28 20:19:54,039 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 56 predicate places.
[2024-02-28 20:19:54,039 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 359 transitions, 2309 flow
[2024-02-28 20:19:54,039 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 145.9) internal successors, (1459), 10 states have internal predecessors, (1459), 0 states have call successors, (0), 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-02-28 20:19:54,039 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:54,039 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:19:54,040 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-02-28 20:19:54,040 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:54,040 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:54,040 INFO  L85        PathProgramCache]: Analyzing trace with hash 1773797242, now seen corresponding path program 1 times
[2024-02-28 20:19:54,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:54,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154221519]
[2024-02-28 20:19:54,040 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:54,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:54,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:54,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-02-28 20:19:54,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:54,407 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154221519]
[2024-02-28 20:19:54,407 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154221519] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:54,407 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:54,407 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-02-28 20:19:54,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439639688]
[2024-02-28 20:19:54,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:54,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 20:19:54,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:54,408 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 20:19:54,408 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-02-28 20:19:54,887 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183
[2024-02-28 20:19:54,888 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 359 transitions, 2309 flow. Second operand  has 10 states, 10 states have (on average 148.8) internal successors, (1488), 10 states have internal predecessors, (1488), 0 states have call successors, (0), 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-02-28 20:19:54,888 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:54,888 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183
[2024-02-28 20:19:54,888 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:55,259 INFO  L124   PetriNetUnfolderBase]: 436/1961 cut-off events.
[2024-02-28 20:19:55,260 INFO  L125   PetriNetUnfolderBase]: For 3503/3693 co-relation queries the response was YES.
[2024-02-28 20:19:55,266 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5642 conditions, 1961 events. 436/1961 cut-off events. For 3503/3693 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 15696 event pairs, 27 based on Foata normal form. 41/1873 useless extension candidates. Maximal degree in co-relation 5579. Up to 477 conditions per place. 
[2024-02-28 20:19:55,271 INFO  L140   encePairwiseOnDemand]: 171/183 looper letters, 154 selfloop transitions, 18 changer transitions 0/363 dead transitions.
[2024-02-28 20:19:55,271 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 363 transitions, 2703 flow
[2024-02-28 20:19:55,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-02-28 20:19:55,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-02-28 20:19:55,273 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1509 transitions.
[2024-02-28 20:19:55,273 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8245901639344262
[2024-02-28 20:19:55,274 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1509 transitions.
[2024-02-28 20:19:55,274 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1509 transitions.
[2024-02-28 20:19:55,274 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:55,274 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1509 transitions.
[2024-02-28 20:19:55,276 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 150.9) internal successors, (1509), 10 states have internal predecessors, (1509), 0 states have call successors, (0), 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-02-28 20:19:55,278 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 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-02-28 20:19:55,279 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 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-02-28 20:19:55,279 INFO  L175             Difference]: Start difference. First operand has 231 places, 359 transitions, 2309 flow. Second operand 10 states and 1509 transitions.
[2024-02-28 20:19:55,279 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 363 transitions, 2703 flow
[2024-02-28 20:19:55,296 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 363 transitions, 2697 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 20:19:55,300 INFO  L231             Difference]: Finished difference. Result has 238 places, 360 transitions, 2375 flow
[2024-02-28 20:19:55,300 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2291, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2375, PETRI_PLACES=238, PETRI_TRANSITIONS=360}
[2024-02-28 20:19:55,301 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 63 predicate places.
[2024-02-28 20:19:55,301 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 360 transitions, 2375 flow
[2024-02-28 20:19:55,302 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 148.8) internal successors, (1488), 10 states have internal predecessors, (1488), 0 states have call successors, (0), 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-02-28 20:19:55,302 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:55,302 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:19:55,302 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-02-28 20:19:55,302 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:55,302 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:55,302 INFO  L85        PathProgramCache]: Analyzing trace with hash 1579913905, now seen corresponding path program 1 times
[2024-02-28 20:19:55,302 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:55,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71401596]
[2024-02-28 20:19:55,303 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:55,303 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:55,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:55,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:55,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:55,333 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71401596]
[2024-02-28 20:19:55,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71401596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:55,333 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:19:55,333 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:19:55,333 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794351865]
[2024-02-28 20:19:55,333 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:55,333 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:19:55,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:55,334 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:19:55,334 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:19:55,355 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-02-28 20:19:55,355 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 360 transitions, 2375 flow. Second operand  has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 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-02-28 20:19:55,356 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:55,356 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-02-28 20:19:55,356 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:55,567 INFO  L124   PetriNetUnfolderBase]: 457/2065 cut-off events.
[2024-02-28 20:19:55,567 INFO  L125   PetriNetUnfolderBase]: For 3228/3307 co-relation queries the response was YES.
[2024-02-28 20:19:55,575 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5528 conditions, 2065 events. 457/2065 cut-off events. For 3228/3307 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 16678 event pairs, 27 based on Foata normal form. 11/1962 useless extension candidates. Maximal degree in co-relation 5448. Up to 276 conditions per place. 
[2024-02-28 20:19:55,578 INFO  L140   encePairwiseOnDemand]: 176/183 looper letters, 14 selfloop transitions, 11 changer transitions 31/367 dead transitions.
[2024-02-28 20:19:55,578 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 367 transitions, 2453 flow
[2024-02-28 20:19:55,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:19:55,579 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:19:55,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions.
[2024-02-28 20:19:55,580 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9471766848816029
[2024-02-28 20:19:55,580 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 520 transitions.
[2024-02-28 20:19:55,580 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions.
[2024-02-28 20:19:55,580 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:55,581 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions.
[2024-02-28 20:19:55,581 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 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-02-28 20:19:55,582 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:19:55,582 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:19:55,582 INFO  L175             Difference]: Start difference. First operand has 238 places, 360 transitions, 2375 flow. Second operand 3 states and 520 transitions.
[2024-02-28 20:19:55,582 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 367 transitions, 2453 flow
[2024-02-28 20:19:55,603 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 367 transitions, 2417 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-02-28 20:19:55,606 INFO  L231             Difference]: Finished difference. Result has 237 places, 336 transitions, 2110 flow
[2024-02-28 20:19:55,606 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2339, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=237, PETRI_TRANSITIONS=336}
[2024-02-28 20:19:55,607 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 62 predicate places.
[2024-02-28 20:19:55,607 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 336 transitions, 2110 flow
[2024-02-28 20:19:55,607 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 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-02-28 20:19:55,607 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:55,607 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:19:55,607 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-02-28 20:19:55,607 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:55,607 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:55,608 INFO  L85        PathProgramCache]: Analyzing trace with hash 995836345, now seen corresponding path program 1 times
[2024-02-28 20:19:55,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:55,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459412872]
[2024-02-28 20:19:55,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:55,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:55,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:56,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:56,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:56,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459412872]
[2024-02-28 20:19:56,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459412872] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:19:56,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496959537]
[2024-02-28 20:19:56,148 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:56,148 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:19:56,149 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:19:56,154 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-02-28 20:19:56,156 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-02-28 20:19:56,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:56,310 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 27 conjunts are in the unsatisfiable core
[2024-02-28 20:19:56,321 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:19:56,364 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:19:56,438 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:19:56,438 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:19:56,754 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-02-28 20:19:56,755 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-02-28 20:19:56,804 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:19:56,805 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:19:56,874 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:19:56,891 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:19:56,900 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:19:56,922 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:19:56,922 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:19:56,945 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:19:56,945 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:19:56,980 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:19:56,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:19:56,992 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:19:56,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [496959537] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:19:56,992 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:19:56,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 20
[2024-02-28 20:19:56,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674867035]
[2024-02-28 20:19:56,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:19:56,992 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-02-28 20:19:56,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:19:56,993 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-02-28 20:19:56,993 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420
[2024-02-28 20:19:57,772 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183
[2024-02-28 20:19:57,774 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 336 transitions, 2110 flow. Second operand  has 14 states, 14 states have (on average 135.21428571428572) internal successors, (1893), 14 states have internal predecessors, (1893), 0 states have call successors, (0), 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-02-28 20:19:57,774 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:19:57,774 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183
[2024-02-28 20:19:57,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:19:58,867 INFO  L124   PetriNetUnfolderBase]: 645/2481 cut-off events.
[2024-02-28 20:19:58,867 INFO  L125   PetriNetUnfolderBase]: For 5230/5299 co-relation queries the response was YES.
[2024-02-28 20:19:58,875 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7934 conditions, 2481 events. 645/2481 cut-off events. For 5230/5299 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 19352 event pairs, 54 based on Foata normal form. 16/2380 useless extension candidates. Maximal degree in co-relation 7849. Up to 354 conditions per place. 
[2024-02-28 20:19:58,880 INFO  L140   encePairwiseOnDemand]: 164/183 looper letters, 261 selfloop transitions, 81 changer transitions 35/526 dead transitions.
[2024-02-28 20:19:58,880 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 526 transitions, 4646 flow
[2024-02-28 20:19:58,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-02-28 20:19:58,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-02-28 20:19:58,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2649 transitions.
[2024-02-28 20:19:58,884 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7618636755823986
[2024-02-28 20:19:58,885 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 2649 transitions.
[2024-02-28 20:19:58,885 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 2649 transitions.
[2024-02-28 20:19:58,886 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:19:58,886 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2649 transitions.
[2024-02-28 20:19:58,889 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 139.42105263157896) internal successors, (2649), 19 states have internal predecessors, (2649), 0 states have call successors, (0), 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-02-28 20:19:58,893 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 183.0) internal successors, (3660), 20 states have internal predecessors, (3660), 0 states have call successors, (0), 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-02-28 20:19:58,893 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 183.0) internal successors, (3660), 20 states have internal predecessors, (3660), 0 states have call successors, (0), 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-02-28 20:19:58,893 INFO  L175             Difference]: Start difference. First operand has 237 places, 336 transitions, 2110 flow. Second operand 19 states and 2649 transitions.
[2024-02-28 20:19:58,893 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 526 transitions, 4646 flow
[2024-02-28 20:19:58,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 526 transitions, 4613 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-02-28 20:19:58,921 INFO  L231             Difference]: Finished difference. Result has 254 places, 387 transitions, 2973 flow
[2024-02-28 20:19:58,921 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2973, PETRI_PLACES=254, PETRI_TRANSITIONS=387}
[2024-02-28 20:19:58,921 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 79 predicate places.
[2024-02-28 20:19:58,922 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 387 transitions, 2973 flow
[2024-02-28 20:19:58,922 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 135.21428571428572) internal successors, (1893), 14 states have internal predecessors, (1893), 0 states have call successors, (0), 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-02-28 20:19:58,922 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:19:58,922 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:19:58,937 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-02-28 20:19:59,123 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:19:59,123 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:19:59,124 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:19:59,124 INFO  L85        PathProgramCache]: Analyzing trace with hash -376161087, now seen corresponding path program 2 times
[2024-02-28 20:19:59,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:19:59,124 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955511242]
[2024-02-28 20:19:59,125 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:19:59,125 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:19:59,149 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:19:59,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:19:59,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:19:59,820 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955511242]
[2024-02-28 20:19:59,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955511242] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:19:59,820 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882958002]
[2024-02-28 20:19:59,820 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 20:19:59,820 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:19:59,821 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:19:59,821 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-02-28 20:19:59,823 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-02-28 20:19:59,936 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:19:59,936 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:19:59,937 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-02-28 20:19:59,943 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:19:59,972 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:20:00,033 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:20:00,034 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:20:00,319 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-02-28 20:20:00,319 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-02-28 20:20:00,365 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:00,366 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:20:00,380 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:20:00,417 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:20:00,466 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:20:00,466 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:20:00,635 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:20:00,683 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:00,683 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35
[2024-02-28 20:20:00,703 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:20:00,704 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:20:00,753 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:00,754 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:00,770 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:00,771 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:00,795 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:00,796 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:00,826 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:00,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:00,833 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:20:00,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882958002] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:00,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:20:00,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-02-28 20:20:00,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207190056]
[2024-02-28 20:20:00,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:00,833 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-02-28 20:20:00,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:00,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-02-28 20:20:00,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702
[2024-02-28 20:20:01,437 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183
[2024-02-28 20:20:01,438 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 387 transitions, 2973 flow. Second operand  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 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-02-28 20:20:01,438 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:01,438 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183
[2024-02-28 20:20:01,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:03,171 INFO  L124   PetriNetUnfolderBase]: 650/2519 cut-off events.
[2024-02-28 20:20:03,171 INFO  L125   PetriNetUnfolderBase]: For 8843/8930 co-relation queries the response was YES.
[2024-02-28 20:20:03,180 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9158 conditions, 2519 events. 650/2519 cut-off events. For 8843/8930 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 19315 event pairs, 45 based on Foata normal form. 42/2469 useless extension candidates. Maximal degree in co-relation 9063. Up to 421 conditions per place. 
[2024-02-28 20:20:03,185 INFO  L140   encePairwiseOnDemand]: 160/183 looper letters, 255 selfloop transitions, 137 changer transitions 20/561 dead transitions.
[2024-02-28 20:20:03,185 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 561 transitions, 5331 flow
[2024-02-28 20:20:03,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-02-28 20:20:03,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-02-28 20:20:03,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3503 transitions.
[2024-02-28 20:20:03,190 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7656830601092897
[2024-02-28 20:20:03,191 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 3503 transitions.
[2024-02-28 20:20:03,191 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 3503 transitions.
[2024-02-28 20:20:03,192 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:03,192 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3503 transitions.
[2024-02-28 20:20:03,196 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 140.12) internal successors, (3503), 25 states have internal predecessors, (3503), 0 states have call successors, (0), 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-02-28 20:20:03,200 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 183.0) internal successors, (4758), 26 states have internal predecessors, (4758), 0 states have call successors, (0), 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-02-28 20:20:03,200 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 183.0) internal successors, (4758), 26 states have internal predecessors, (4758), 0 states have call successors, (0), 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-02-28 20:20:03,201 INFO  L175             Difference]: Start difference. First operand has 254 places, 387 transitions, 2973 flow. Second operand 25 states and 3503 transitions.
[2024-02-28 20:20:03,201 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 561 transitions, 5331 flow
[2024-02-28 20:20:03,229 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 561 transitions, 5279 flow, removed 9 selfloop flow, removed 9 redundant places.
[2024-02-28 20:20:03,234 INFO  L231             Difference]: Finished difference. Result has 273 places, 441 transitions, 3956 flow
[2024-02-28 20:20:03,235 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2929, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3956, PETRI_PLACES=273, PETRI_TRANSITIONS=441}
[2024-02-28 20:20:03,235 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 98 predicate places.
[2024-02-28 20:20:03,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 273 places, 441 transitions, 3956 flow
[2024-02-28 20:20:03,236 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 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-02-28 20:20:03,236 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:03,236 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:20:03,243 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-02-28 20:20:03,436 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,SelfDestructingSolverStorable16
[2024-02-28 20:20:03,437 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:20:03,438 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:03,438 INFO  L85        PathProgramCache]: Analyzing trace with hash -1579866831, now seen corresponding path program 3 times
[2024-02-28 20:20:03,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:03,439 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532370089]
[2024-02-28 20:20:03,439 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:03,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:03,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:03,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:03,991 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:03,991 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532370089]
[2024-02-28 20:20:03,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532370089] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:20:03,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261562571]
[2024-02-28 20:20:03,992 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 20:20:03,992 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:20:03,992 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:20:03,993 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-02-28 20:20:03,995 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-02-28 20:20:04,136 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 20:20:04,136 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:20:04,138 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-02-28 20:20:04,148 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:20:04,170 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:20:04,238 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:20:04,239 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:20:04,513 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-02-28 20:20:04,513 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-02-28 20:20:04,553 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:04,554 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:20:04,573 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:20:04,672 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:20:04,710 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:20:04,757 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:20:04,757 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:20:04,824 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:20:04,825 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:20:04,902 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:04,903 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:04,933 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:04,934 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:04,954 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:04,955 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:04,977 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:04,978 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:05,012 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:05,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:05,020 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:20:05,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261562571] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:05,020 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:20:05,020 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-02-28 20:20:05,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642989653]
[2024-02-28 20:20:05,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:05,021 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-02-28 20:20:05,021 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:05,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-02-28 20:20:05,022 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702
[2024-02-28 20:20:05,962 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183
[2024-02-28 20:20:05,963 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 441 transitions, 3956 flow. Second operand  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 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-02-28 20:20:05,963 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:05,963 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183
[2024-02-28 20:20:05,963 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:07,376 INFO  L124   PetriNetUnfolderBase]: 709/2753 cut-off events.
[2024-02-28 20:20:07,377 INFO  L125   PetriNetUnfolderBase]: For 13937/14071 co-relation queries the response was YES.
[2024-02-28 20:20:07,387 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10946 conditions, 2753 events. 709/2753 cut-off events. For 13937/14071 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 21828 event pairs, 47 based on Foata normal form. 47/2699 useless extension candidates. Maximal degree in co-relation 10846. Up to 472 conditions per place. 
[2024-02-28 20:20:07,394 INFO  L140   encePairwiseOnDemand]: 160/183 looper letters, 323 selfloop transitions, 124 changer transitions 8/604 dead transitions.
[2024-02-28 20:20:07,394 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 604 transitions, 6565 flow
[2024-02-28 20:20:07,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-02-28 20:20:07,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-02-28 20:20:07,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2806 transitions.
[2024-02-28 20:20:07,397 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7666666666666667
[2024-02-28 20:20:07,397 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 2806 transitions.
[2024-02-28 20:20:07,397 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 2806 transitions.
[2024-02-28 20:20:07,397 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:07,397 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2806 transitions.
[2024-02-28 20:20:07,400 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 140.3) internal successors, (2806), 20 states have internal predecessors, (2806), 0 states have call successors, (0), 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-02-28 20:20:07,403 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 183.0) internal successors, (3843), 21 states have internal predecessors, (3843), 0 states have call successors, (0), 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-02-28 20:20:07,403 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 183.0) internal successors, (3843), 21 states have internal predecessors, (3843), 0 states have call successors, (0), 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-02-28 20:20:07,403 INFO  L175             Difference]: Start difference. First operand has 273 places, 441 transitions, 3956 flow. Second operand 20 states and 2806 transitions.
[2024-02-28 20:20:07,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 604 transitions, 6565 flow
[2024-02-28 20:20:07,446 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 604 transitions, 6345 flow, removed 47 selfloop flow, removed 9 redundant places.
[2024-02-28 20:20:07,453 INFO  L231             Difference]: Finished difference. Result has 288 places, 492 transitions, 4997 flow
[2024-02-28 20:20:07,453 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=3760, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4997, PETRI_PLACES=288, PETRI_TRANSITIONS=492}
[2024-02-28 20:20:07,453 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 113 predicate places.
[2024-02-28 20:20:07,453 INFO  L495      AbstractCegarLoop]: Abstraction has has 288 places, 492 transitions, 4997 flow
[2024-02-28 20:20:07,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 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-02-28 20:20:07,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:07,454 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:20:07,461 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-02-28 20:20:07,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-02-28 20:20:07,655 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:20:07,655 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:07,656 INFO  L85        PathProgramCache]: Analyzing trace with hash -439540535, now seen corresponding path program 4 times
[2024-02-28 20:20:07,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:07,656 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117027727]
[2024-02-28 20:20:07,656 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:07,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:07,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:08,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:08,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:08,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117027727]
[2024-02-28 20:20:08,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117027727] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:20:08,266 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858194010]
[2024-02-28 20:20:08,266 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 20:20:08,266 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:20:08,266 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:20:08,267 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:20:08,268 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-02-28 20:20:08,493 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 20:20:08,494 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:20:08,500 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 64 conjunts are in the unsatisfiable core
[2024-02-28 20:20:08,506 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:20:08,538 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:20:08,621 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:20:08,621 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:20:09,260 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-02-28 20:20:09,261 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-02-28 20:20:09,268 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:09,268 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-02-28 20:20:09,518 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:09,519 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:20:09,527 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:09,527 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-02-28 20:20:09,700 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:20:09,777 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:20:09,843 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-02-28 20:20:09,855 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:20:09,912 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:20:09,978 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:09,979 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-02-28 20:20:10,005 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:10,006 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-02-28 20:20:10,032 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:10,033 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-02-28 20:20:10,056 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:10,057 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-02-28 20:20:10,124 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:20:10,187 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48
[2024-02-28 20:20:10,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:10,297 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:20:10,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [858194010] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:10,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:20:10,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [15] total 33
[2024-02-28 20:20:10,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821352042]
[2024-02-28 20:20:10,320 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:10,320 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-02-28 20:20:10,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:10,322 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-02-28 20:20:10,322 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122
[2024-02-28 20:20:12,176 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 183
[2024-02-28 20:20:12,178 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 492 transitions, 4997 flow. Second operand  has 20 states, 20 states have (on average 123.8) internal successors, (2476), 20 states have internal predecessors, (2476), 0 states have call successors, (0), 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-02-28 20:20:12,178 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:12,178 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 183
[2024-02-28 20:20:12,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:16,493 INFO  L124   PetriNetUnfolderBase]: 2727/9479 cut-off events.
[2024-02-28 20:20:16,493 INFO  L125   PetriNetUnfolderBase]: For 61493/61628 co-relation queries the response was YES.
[2024-02-28 20:20:16,532 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40771 conditions, 9479 events. 2727/9479 cut-off events. For 61493/61628 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 98516 event pairs, 387 based on Foata normal form. 28/9114 useless extension candidates. Maximal degree in co-relation 35134. Up to 1875 conditions per place. 
[2024-02-28 20:20:16,552 INFO  L140   encePairwiseOnDemand]: 148/183 looper letters, 1034 selfloop transitions, 185 changer transitions 32/1389 dead transitions.
[2024-02-28 20:20:16,552 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 1389 transitions, 18817 flow
[2024-02-28 20:20:16,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-02-28 20:20:16,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-02-28 20:20:16,555 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3978 transitions.
[2024-02-28 20:20:16,556 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7245901639344262
[2024-02-28 20:20:16,556 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 3978 transitions.
[2024-02-28 20:20:16,556 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 3978 transitions.
[2024-02-28 20:20:16,557 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:16,557 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3978 transitions.
[2024-02-28 20:20:16,561 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 132.6) internal successors, (3978), 30 states have internal predecessors, (3978), 0 states have call successors, (0), 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-02-28 20:20:16,565 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 183.0) internal successors, (5673), 31 states have internal predecessors, (5673), 0 states have call successors, (0), 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-02-28 20:20:16,565 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 183.0) internal successors, (5673), 31 states have internal predecessors, (5673), 0 states have call successors, (0), 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-02-28 20:20:16,565 INFO  L175             Difference]: Start difference. First operand has 288 places, 492 transitions, 4997 flow. Second operand 30 states and 3978 transitions.
[2024-02-28 20:20:16,565 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 1389 transitions, 18817 flow
[2024-02-28 20:20:16,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 1389 transitions, 18372 flow, removed 161 selfloop flow, removed 11 redundant places.
[2024-02-28 20:20:16,813 INFO  L231             Difference]: Finished difference. Result has 324 places, 670 transitions, 8324 flow
[2024-02-28 20:20:16,814 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4850, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=8324, PETRI_PLACES=324, PETRI_TRANSITIONS=670}
[2024-02-28 20:20:16,814 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 149 predicate places.
[2024-02-28 20:20:16,814 INFO  L495      AbstractCegarLoop]: Abstraction has has 324 places, 670 transitions, 8324 flow
[2024-02-28 20:20:16,815 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 123.8) internal successors, (2476), 20 states have internal predecessors, (2476), 0 states have call successors, (0), 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-02-28 20:20:16,815 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:16,815 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:20:16,822 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-02-28 20:20:17,015 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:20:17,016 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:20:17,016 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:17,016 INFO  L85        PathProgramCache]: Analyzing trace with hash -92186031, now seen corresponding path program 5 times
[2024-02-28 20:20:17,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:17,017 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269044954]
[2024-02-28 20:20:17,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:17,017 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:17,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:17,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:17,673 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:17,673 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269044954]
[2024-02-28 20:20:17,673 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269044954] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:20:17,673 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944816798]
[2024-02-28 20:20:17,673 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-02-28 20:20:17,673 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:20:17,673 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:20:17,674 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:20:17,675 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-02-28 20:20:17,828 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:20:17,828 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:20:17,829 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 36 conjunts are in the unsatisfiable core
[2024-02-28 20:20:17,836 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:20:17,842 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:20:17,870 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-02-28 20:20:17,870 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-02-28 20:20:17,926 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:17,932 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:20:17,932 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-02-28 20:20:18,172 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:20:18,172 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32
[2024-02-28 20:20:18,217 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:18,217 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18
[2024-02-28 20:20:18,240 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:20:18,271 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:20:18,382 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 20:20:18,428 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:20:18,428 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:20:18,473 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:18,473 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35
[2024-02-28 20:20:18,492 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:20:18,492 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:20:18,545 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:18,546 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:18,575 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:18,576 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:18,594 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:18,595 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:18,656 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:18,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:18,665 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:20:18,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944816798] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:18,665 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:20:18,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25
[2024-02-28 20:20:18,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124170829]
[2024-02-28 20:20:18,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:18,666 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-02-28 20:20:18,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:18,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-02-28 20:20:18,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650
[2024-02-28 20:20:19,407 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 183
[2024-02-28 20:20:19,409 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 670 transitions, 8324 flow. Second operand  has 15 states, 15 states have (on average 134.06666666666666) internal successors, (2011), 15 states have internal predecessors, (2011), 0 states have call successors, (0), 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-02-28 20:20:19,409 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:19,409 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 183
[2024-02-28 20:20:19,409 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:22,601 INFO  L124   PetriNetUnfolderBase]: 2222/7988 cut-off events.
[2024-02-28 20:20:22,601 INFO  L125   PetriNetUnfolderBase]: For 78826/79230 co-relation queries the response was YES.
[2024-02-28 20:20:22,637 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40047 conditions, 7988 events. 2222/7988 cut-off events. For 78826/79230 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 81517 event pairs, 159 based on Foata normal form. 174/7947 useless extension candidates. Maximal degree in co-relation 38284. Up to 1632 conditions per place. 
[2024-02-28 20:20:22,655 INFO  L140   encePairwiseOnDemand]: 160/183 looper letters, 344 selfloop transitions, 292 changer transitions 9/812 dead transitions.
[2024-02-28 20:20:22,655 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 812 transitions, 11142 flow
[2024-02-28 20:20:22,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-02-28 20:20:22,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-02-28 20:20:22,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3065 transitions.
[2024-02-28 20:20:22,659 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7613015399900646
[2024-02-28 20:20:22,659 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 3065 transitions.
[2024-02-28 20:20:22,659 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 3065 transitions.
[2024-02-28 20:20:22,659 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:22,659 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3065 transitions.
[2024-02-28 20:20:22,663 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 139.3181818181818) internal successors, (3065), 22 states have internal predecessors, (3065), 0 states have call successors, (0), 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-02-28 20:20:22,666 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 183.0) internal successors, (4209), 23 states have internal predecessors, (4209), 0 states have call successors, (0), 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-02-28 20:20:22,667 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 183.0) internal successors, (4209), 23 states have internal predecessors, (4209), 0 states have call successors, (0), 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-02-28 20:20:22,667 INFO  L175             Difference]: Start difference. First operand has 324 places, 670 transitions, 8324 flow. Second operand 22 states and 3065 transitions.
[2024-02-28 20:20:22,667 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 812 transitions, 11142 flow
[2024-02-28 20:20:22,939 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 812 transitions, 11013 flow, removed 54 selfloop flow, removed 6 redundant places.
[2024-02-28 20:20:22,949 INFO  L231             Difference]: Finished difference. Result has 342 places, 701 transitions, 9781 flow
[2024-02-28 20:20:22,949 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=8195, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9781, PETRI_PLACES=342, PETRI_TRANSITIONS=701}
[2024-02-28 20:20:22,950 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 167 predicate places.
[2024-02-28 20:20:22,950 INFO  L495      AbstractCegarLoop]: Abstraction has has 342 places, 701 transitions, 9781 flow
[2024-02-28 20:20:22,950 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 134.06666666666666) internal successors, (2011), 15 states have internal predecessors, (2011), 0 states have call successors, (0), 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-02-28 20:20:22,950 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:22,950 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:20:22,958 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-02-28 20:20:23,151 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:20:23,152 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:20:23,152 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:23,152 INFO  L85        PathProgramCache]: Analyzing trace with hash -849768198, now seen corresponding path program 1 times
[2024-02-28 20:20:23,152 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:23,153 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754363340]
[2024-02-28 20:20:23,153 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:23,153 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:23,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:23,750 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:23,750 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:23,751 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754363340]
[2024-02-28 20:20:23,751 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754363340] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:20:23,751 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627831611]
[2024-02-28 20:20:23,751 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:23,751 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:20:23,751 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:20:23,752 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:20:23,754 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-02-28 20:20:23,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:23,869 INFO  L262         TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-02-28 20:20:23,873 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:20:23,900 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:20:23,968 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:20:23,968 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:20:24,311 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-02-28 20:20:24,312 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-02-28 20:20:24,367 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:20:24,368 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:20:24,440 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:20:24,460 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:20:24,470 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:20:24,488 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:20:24,488 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:20:24,516 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:20:24,516 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:20:24,537 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:20:24,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:20:24,551 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:20:24,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [627831611] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:24,551 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:20:24,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 21
[2024-02-28 20:20:24,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69010304]
[2024-02-28 20:20:24,551 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:24,551 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-02-28 20:20:24,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:24,552 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-02-28 20:20:24,552 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462
[2024-02-28 20:20:25,519 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 183
[2024-02-28 20:20:25,521 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 701 transitions, 9781 flow. Second operand  has 14 states, 14 states have (on average 146.57142857142858) internal successors, (2052), 14 states have internal predecessors, (2052), 0 states have call successors, (0), 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-02-28 20:20:25,521 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:25,521 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 183
[2024-02-28 20:20:25,521 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:27,693 INFO  L124   PetriNetUnfolderBase]: 1963/7786 cut-off events.
[2024-02-28 20:20:27,693 INFO  L125   PetriNetUnfolderBase]: For 85691/85837 co-relation queries the response was YES.
[2024-02-28 20:20:27,732 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38803 conditions, 7786 events. 1963/7786 cut-off events. For 85691/85837 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 81422 event pairs, 94 based on Foata normal form. 78/7607 useless extension candidates. Maximal degree in co-relation 37095. Up to 1541 conditions per place. 
[2024-02-28 20:20:27,745 INFO  L140   encePairwiseOnDemand]: 166/183 looper letters, 138 selfloop transitions, 92 changer transitions 207/743 dead transitions.
[2024-02-28 20:20:27,745 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 743 transitions, 11331 flow
[2024-02-28 20:20:27,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-02-28 20:20:27,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-02-28 20:20:27,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2387 transitions.
[2024-02-28 20:20:27,749 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8152322404371585
[2024-02-28 20:20:27,749 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 2387 transitions.
[2024-02-28 20:20:27,749 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 2387 transitions.
[2024-02-28 20:20:27,749 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:27,749 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2387 transitions.
[2024-02-28 20:20:27,751 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 149.1875) internal successors, (2387), 16 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:20:27,753 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 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-02-28 20:20:27,753 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 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-02-28 20:20:27,754 INFO  L175             Difference]: Start difference. First operand has 342 places, 701 transitions, 9781 flow. Second operand 16 states and 2387 transitions.
[2024-02-28 20:20:27,754 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 743 transitions, 11331 flow
[2024-02-28 20:20:28,076 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 743 transitions, 10997 flow, removed 77 selfloop flow, removed 16 redundant places.
[2024-02-28 20:20:28,084 INFO  L231             Difference]: Finished difference. Result has 340 places, 534 transitions, 6553 flow
[2024-02-28 20:20:28,085 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=9463, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6553, PETRI_PLACES=340, PETRI_TRANSITIONS=534}
[2024-02-28 20:20:28,085 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 165 predicate places.
[2024-02-28 20:20:28,085 INFO  L495      AbstractCegarLoop]: Abstraction has has 340 places, 534 transitions, 6553 flow
[2024-02-28 20:20:28,085 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 146.57142857142858) internal successors, (2052), 14 states have internal predecessors, (2052), 0 states have call successors, (0), 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-02-28 20:20:28,085 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:28,086 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-28 20:20:28,092 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-02-28 20:20:28,286 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:20:28,287 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:20:28,287 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:28,287 INFO  L85        PathProgramCache]: Analyzing trace with hash -1906956998, now seen corresponding path program 1 times
[2024-02-28 20:20:28,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:28,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436106765]
[2024-02-28 20:20:28,288 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:28,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:28,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:28,382 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:28,382 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:28,382 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436106765]
[2024-02-28 20:20:28,382 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436106765] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:28,382 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:28,382 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-02-28 20:20:28,383 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419993632]
[2024-02-28 20:20:28,383 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:28,383 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-02-28 20:20:28,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:28,383 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-02-28 20:20:28,383 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-02-28 20:20:28,521 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 183
[2024-02-28 20:20:28,522 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 534 transitions, 6553 flow. Second operand  has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 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-02-28 20:20:28,522 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:28,522 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 183
[2024-02-28 20:20:28,522 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:30,069 INFO  L124   PetriNetUnfolderBase]: 1933/8046 cut-off events.
[2024-02-28 20:20:30,070 INFO  L125   PetriNetUnfolderBase]: For 59241/59425 co-relation queries the response was YES.
[2024-02-28 20:20:30,110 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31322 conditions, 8046 events. 1933/8046 cut-off events. For 59241/59425 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 86402 event pairs, 252 based on Foata normal form. 79/7840 useless extension candidates. Maximal degree in co-relation 30111. Up to 1085 conditions per place. 
[2024-02-28 20:20:30,125 INFO  L140   encePairwiseOnDemand]: 170/183 looper letters, 54 selfloop transitions, 36 changer transitions 0/599 dead transitions.
[2024-02-28 20:20:30,125 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 599 transitions, 6907 flow
[2024-02-28 20:20:30,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-02-28 20:20:30,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-02-28 20:20:30,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2466 transitions.
[2024-02-28 20:20:30,127 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.898360655737705
[2024-02-28 20:20:30,128 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 2466 transitions.
[2024-02-28 20:20:30,128 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 2466 transitions.
[2024-02-28 20:20:30,128 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:30,128 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2466 transitions.
[2024-02-28 20:20:30,130 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 164.4) internal successors, (2466), 15 states have internal predecessors, (2466), 0 states have call successors, (0), 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-02-28 20:20:30,132 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 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-02-28 20:20:30,132 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 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-02-28 20:20:30,132 INFO  L175             Difference]: Start difference. First operand has 340 places, 534 transitions, 6553 flow. Second operand 15 states and 2466 transitions.
[2024-02-28 20:20:30,132 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 599 transitions, 6907 flow
[2024-02-28 20:20:30,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 599 transitions, 6444 flow, removed 58 selfloop flow, removed 23 redundant places.
[2024-02-28 20:20:30,325 INFO  L231             Difference]: Finished difference. Result has 340 places, 567 transitions, 6344 flow
[2024-02-28 20:20:30,325 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=6090, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6344, PETRI_PLACES=340, PETRI_TRANSITIONS=567}
[2024-02-28 20:20:30,326 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 165 predicate places.
[2024-02-28 20:20:30,326 INFO  L495      AbstractCegarLoop]: Abstraction has has 340 places, 567 transitions, 6344 flow
[2024-02-28 20:20:30,326 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 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-02-28 20:20:30,326 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:30,326 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-28 20:20:30,326 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-02-28 20:20:30,326 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:20:30,327 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:30,327 INFO  L85        PathProgramCache]: Analyzing trace with hash -242303718, now seen corresponding path program 1 times
[2024-02-28 20:20:30,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:30,327 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948251518]
[2024-02-28 20:20:30,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:30,327 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:30,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:30,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:30,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:30,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948251518]
[2024-02-28 20:20:30,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948251518] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:30,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:30,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-02-28 20:20:30,432 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049667423]
[2024-02-28 20:20:30,432 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:30,432 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-02-28 20:20:30,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:30,432 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-02-28 20:20:30,432 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-02-28 20:20:30,571 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183
[2024-02-28 20:20:30,571 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 567 transitions, 6344 flow. Second operand  has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 0 states have call successors, (0), 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-02-28 20:20:30,572 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:30,572 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183
[2024-02-28 20:20:30,572 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:32,110 INFO  L124   PetriNetUnfolderBase]: 1939/8130 cut-off events.
[2024-02-28 20:20:32,111 INFO  L125   PetriNetUnfolderBase]: For 56484/56710 co-relation queries the response was YES.
[2024-02-28 20:20:32,152 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31539 conditions, 8130 events. 1939/8130 cut-off events. For 56484/56710 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 87956 event pairs, 289 based on Foata normal form. 121/8068 useless extension candidates. Maximal degree in co-relation 30403. Up to 1084 conditions per place. 
[2024-02-28 20:20:32,167 INFO  L140   encePairwiseOnDemand]: 170/183 looper letters, 60 selfloop transitions, 45 changer transitions 0/613 dead transitions.
[2024-02-28 20:20:32,167 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 613 transitions, 6791 flow
[2024-02-28 20:20:32,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-02-28 20:20:32,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-02-28 20:20:32,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2457 transitions.
[2024-02-28 20:20:32,170 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8950819672131147
[2024-02-28 20:20:32,170 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 2457 transitions.
[2024-02-28 20:20:32,170 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 2457 transitions.
[2024-02-28 20:20:32,170 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:32,170 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2457 transitions.
[2024-02-28 20:20:32,172 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 163.8) internal successors, (2457), 15 states have internal predecessors, (2457), 0 states have call successors, (0), 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-02-28 20:20:32,174 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 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-02-28 20:20:32,174 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 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-02-28 20:20:32,175 INFO  L175             Difference]: Start difference. First operand has 340 places, 567 transitions, 6344 flow. Second operand 15 states and 2457 transitions.
[2024-02-28 20:20:32,175 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 613 transitions, 6791 flow
[2024-02-28 20:20:32,343 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 613 transitions, 6667 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-02-28 20:20:32,350 INFO  L231             Difference]: Finished difference. Result has 353 places, 581 transitions, 6422 flow
[2024-02-28 20:20:32,350 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=6230, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6422, PETRI_PLACES=353, PETRI_TRANSITIONS=581}
[2024-02-28 20:20:32,350 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 178 predicate places.
[2024-02-28 20:20:32,351 INFO  L495      AbstractCegarLoop]: Abstraction has has 353 places, 581 transitions, 6422 flow
[2024-02-28 20:20:32,351 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 0 states have call successors, (0), 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-02-28 20:20:32,351 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:32,351 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-28 20:20:32,351 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-02-28 20:20:32,351 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:20:32,351 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:32,351 INFO  L85        PathProgramCache]: Analyzing trace with hash -1193513852, now seen corresponding path program 1 times
[2024-02-28 20:20:32,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:32,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690506133]
[2024-02-28 20:20:32,352 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:32,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:32,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:32,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:32,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:32,477 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690506133]
[2024-02-28 20:20:32,477 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690506133] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:32,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:32,477 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-02-28 20:20:32,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660110427]
[2024-02-28 20:20:32,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:32,478 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 20:20:32,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:32,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 20:20:32,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-02-28 20:20:32,602 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183
[2024-02-28 20:20:32,603 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 581 transitions, 6422 flow. Second operand  has 8 states, 8 states have (on average 157.625) internal successors, (1261), 8 states have internal predecessors, (1261), 0 states have call successors, (0), 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-02-28 20:20:32,603 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:32,603 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183
[2024-02-28 20:20:32,603 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:34,389 INFO  L124   PetriNetUnfolderBase]: 2042/8955 cut-off events.
[2024-02-28 20:20:34,389 INFO  L125   PetriNetUnfolderBase]: For 57706/57941 co-relation queries the response was YES.
[2024-02-28 20:20:34,455 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34275 conditions, 8955 events. 2042/8955 cut-off events. For 57706/57941 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 98530 event pairs, 248 based on Foata normal form. 156/8909 useless extension candidates. Maximal degree in co-relation 33145. Up to 1168 conditions per place. 
[2024-02-28 20:20:34,476 INFO  L140   encePairwiseOnDemand]: 169/183 looper letters, 111 selfloop transitions, 35 changer transitions 82/653 dead transitions.
[2024-02-28 20:20:34,476 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 653 transitions, 7058 flow
[2024-02-28 20:20:34,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-02-28 20:20:34,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-02-28 20:20:34,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2449 transitions.
[2024-02-28 20:20:34,479 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8921675774134791
[2024-02-28 20:20:34,479 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 2449 transitions.
[2024-02-28 20:20:34,479 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 2449 transitions.
[2024-02-28 20:20:34,480 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:34,480 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2449 transitions.
[2024-02-28 20:20:34,483 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 163.26666666666668) internal successors, (2449), 15 states have internal predecessors, (2449), 0 states have call successors, (0), 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-02-28 20:20:34,484 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 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-02-28 20:20:34,485 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 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-02-28 20:20:34,485 INFO  L175             Difference]: Start difference. First operand has 353 places, 581 transitions, 6422 flow. Second operand 15 states and 2449 transitions.
[2024-02-28 20:20:34,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 653 transitions, 7058 flow
[2024-02-28 20:20:34,768 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 653 transitions, 7040 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-02-28 20:20:34,774 INFO  L231             Difference]: Finished difference. Result has 373 places, 530 transitions, 4913 flow
[2024-02-28 20:20:34,774 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=6404, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4913, PETRI_PLACES=373, PETRI_TRANSITIONS=530}
[2024-02-28 20:20:34,775 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 198 predicate places.
[2024-02-28 20:20:34,775 INFO  L495      AbstractCegarLoop]: Abstraction has has 373 places, 530 transitions, 4913 flow
[2024-02-28 20:20:34,775 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 157.625) internal successors, (1261), 8 states have internal predecessors, (1261), 0 states have call successors, (0), 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-02-28 20:20:34,775 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:34,775 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-28 20:20:34,775 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-02-28 20:20:34,776 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:20:34,776 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:34,776 INFO  L85        PathProgramCache]: Analyzing trace with hash 1930847042, now seen corresponding path program 1 times
[2024-02-28 20:20:34,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:34,776 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914903554]
[2024-02-28 20:20:34,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:34,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:34,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:34,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 20:20:34,806 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:34,806 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914903554]
[2024-02-28 20:20:34,806 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914903554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:34,806 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:34,807 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 20:20:34,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259122339]
[2024-02-28 20:20:34,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:34,807 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:20:34,807 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:34,807 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:20:34,807 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:20:34,822 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 183
[2024-02-28 20:20:34,823 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 530 transitions, 4913 flow. Second operand  has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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-02-28 20:20:34,823 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:34,823 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 183
[2024-02-28 20:20:34,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:36,062 INFO  L124   PetriNetUnfolderBase]: 1392/7571 cut-off events.
[2024-02-28 20:20:36,062 INFO  L125   PetriNetUnfolderBase]: For 40903/41129 co-relation queries the response was YES.
[2024-02-28 20:20:36,100 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27018 conditions, 7571 events. 1392/7571 cut-off events. For 40903/41129 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 84893 event pairs, 106 based on Foata normal form. 80/7465 useless extension candidates. Maximal degree in co-relation 26613. Up to 842 conditions per place. 
[2024-02-28 20:20:36,111 INFO  L140   encePairwiseOnDemand]: 180/183 looper letters, 13 selfloop transitions, 6 changer transitions 109/531 dead transitions.
[2024-02-28 20:20:36,111 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 531 transitions, 4953 flow
[2024-02-28 20:20:36,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:20:36,111 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:20:36,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions.
[2024-02-28 20:20:36,112 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9581056466302368
[2024-02-28 20:20:36,112 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 526 transitions.
[2024-02-28 20:20:36,112 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions.
[2024-02-28 20:20:36,112 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:36,112 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions.
[2024-02-28 20:20:36,113 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 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-02-28 20:20:36,113 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:20:36,113 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-28 20:20:36,114 INFO  L175             Difference]: Start difference. First operand has 373 places, 530 transitions, 4913 flow. Second operand 3 states and 526 transitions.
[2024-02-28 20:20:36,114 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 531 transitions, 4953 flow
[2024-02-28 20:20:36,286 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 531 transitions, 4813 flow, removed 67 selfloop flow, removed 5 redundant places.
[2024-02-28 20:20:36,291 INFO  L231             Difference]: Finished difference. Result has 367 places, 422 transitions, 3030 flow
[2024-02-28 20:20:36,292 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4773, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3030, PETRI_PLACES=367, PETRI_TRANSITIONS=422}
[2024-02-28 20:20:36,292 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 192 predicate places.
[2024-02-28 20:20:36,292 INFO  L495      AbstractCegarLoop]: Abstraction has has 367 places, 422 transitions, 3030 flow
[2024-02-28 20:20:36,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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-02-28 20:20:36,292 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:36,293 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1]
[2024-02-28 20:20:36,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-02-28 20:20:36,293 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:20:36,293 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:36,293 INFO  L85        PathProgramCache]: Analyzing trace with hash -1576417100, now seen corresponding path program 1 times
[2024-02-28 20:20:36,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:36,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443544334]
[2024-02-28 20:20:36,293 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:36,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:36,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:36,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-02-28 20:20:36,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:36,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443544334]
[2024-02-28 20:20:36,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443544334] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:20:36,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247971487]
[2024-02-28 20:20:36,377 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:36,377 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:20:36,378 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:20:36,379 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:20:36,380 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-02-28 20:20:36,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:36,517 INFO  L262         TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core
[2024-02-28 20:20:36,520 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:20:36,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:36,647 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:20:36,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [247971487] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:36,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:20:36,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10
[2024-02-28 20:20:36,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538615394]
[2024-02-28 20:20:36,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:36,648 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-02-28 20:20:36,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:36,648 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-02-28 20:20:36,648 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-02-28 20:20:36,712 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 161 out of 183
[2024-02-28 20:20:36,713 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 422 transitions, 3030 flow. Second operand  has 7 states, 7 states have (on average 163.28571428571428) internal successors, (1143), 7 states have internal predecessors, (1143), 0 states have call successors, (0), 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-02-28 20:20:36,713 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:36,713 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 183
[2024-02-28 20:20:36,713 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:37,863 INFO  L124   PetriNetUnfolderBase]: 1171/6598 cut-off events.
[2024-02-28 20:20:37,863 INFO  L125   PetriNetUnfolderBase]: For 22565/22859 co-relation queries the response was YES.
[2024-02-28 20:20:37,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20899 conditions, 6598 events. 1171/6598 cut-off events. For 22565/22859 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 72787 event pairs, 85 based on Foata normal form. 80/6476 useless extension candidates. Maximal degree in co-relation 20790. Up to 435 conditions per place. 
[2024-02-28 20:20:37,912 INFO  L140   encePairwiseOnDemand]: 171/183 looper letters, 48 selfloop transitions, 91 changer transitions 0/474 dead transitions.
[2024-02-28 20:20:37,913 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 474 transitions, 3724 flow
[2024-02-28 20:20:37,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-02-28 20:20:37,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-02-28 20:20:37,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2147 transitions.
[2024-02-28 20:20:37,915 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9024800336275746
[2024-02-28 20:20:37,915 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 2147 transitions.
[2024-02-28 20:20:37,915 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 2147 transitions.
[2024-02-28 20:20:37,915 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:37,915 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2147 transitions.
[2024-02-28 20:20:37,917 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 165.15384615384616) internal successors, (2147), 13 states have internal predecessors, (2147), 0 states have call successors, (0), 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-02-28 20:20:37,919 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 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-02-28 20:20:37,919 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 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-02-28 20:20:37,919 INFO  L175             Difference]: Start difference. First operand has 367 places, 422 transitions, 3030 flow. Second operand 13 states and 2147 transitions.
[2024-02-28 20:20:37,919 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 474 transitions, 3724 flow
[2024-02-28 20:20:38,022 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 474 transitions, 3476 flow, removed 55 selfloop flow, removed 27 redundant places.
[2024-02-28 20:20:38,026 INFO  L231             Difference]: Finished difference. Result has 343 places, 459 transitions, 3386 flow
[2024-02-28 20:20:38,027 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2782, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3386, PETRI_PLACES=343, PETRI_TRANSITIONS=459}
[2024-02-28 20:20:38,027 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 168 predicate places.
[2024-02-28 20:20:38,027 INFO  L495      AbstractCegarLoop]: Abstraction has has 343 places, 459 transitions, 3386 flow
[2024-02-28 20:20:38,027 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 163.28571428571428) internal successors, (1143), 7 states have internal predecessors, (1143), 0 states have call successors, (0), 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-02-28 20:20:38,027 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:38,028 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-28 20:20:38,033 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-02-28 20:20:38,231 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2024-02-28 20:20:38,232 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:20:38,233 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:38,233 INFO  L85        PathProgramCache]: Analyzing trace with hash 400168681, now seen corresponding path program 1 times
[2024-02-28 20:20:38,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:38,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965977138]
[2024-02-28 20:20:38,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:38,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:38,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 20:20:38,261 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 20:20:38,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 20:20:38,301 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 20:20:38,301 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 20:20:38,302 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2024-02-28 20:20:38,303 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-02-28 20:20:38,303 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-02-28 20:20:38,303 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-02-28 20:20:38,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-02-28 20:20:38,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-02-28 20:20:38,305 INFO  L445         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:20:38,306 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 20:20:38,306 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 20:20:38,324 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 20:20:38,327 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 220 places, 230 transitions, 476 flow
[2024-02-28 20:20:38,370 INFO  L124   PetriNetUnfolderBase]: 27/455 cut-off events.
[2024-02-28 20:20:38,370 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-02-28 20:20:38,371 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 467 conditions, 455 events. 27/455 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1177 event pairs, 0 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 270. Up to 9 conditions per place. 
[2024-02-28 20:20:38,371 INFO  L82        GeneralOperation]: Start removeDead. Operand has 220 places, 230 transitions, 476 flow
[2024-02-28 20:20:38,373 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 220 places, 230 transitions, 476 flow
[2024-02-28 20:20:38,374 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 20:20:38,374 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;@4744a2aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 20:20:38,374 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2024-02-28 20:20:38,376 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 20:20:38,376 INFO  L124   PetriNetUnfolderBase]: 2/34 cut-off events.
[2024-02-28 20:20:38,376 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 20:20:38,376 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:38,376 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]
[2024-02-28 20:20:38,376 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:38,376 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:38,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 1587559683, now seen corresponding path program 1 times
[2024-02-28 20:20:38,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:38,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870291565]
[2024-02-28 20:20:38,377 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:38,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:38,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:38,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:38,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:38,390 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870291565]
[2024-02-28 20:20:38,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870291565] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:38,390 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:38,390 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:20:38,390 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574128072]
[2024-02-28 20:20:38,390 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:38,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:20:38,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:38,391 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:20:38,391 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:20:38,406 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-02-28 20:20:38,406 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 230 transitions, 476 flow. Second operand  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 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-02-28 20:20:38,406 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:38,406 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-02-28 20:20:38,406 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:38,502 INFO  L124   PetriNetUnfolderBase]: 67/976 cut-off events.
[2024-02-28 20:20:38,502 INFO  L125   PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-02-28 20:20:38,505 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 976 events. 67/976 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4481 event pairs, 16 based on Foata normal form. 10/835 useless extension candidates. Maximal degree in co-relation 607. Up to 50 conditions per place. 
[2024-02-28 20:20:38,506 INFO  L140   encePairwiseOnDemand]: 223/230 looper letters, 11 selfloop transitions, 2 changer transitions 2/225 dead transitions.
[2024-02-28 20:20:38,506 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 225 transitions, 492 flow
[2024-02-28 20:20:38,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:20:38,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:20:38,507 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions.
[2024-02-28 20:20:38,507 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478260869565217
[2024-02-28 20:20:38,507 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 654 transitions.
[2024-02-28 20:20:38,508 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 654 transitions.
[2024-02-28 20:20:38,508 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:38,508 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 654 transitions.
[2024-02-28 20:20:38,508 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 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-02-28 20:20:38,509 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 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-02-28 20:20:38,509 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 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-02-28 20:20:38,509 INFO  L175             Difference]: Start difference. First operand has 220 places, 230 transitions, 476 flow. Second operand 3 states and 654 transitions.
[2024-02-28 20:20:38,509 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 225 transitions, 492 flow
[2024-02-28 20:20:38,510 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 225 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:20:38,512 INFO  L231             Difference]: Finished difference. Result has 221 places, 223 transitions, 466 flow
[2024-02-28 20:20:38,512 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=221, PETRI_TRANSITIONS=223}
[2024-02-28 20:20:38,512 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 1 predicate places.
[2024-02-28 20:20:38,512 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 223 transitions, 466 flow
[2024-02-28 20:20:38,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 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-02-28 20:20:38,512 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:38,513 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-02-28 20:20:38,513 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-02-28 20:20:38,513 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:38,513 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:38,513 INFO  L85        PathProgramCache]: Analyzing trace with hash -480238048, now seen corresponding path program 1 times
[2024-02-28 20:20:38,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:38,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143004890]
[2024-02-28 20:20:38,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:38,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:38,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:38,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:38,525 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:38,526 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143004890]
[2024-02-28 20:20:38,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143004890] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:38,526 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:38,526 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:20:38,526 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295460472]
[2024-02-28 20:20:38,526 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:38,526 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:20:38,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:38,526 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:20:38,526 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:20:38,549 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 207 out of 230
[2024-02-28 20:20:38,550 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 223 transitions, 466 flow. Second operand  has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 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-02-28 20:20:38,550 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:38,550 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 230
[2024-02-28 20:20:38,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:38,822 INFO  L124   PetriNetUnfolderBase]: 486/3131 cut-off events.
[2024-02-28 20:20:38,822 INFO  L125   PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES.
[2024-02-28 20:20:38,830 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3698 conditions, 3131 events. 486/3131 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 25889 event pairs, 113 based on Foata normal form. 0/2650 useless extension candidates. Maximal degree in co-relation 3658. Up to 322 conditions per place. 
[2024-02-28 20:20:38,837 INFO  L140   encePairwiseOnDemand]: 215/230 looper letters, 22 selfloop transitions, 11 changer transitions 0/237 dead transitions.
[2024-02-28 20:20:38,837 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 237 transitions, 571 flow
[2024-02-28 20:20:38,837 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:20:38,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:20:38,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions.
[2024-02-28 20:20:38,838 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9536231884057971
[2024-02-28 20:20:38,838 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 658 transitions.
[2024-02-28 20:20:38,838 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions.
[2024-02-28 20:20:38,838 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:38,838 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions.
[2024-02-28 20:20:38,839 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 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-02-28 20:20:38,839 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 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-02-28 20:20:38,839 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 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-02-28 20:20:38,839 INFO  L175             Difference]: Start difference. First operand has 221 places, 223 transitions, 466 flow. Second operand 3 states and 658 transitions.
[2024-02-28 20:20:38,840 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 237 transitions, 571 flow
[2024-02-28 20:20:38,841 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 237 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:20:38,842 INFO  L231             Difference]: Finished difference. Result has 221 places, 234 transitions, 558 flow
[2024-02-28 20:20:38,843 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=221, PETRI_TRANSITIONS=234}
[2024-02-28 20:20:38,843 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 1 predicate places.
[2024-02-28 20:20:38,843 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 234 transitions, 558 flow
[2024-02-28 20:20:38,843 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 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-02-28 20:20:38,843 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:38,843 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]
[2024-02-28 20:20:38,843 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-02-28 20:20:38,843 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:38,844 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:38,844 INFO  L85        PathProgramCache]: Analyzing trace with hash -640223273, now seen corresponding path program 1 times
[2024-02-28 20:20:38,844 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:38,844 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395135457]
[2024-02-28 20:20:38,844 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:38,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:38,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:38,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:38,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:38,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395135457]
[2024-02-28 20:20:38,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395135457] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:38,875 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:38,875 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:20:38,875 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666374363]
[2024-02-28 20:20:38,875 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:38,875 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-02-28 20:20:38,875 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:38,876 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-02-28 20:20:38,876 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-02-28 20:20:38,922 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 211 out of 230
[2024-02-28 20:20:38,923 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 234 transitions, 558 flow. Second operand  has 5 states, 5 states have (on average 212.4) internal successors, (1062), 5 states have internal predecessors, (1062), 0 states have call successors, (0), 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-02-28 20:20:38,923 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:38,923 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 230
[2024-02-28 20:20:38,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:39,202 INFO  L124   PetriNetUnfolderBase]: 453/2967 cut-off events.
[2024-02-28 20:20:39,202 INFO  L125   PetriNetUnfolderBase]: For 227/276 co-relation queries the response was YES.
[2024-02-28 20:20:39,209 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3741 conditions, 2967 events. 453/2967 cut-off events. For 227/276 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 23923 event pairs, 107 based on Foata normal form. 2/2578 useless extension candidates. Maximal degree in co-relation 2310. Up to 307 conditions per place. 
[2024-02-28 20:20:39,214 INFO  L140   encePairwiseOnDemand]: 222/230 looper letters, 14 selfloop transitions, 6 changer transitions 1/240 dead transitions.
[2024-02-28 20:20:39,214 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 240 transitions, 612 flow
[2024-02-28 20:20:39,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:20:39,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:20:39,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1288 transitions.
[2024-02-28 20:20:39,216 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9333333333333333
[2024-02-28 20:20:39,216 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1288 transitions.
[2024-02-28 20:20:39,216 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1288 transitions.
[2024-02-28 20:20:39,216 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:39,216 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1288 transitions.
[2024-02-28 20:20:39,217 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 214.66666666666666) internal successors, (1288), 6 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-02-28 20:20:39,218 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-02-28 20:20:39,219 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-02-28 20:20:39,219 INFO  L175             Difference]: Start difference. First operand has 221 places, 234 transitions, 558 flow. Second operand 6 states and 1288 transitions.
[2024-02-28 20:20:39,219 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 240 transitions, 612 flow
[2024-02-28 20:20:39,221 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 240 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:20:39,222 INFO  L231             Difference]: Finished difference. Result has 228 places, 239 transitions, 582 flow
[2024-02-28 20:20:39,223 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=582, PETRI_PLACES=228, PETRI_TRANSITIONS=239}
[2024-02-28 20:20:39,223 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 8 predicate places.
[2024-02-28 20:20:39,223 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 239 transitions, 582 flow
[2024-02-28 20:20:39,223 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 212.4) internal successors, (1062), 5 states have internal predecessors, (1062), 0 states have call successors, (0), 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-02-28 20:20:39,223 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:39,224 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]
[2024-02-28 20:20:39,224 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-02-28 20:20:39,224 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:39,224 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:39,224 INFO  L85        PathProgramCache]: Analyzing trace with hash -1575847038, now seen corresponding path program 1 times
[2024-02-28 20:20:39,224 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:39,224 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71532909]
[2024-02-28 20:20:39,224 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:39,224 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:39,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:39,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:39,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:39,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71532909]
[2024-02-28 20:20:39,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71532909] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:39,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:39,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:20:39,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803615382]
[2024-02-28 20:20:39,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:39,355 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:20:39,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:39,355 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:20:39,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:20:39,526 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 192 out of 230
[2024-02-28 20:20:39,527 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 239 transitions, 582 flow. Second operand  has 6 states, 6 states have (on average 193.16666666666666) internal successors, (1159), 6 states have internal predecessors, (1159), 0 states have call successors, (0), 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-02-28 20:20:39,527 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:39,527 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 230
[2024-02-28 20:20:39,527 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:41,575 INFO  L124   PetriNetUnfolderBase]: 3950/17927 cut-off events.
[2024-02-28 20:20:41,575 INFO  L125   PetriNetUnfolderBase]: For 277/291 co-relation queries the response was YES.
[2024-02-28 20:20:41,636 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24213 conditions, 17927 events. 3950/17927 cut-off events. For 277/291 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 213330 event pairs, 575 based on Foata normal form. 12/15594 useless extension candidates. Maximal degree in co-relation 24069. Up to 2931 conditions per place. 
[2024-02-28 20:20:41,687 INFO  L140   encePairwiseOnDemand]: 203/230 looper letters, 46 selfloop transitions, 48 changer transitions 0/299 dead transitions.
[2024-02-28 20:20:41,688 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 299 transitions, 901 flow
[2024-02-28 20:20:41,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:20:41,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:20:41,689 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1249 transitions.
[2024-02-28 20:20:41,690 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9050724637681159
[2024-02-28 20:20:41,690 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1249 transitions.
[2024-02-28 20:20:41,690 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1249 transitions.
[2024-02-28 20:20:41,690 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:41,690 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1249 transitions.
[2024-02-28 20:20:41,766 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 0 states have call successors, (0), 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-02-28 20:20:41,767 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-02-28 20:20:41,767 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-02-28 20:20:41,768 INFO  L175             Difference]: Start difference. First operand has 228 places, 239 transitions, 582 flow. Second operand 6 states and 1249 transitions.
[2024-02-28 20:20:41,768 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 299 transitions, 901 flow
[2024-02-28 20:20:41,770 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 299 transitions, 899 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 20:20:41,772 INFO  L231             Difference]: Finished difference. Result has 237 places, 287 transitions, 922 flow
[2024-02-28 20:20:41,772 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=237, PETRI_TRANSITIONS=287}
[2024-02-28 20:20:41,773 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 17 predicate places.
[2024-02-28 20:20:41,773 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 287 transitions, 922 flow
[2024-02-28 20:20:41,773 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 193.16666666666666) internal successors, (1159), 6 states have internal predecessors, (1159), 0 states have call successors, (0), 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-02-28 20:20:41,773 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:41,773 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]
[2024-02-28 20:20:41,773 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-02-28 20:20:41,773 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:41,773 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:41,774 INFO  L85        PathProgramCache]: Analyzing trace with hash 377943158, now seen corresponding path program 1 times
[2024-02-28 20:20:41,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:41,774 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905631820]
[2024-02-28 20:20:41,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:41,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:41,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:41,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:41,791 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:41,791 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905631820]
[2024-02-28 20:20:41,791 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905631820] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:41,791 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:41,791 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:20:41,791 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560196203]
[2024-02-28 20:20:41,791 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:41,791 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:20:41,792 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:41,792 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:20:41,792 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:20:41,809 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-02-28 20:20:41,809 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 287 transitions, 922 flow. Second operand  has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 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-02-28 20:20:41,809 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:41,809 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-02-28 20:20:41,809 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:43,486 INFO  L124   PetriNetUnfolderBase]: 4008/19792 cut-off events.
[2024-02-28 20:20:43,486 INFO  L125   PetriNetUnfolderBase]: For 1583/1589 co-relation queries the response was YES.
[2024-02-28 20:20:43,547 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29209 conditions, 19792 events. 4008/19792 cut-off events. For 1583/1589 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 246947 event pairs, 516 based on Foata normal form. 0/17384 useless extension candidates. Maximal degree in co-relation 13273. Up to 2273 conditions per place. 
[2024-02-28 20:20:43,595 INFO  L140   encePairwiseOnDemand]: 224/230 looper letters, 12 selfloop transitions, 3 changer transitions 4/288 dead transitions.
[2024-02-28 20:20:43,595 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 288 transitions, 959 flow
[2024-02-28 20:20:43,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:20:43,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:20:43,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions.
[2024-02-28 20:20:43,597 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478260869565217
[2024-02-28 20:20:43,597 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 654 transitions.
[2024-02-28 20:20:43,597 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 654 transitions.
[2024-02-28 20:20:43,597 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:43,597 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 654 transitions.
[2024-02-28 20:20:43,597 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 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-02-28 20:20:43,598 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 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-02-28 20:20:43,598 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 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-02-28 20:20:43,598 INFO  L175             Difference]: Start difference. First operand has 237 places, 287 transitions, 922 flow. Second operand 3 states and 654 transitions.
[2024-02-28 20:20:43,598 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 288 transitions, 959 flow
[2024-02-28 20:20:43,610 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 288 transitions, 959 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:20:43,612 INFO  L231             Difference]: Finished difference. Result has 237 places, 283 transitions, 913 flow
[2024-02-28 20:20:43,612 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=913, PETRI_PLACES=237, PETRI_TRANSITIONS=283}
[2024-02-28 20:20:43,613 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 17 predicate places.
[2024-02-28 20:20:43,613 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 283 transitions, 913 flow
[2024-02-28 20:20:43,613 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 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-02-28 20:20:43,613 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:43,613 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-02-28 20:20:43,613 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-02-28 20:20:43,613 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:43,614 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:43,614 INFO  L85        PathProgramCache]: Analyzing trace with hash 608546055, now seen corresponding path program 1 times
[2024-02-28 20:20:43,614 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:43,614 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818452385]
[2024-02-28 20:20:43,614 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:43,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:43,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:43,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:43,649 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:43,649 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818452385]
[2024-02-28 20:20:43,649 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818452385] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:43,649 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:43,649 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:20:43,650 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805234416]
[2024-02-28 20:20:43,650 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:43,650 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:20:43,650 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:43,651 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:20:43,651 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:20:43,718 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-02-28 20:20:43,719 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 283 transitions, 913 flow. Second operand  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 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-02-28 20:20:43,719 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:43,719 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-02-28 20:20:43,719 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:44,141 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([511] L1059-5-->L1059-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][159], [Black: 245#true, 72#L1041-8true, 193#L1041-10true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), 153#L1059-6true, Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 236#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 237#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-02-28 20:20:44,141 INFO  L294   olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event
[2024-02-28 20:20:44,141 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-02-28 20:20:44,141 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-02-28 20:20:44,141 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-02-28 20:20:45,420 INFO  L124   PetriNetUnfolderBase]: 3535/17311 cut-off events.
[2024-02-28 20:20:45,420 INFO  L125   PetriNetUnfolderBase]: For 1691/1696 co-relation queries the response was YES.
[2024-02-28 20:20:45,489 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26979 conditions, 17311 events. 3535/17311 cut-off events. For 1691/1696 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 210740 event pairs, 576 based on Foata normal form. 1/15363 useless extension candidates. Maximal degree in co-relation 25319. Up to 1977 conditions per place. 
[2024-02-28 20:20:45,538 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 15 selfloop transitions, 4 changer transitions 0/288 dead transitions.
[2024-02-28 20:20:45,538 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 288 transitions, 961 flow
[2024-02-28 20:20:45,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:20:45,539 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:20:45,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions.
[2024-02-28 20:20:45,540 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9434782608695652
[2024-02-28 20:20:45,540 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 868 transitions.
[2024-02-28 20:20:45,540 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 868 transitions.
[2024-02-28 20:20:45,540 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:45,540 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 868 transitions.
[2024-02-28 20:20:45,541 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-02-28 20:20:45,542 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 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-02-28 20:20:45,542 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 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-02-28 20:20:45,542 INFO  L175             Difference]: Start difference. First operand has 237 places, 283 transitions, 913 flow. Second operand 4 states and 868 transitions.
[2024-02-28 20:20:45,542 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 288 transitions, 961 flow
[2024-02-28 20:20:45,559 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 288 transitions, 951 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-02-28 20:20:45,561 INFO  L231             Difference]: Finished difference. Result has 236 places, 286 transitions, 928 flow
[2024-02-28 20:20:45,562 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=928, PETRI_PLACES=236, PETRI_TRANSITIONS=286}
[2024-02-28 20:20:45,562 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 16 predicate places.
[2024-02-28 20:20:45,562 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 286 transitions, 928 flow
[2024-02-28 20:20:45,562 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 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-02-28 20:20:45,562 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:45,562 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-02-28 20:20:45,562 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-02-28 20:20:45,563 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:45,563 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:45,563 INFO  L85        PathProgramCache]: Analyzing trace with hash 1289104573, now seen corresponding path program 1 times
[2024-02-28 20:20:45,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:45,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477179183]
[2024-02-28 20:20:45,563 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:45,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:45,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:45,597 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:45,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:45,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477179183]
[2024-02-28 20:20:45,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477179183] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:45,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:45,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:20:45,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635935717]
[2024-02-28 20:20:45,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:45,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:20:45,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:45,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:20:45,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:20:45,655 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-02-28 20:20:45,656 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 286 transitions, 928 flow. Second operand  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 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-02-28 20:20:45,656 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:45,656 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-02-28 20:20:45,656 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:46,074 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([511] L1059-5-->L1059-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][158], [Black: 245#true, 72#L1041-8true, Black: 257#true, 193#L1041-10true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 153#L1059-6true, Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-02-28 20:20:46,074 INFO  L294   olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event
[2024-02-28 20:20:46,074 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-02-28 20:20:46,075 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-02-28 20:20:46,075 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-02-28 20:20:47,211 INFO  L124   PetriNetUnfolderBase]: 3534/17309 cut-off events.
[2024-02-28 20:20:47,211 INFO  L125   PetriNetUnfolderBase]: For 1725/1730 co-relation queries the response was YES.
[2024-02-28 20:20:47,280 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26940 conditions, 17309 events. 3534/17309 cut-off events. For 1725/1730 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 210825 event pairs, 576 based on Foata normal form. 1/15314 useless extension candidates. Maximal degree in co-relation 25279. Up to 1977 conditions per place. 
[2024-02-28 20:20:47,331 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 14 selfloop transitions, 4 changer transitions 0/287 dead transitions.
[2024-02-28 20:20:47,331 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 287 transitions, 966 flow
[2024-02-28 20:20:47,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:20:47,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:20:47,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 867 transitions.
[2024-02-28 20:20:47,333 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9423913043478261
[2024-02-28 20:20:47,333 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 867 transitions.
[2024-02-28 20:20:47,333 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 867 transitions.
[2024-02-28 20:20:47,333 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:47,333 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 867 transitions.
[2024-02-28 20:20:47,334 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 216.75) internal successors, (867), 4 states have internal predecessors, (867), 0 states have call successors, (0), 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-02-28 20:20:47,335 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 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-02-28 20:20:47,335 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 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-02-28 20:20:47,335 INFO  L175             Difference]: Start difference. First operand has 236 places, 286 transitions, 928 flow. Second operand 4 states and 867 transitions.
[2024-02-28 20:20:47,335 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 287 transitions, 966 flow
[2024-02-28 20:20:47,352 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 287 transitions, 966 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:20:47,355 INFO  L231             Difference]: Finished difference. Result has 241 places, 287 transitions, 947 flow
[2024-02-28 20:20:47,355 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=947, PETRI_PLACES=241, PETRI_TRANSITIONS=287}
[2024-02-28 20:20:47,355 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 21 predicate places.
[2024-02-28 20:20:47,355 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 287 transitions, 947 flow
[2024-02-28 20:20:47,356 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 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-02-28 20:20:47,356 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:47,356 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]
[2024-02-28 20:20:47,356 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-02-28 20:20:47,356 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:47,356 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:47,356 INFO  L85        PathProgramCache]: Analyzing trace with hash 50928800, now seen corresponding path program 1 times
[2024-02-28 20:20:47,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:47,357 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922986158]
[2024-02-28 20:20:47,357 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:47,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:47,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:47,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-02-28 20:20:47,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:47,401 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922986158]
[2024-02-28 20:20:47,401 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922986158] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:47,401 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:47,401 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:20:47,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113637085]
[2024-02-28 20:20:47,402 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:47,402 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:20:47,402 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:47,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:20:47,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:20:47,474 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-02-28 20:20:47,475 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 287 transitions, 947 flow. Second operand  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 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-02-28 20:20:47,475 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:47,475 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-02-28 20:20:47,475 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:47,908 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([511] L1059-5-->L1059-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][161], [Black: 245#true, 72#L1041-8true, 193#L1041-10true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 276#true, 269#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 153#L1059-6true, Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-02-28 20:20:47,908 INFO  L294   olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event
[2024-02-28 20:20:47,908 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-02-28 20:20:47,909 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-02-28 20:20:47,909 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-02-28 20:20:49,185 INFO  L124   PetriNetUnfolderBase]: 3534/17308 cut-off events.
[2024-02-28 20:20:49,185 INFO  L125   PetriNetUnfolderBase]: For 1837/1842 co-relation queries the response was YES.
[2024-02-28 20:20:49,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27049 conditions, 17308 events. 3534/17308 cut-off events. For 1837/1842 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 210878 event pairs, 576 based on Foata normal form. 1/15364 useless extension candidates. Maximal degree in co-relation 26940. Up to 1977 conditions per place. 
[2024-02-28 20:20:49,309 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 15 selfloop transitions, 4 changer transitions 0/288 dead transitions.
[2024-02-28 20:20:49,309 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 288 transitions, 987 flow
[2024-02-28 20:20:49,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:20:49,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:20:49,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions.
[2024-02-28 20:20:49,311 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9434782608695652
[2024-02-28 20:20:49,311 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 868 transitions.
[2024-02-28 20:20:49,311 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 868 transitions.
[2024-02-28 20:20:49,311 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:49,311 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 868 transitions.
[2024-02-28 20:20:49,312 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-02-28 20:20:49,312 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 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-02-28 20:20:49,312 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 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-02-28 20:20:49,312 INFO  L175             Difference]: Start difference. First operand has 241 places, 287 transitions, 947 flow. Second operand 4 states and 868 transitions.
[2024-02-28 20:20:49,312 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 288 transitions, 987 flow
[2024-02-28 20:20:49,331 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 288 transitions, 984 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 20:20:49,334 INFO  L231             Difference]: Finished difference. Result has 244 places, 287 transitions, 956 flow
[2024-02-28 20:20:49,334 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=956, PETRI_PLACES=244, PETRI_TRANSITIONS=287}
[2024-02-28 20:20:49,334 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 24 predicate places.
[2024-02-28 20:20:49,334 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 287 transitions, 956 flow
[2024-02-28 20:20:49,335 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 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-02-28 20:20:49,335 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:49,335 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]
[2024-02-28 20:20:49,335 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-02-28 20:20:49,335 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:49,335 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:49,335 INFO  L85        PathProgramCache]: Analyzing trace with hash -326593622, now seen corresponding path program 1 times
[2024-02-28 20:20:49,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:49,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502797422]
[2024-02-28 20:20:49,336 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:49,336 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:49,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:49,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:49,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:49,364 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502797422]
[2024-02-28 20:20:49,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502797422] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:49,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:49,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:20:49,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300354205]
[2024-02-28 20:20:49,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:49,365 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:20:49,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:49,365 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:20:49,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:20:49,451 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 211 out of 230
[2024-02-28 20:20:49,452 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 287 transitions, 956 flow. Second operand  has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 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-02-28 20:20:49,452 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:49,452 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 230
[2024-02-28 20:20:49,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:49,877 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([511] L1059-5-->L1059-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][160], [Black: 245#true, 72#L1041-8true, Black: 257#true, 193#L1041-10true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 153#L1059-6true, Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 282#true, 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-02-28 20:20:49,877 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event
[2024-02-28 20:20:49,877 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-02-28 20:20:49,877 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-02-28 20:20:49,877 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-02-28 20:20:51,159 INFO  L124   PetriNetUnfolderBase]: 3553/17346 cut-off events.
[2024-02-28 20:20:51,160 INFO  L125   PetriNetUnfolderBase]: For 1908/1913 co-relation queries the response was YES.
[2024-02-28 20:20:51,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27218 conditions, 17346 events. 3553/17346 cut-off events. For 1908/1913 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 211627 event pairs, 594 based on Foata normal form. 1/15385 useless extension candidates. Maximal degree in co-relation 27108. Up to 1977 conditions per place. 
[2024-02-28 20:20:51,286 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 15 selfloop transitions, 4 changer transitions 0/287 dead transitions.
[2024-02-28 20:20:51,287 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 287 transitions, 994 flow
[2024-02-28 20:20:51,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:20:51,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:20:51,288 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 864 transitions.
[2024-02-28 20:20:51,288 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9391304347826087
[2024-02-28 20:20:51,288 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 864 transitions.
[2024-02-28 20:20:51,288 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 864 transitions.
[2024-02-28 20:20:51,288 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:51,288 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 864 transitions.
[2024-02-28 20:20:51,290 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 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-02-28 20:20:51,291 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 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-02-28 20:20:51,291 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 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-02-28 20:20:51,291 INFO  L175             Difference]: Start difference. First operand has 244 places, 287 transitions, 956 flow. Second operand 4 states and 864 transitions.
[2024-02-28 20:20:51,291 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 287 transitions, 994 flow
[2024-02-28 20:20:51,310 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 287 transitions, 986 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 20:20:51,312 INFO  L231             Difference]: Finished difference. Result has 245 places, 287 transitions, 960 flow
[2024-02-28 20:20:51,313 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=960, PETRI_PLACES=245, PETRI_TRANSITIONS=287}
[2024-02-28 20:20:51,313 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 25 predicate places.
[2024-02-28 20:20:51,313 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 287 transitions, 960 flow
[2024-02-28 20:20:51,313 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 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-02-28 20:20:51,313 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:51,313 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]
[2024-02-28 20:20:51,313 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-02-28 20:20:51,314 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:51,314 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:51,314 INFO  L85        PathProgramCache]: Analyzing trace with hash -1151941717, now seen corresponding path program 1 times
[2024-02-28 20:20:51,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:51,314 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586570710]
[2024-02-28 20:20:51,314 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:51,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:51,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:51,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:51,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:51,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586570710]
[2024-02-28 20:20:51,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586570710] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:51,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:51,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:20:51,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081677826]
[2024-02-28 20:20:51,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:51,331 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:20:51,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:51,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:20:51,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:20:51,356 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 209 out of 230
[2024-02-28 20:20:51,357 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 287 transitions, 960 flow. Second operand  has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 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-02-28 20:20:51,357 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:51,357 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 230
[2024-02-28 20:20:51,357 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:51,803 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([511] L1059-5-->L1059-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][160], [Black: 245#true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 72#L1041-8true, Black: 257#true, 193#L1041-10true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), 290#true, Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), 153#L1059-6true, Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 282#true, 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-02-28 20:20:51,803 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event
[2024-02-28 20:20:51,803 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-02-28 20:20:51,803 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-02-28 20:20:51,803 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-02-28 20:20:53,205 INFO  L124   PetriNetUnfolderBase]: 3722/17554 cut-off events.
[2024-02-28 20:20:53,205 INFO  L125   PetriNetUnfolderBase]: For 2553/2781 co-relation queries the response was YES.
[2024-02-28 20:20:53,252 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27570 conditions, 17554 events. 3722/17554 cut-off events. For 2553/2781 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 213810 event pairs, 516 based on Foata normal form. 7/15432 useless extension candidates. Maximal degree in co-relation 27461. Up to 1802 conditions per place. 
[2024-02-28 20:20:53,285 INFO  L140   encePairwiseOnDemand]: 222/230 looper letters, 22 selfloop transitions, 12 changer transitions 0/297 dead transitions.
[2024-02-28 20:20:53,285 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 297 transitions, 1064 flow
[2024-02-28 20:20:53,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:20:53,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:20:53,286 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions.
[2024-02-28 20:20:53,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9434782608695652
[2024-02-28 20:20:53,286 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 651 transitions.
[2024-02-28 20:20:53,287 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions.
[2024-02-28 20:20:53,287 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:53,287 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions.
[2024-02-28 20:20:53,287 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 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-02-28 20:20:53,288 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 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-02-28 20:20:53,288 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 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-02-28 20:20:53,288 INFO  L175             Difference]: Start difference. First operand has 245 places, 287 transitions, 960 flow. Second operand 3 states and 651 transitions.
[2024-02-28 20:20:53,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 297 transitions, 1064 flow
[2024-02-28 20:20:53,299 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 297 transitions, 1056 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 20:20:53,301 INFO  L231             Difference]: Finished difference. Result has 246 places, 297 transitions, 1058 flow
[2024-02-28 20:20:53,301 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=246, PETRI_TRANSITIONS=297}
[2024-02-28 20:20:53,301 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 26 predicate places.
[2024-02-28 20:20:53,301 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 297 transitions, 1058 flow
[2024-02-28 20:20:53,301 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 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-02-28 20:20:53,302 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:53,302 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:20:53,302 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-02-28 20:20:53,302 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:53,302 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:53,302 INFO  L85        PathProgramCache]: Analyzing trace with hash 1792615543, now seen corresponding path program 1 times
[2024-02-28 20:20:53,302 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:53,302 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64562020]
[2024-02-28 20:20:53,302 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:53,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:53,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:53,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:20:53,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:53,475 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64562020]
[2024-02-28 20:20:53,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64562020] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:53,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:53,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:20:53,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899398928]
[2024-02-28 20:20:53,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:53,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:20:53,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:53,476 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:20:53,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:20:53,615 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230
[2024-02-28 20:20:53,616 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 297 transitions, 1058 flow. Second operand  has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 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-02-28 20:20:53,616 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:53,616 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230
[2024-02-28 20:20:53,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:20:58,236 INFO  L124   PetriNetUnfolderBase]: 10704/44179 cut-off events.
[2024-02-28 20:20:58,236 INFO  L125   PetriNetUnfolderBase]: For 10582/13982 co-relation queries the response was YES.
[2024-02-28 20:20:58,426 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76576 conditions, 44179 events. 10704/44179 cut-off events. For 10582/13982 co-relation queries the response was YES. Maximal size of possible extension queue 1216. Compared 611775 event pairs, 1775 based on Foata normal form. 53/38907 useless extension candidates. Maximal degree in co-relation 76339. Up to 8790 conditions per place. 
[2024-02-28 20:20:58,542 INFO  L140   encePairwiseOnDemand]: 203/230 looper letters, 103 selfloop transitions, 136 changer transitions 0/457 dead transitions.
[2024-02-28 20:20:58,542 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 457 transitions, 2248 flow
[2024-02-28 20:20:58,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:20:58,543 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:20:58,544 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1287 transitions.
[2024-02-28 20:20:58,544 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9326086956521739
[2024-02-28 20:20:58,544 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1287 transitions.
[2024-02-28 20:20:58,544 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1287 transitions.
[2024-02-28 20:20:58,545 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:20:58,545 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1287 transitions.
[2024-02-28 20:20:58,546 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 214.5) internal successors, (1287), 6 states have internal predecessors, (1287), 0 states have call successors, (0), 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-02-28 20:20:58,547 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-02-28 20:20:58,547 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-02-28 20:20:58,547 INFO  L175             Difference]: Start difference. First operand has 246 places, 297 transitions, 1058 flow. Second operand 6 states and 1287 transitions.
[2024-02-28 20:20:58,547 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 457 transitions, 2248 flow
[2024-02-28 20:20:58,594 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 457 transitions, 2224 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:20:58,598 INFO  L231             Difference]: Finished difference. Result has 253 places, 430 transitions, 2172 flow
[2024-02-28 20:20:58,598 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2172, PETRI_PLACES=253, PETRI_TRANSITIONS=430}
[2024-02-28 20:20:58,599 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 33 predicate places.
[2024-02-28 20:20:58,599 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 430 transitions, 2172 flow
[2024-02-28 20:20:58,599 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 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-02-28 20:20:58,599 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:20:58,599 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:20:58,600 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-02-28 20:20:58,600 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:20:58,600 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:20:58,600 INFO  L85        PathProgramCache]: Analyzing trace with hash -474188493, now seen corresponding path program 1 times
[2024-02-28 20:20:58,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:20:58,600 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808492897]
[2024-02-28 20:20:58,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:20:58,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:20:58,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:20:58,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:20:58,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:20:58,781 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808492897]
[2024-02-28 20:20:58,781 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808492897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:20:58,781 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:20:58,781 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:20:58,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142642085]
[2024-02-28 20:20:58,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:20:58,782 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:20:58,782 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:20:58,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:20:58,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:20:58,991 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230
[2024-02-28 20:20:58,992 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 430 transitions, 2172 flow. Second operand  has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 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-02-28 20:20:58,992 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:20:58,992 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230
[2024-02-28 20:20:58,992 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:21:04,757 INFO  L124   PetriNetUnfolderBase]: 11679/51482 cut-off events.
[2024-02-28 20:21:04,757 INFO  L125   PetriNetUnfolderBase]: For 24636/27144 co-relation queries the response was YES.
[2024-02-28 20:21:04,956 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96623 conditions, 51482 events. 11679/51482 cut-off events. For 24636/27144 co-relation queries the response was YES. Maximal size of possible extension queue 1560. Compared 752727 event pairs, 1352 based on Foata normal form. 173/45511 useless extension candidates. Maximal degree in co-relation 96375. Up to 7400 conditions per place. 
[2024-02-28 20:21:05,090 INFO  L140   encePairwiseOnDemand]: 215/230 looper letters, 110 selfloop transitions, 119 changer transitions 0/546 dead transitions.
[2024-02-28 20:21:05,090 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 546 transitions, 3498 flow
[2024-02-28 20:21:05,091 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:21:05,091 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:21:05,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions.
[2024-02-28 20:21:05,092 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9210144927536232
[2024-02-28 20:21:05,093 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1271 transitions.
[2024-02-28 20:21:05,093 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1271 transitions.
[2024-02-28 20:21:05,093 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:21:05,093 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1271 transitions.
[2024-02-28 20:21:05,094 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 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-02-28 20:21:05,095 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-02-28 20:21:05,095 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-02-28 20:21:05,096 INFO  L175             Difference]: Start difference. First operand has 253 places, 430 transitions, 2172 flow. Second operand 6 states and 1271 transitions.
[2024-02-28 20:21:05,096 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 546 transitions, 3498 flow
[2024-02-28 20:21:05,197 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 546 transitions, 3444 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-02-28 20:21:05,202 INFO  L231             Difference]: Finished difference. Result has 263 places, 544 transitions, 3538 flow
[2024-02-28 20:21:05,203 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3538, PETRI_PLACES=263, PETRI_TRANSITIONS=544}
[2024-02-28 20:21:05,203 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 43 predicate places.
[2024-02-28 20:21:05,203 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 544 transitions, 3538 flow
[2024-02-28 20:21:05,203 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 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-02-28 20:21:05,204 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:21:05,204 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:21:05,204 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-02-28 20:21:05,204 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:21:05,204 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:21:05,204 INFO  L85        PathProgramCache]: Analyzing trace with hash -1241473502, now seen corresponding path program 1 times
[2024-02-28 20:21:05,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:21:05,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689731175]
[2024-02-28 20:21:05,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:21:05,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:21:05,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:21:05,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:21:05,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:21:05,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689731175]
[2024-02-28 20:21:05,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689731175] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:21:05,486 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:21:05,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-02-28 20:21:05,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972142731]
[2024-02-28 20:21:05,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:21:05,486 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 20:21:05,487 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:21:05,487 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 20:21:05,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-02-28 20:21:05,897 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 185 out of 230
[2024-02-28 20:21:05,898 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 544 transitions, 3538 flow. Second operand  has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 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-02-28 20:21:05,898 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:21:05,898 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 230
[2024-02-28 20:21:05,898 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:21:13,955 INFO  L124   PetriNetUnfolderBase]: 14972/57012 cut-off events.
[2024-02-28 20:21:13,956 INFO  L125   PetriNetUnfolderBase]: For 43741/80104 co-relation queries the response was YES.
[2024-02-28 20:21:14,244 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 131103 conditions, 57012 events. 14972/57012 cut-off events. For 43741/80104 co-relation queries the response was YES. Maximal size of possible extension queue 1643. Compared 803712 event pairs, 1871 based on Foata normal form. 867/51967 useless extension candidates. Maximal degree in co-relation 130853. Up to 8682 conditions per place. 
[2024-02-28 20:21:14,413 INFO  L140   encePairwiseOnDemand]: 210/230 looper letters, 396 selfloop transitions, 224 changer transitions 0/833 dead transitions.
[2024-02-28 20:21:14,413 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 833 transitions, 6930 flow
[2024-02-28 20:21:14,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-02-28 20:21:14,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-02-28 20:21:14,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2207 transitions.
[2024-02-28 20:21:14,416 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8723320158102766
[2024-02-28 20:21:14,416 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 2207 transitions.
[2024-02-28 20:21:14,416 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 2207 transitions.
[2024-02-28 20:21:14,416 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:21:14,416 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2207 transitions.
[2024-02-28 20:21:14,418 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 200.63636363636363) internal successors, (2207), 11 states have internal predecessors, (2207), 0 states have call successors, (0), 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-02-28 20:21:14,420 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 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-02-28 20:21:14,420 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 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-02-28 20:21:14,420 INFO  L175             Difference]: Start difference. First operand has 263 places, 544 transitions, 3538 flow. Second operand 11 states and 2207 transitions.
[2024-02-28 20:21:14,420 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 833 transitions, 6930 flow
[2024-02-28 20:21:14,650 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 833 transitions, 6882 flow, removed 24 selfloop flow, removed 0 redundant places.
[2024-02-28 20:21:14,658 INFO  L231             Difference]: Finished difference. Result has 280 places, 670 transitions, 5498 flow
[2024-02-28 20:21:14,658 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=3490, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5498, PETRI_PLACES=280, PETRI_TRANSITIONS=670}
[2024-02-28 20:21:14,659 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 60 predicate places.
[2024-02-28 20:21:14,659 INFO  L495      AbstractCegarLoop]: Abstraction has has 280 places, 670 transitions, 5498 flow
[2024-02-28 20:21:14,659 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 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-02-28 20:21:14,659 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:21:14,659 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:21:14,660 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-02-28 20:21:14,660 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:21:14,660 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:21:14,660 INFO  L85        PathProgramCache]: Analyzing trace with hash 1191719725, now seen corresponding path program 1 times
[2024-02-28 20:21:14,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:21:14,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19986926]
[2024-02-28 20:21:14,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:21:14,661 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:21:14,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:21:15,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:21:15,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:21:15,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19986926]
[2024-02-28 20:21:15,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19986926] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:21:15,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:21:15,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-02-28 20:21:15,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301104397]
[2024-02-28 20:21:15,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:21:15,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 20:21:15,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:21:15,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 20:21:15,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-02-28 20:21:15,547 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 188 out of 230
[2024-02-28 20:21:15,548 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 670 transitions, 5498 flow. Second operand  has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 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-02-28 20:21:15,548 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:21:15,548 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 230
[2024-02-28 20:21:15,548 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:21:23,217 INFO  L124   PetriNetUnfolderBase]: 13423/54035 cut-off events.
[2024-02-28 20:21:23,218 INFO  L125   PetriNetUnfolderBase]: For 79937/117751 co-relation queries the response was YES.
[2024-02-28 20:21:23,544 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 136157 conditions, 54035 events. 13423/54035 cut-off events. For 79937/117751 co-relation queries the response was YES. Maximal size of possible extension queue 1621. Compared 776109 event pairs, 1356 based on Foata normal form. 730/48863 useless extension candidates. Maximal degree in co-relation 135901. Up to 11828 conditions per place. 
[2024-02-28 20:21:23,847 INFO  L140   encePairwiseOnDemand]: 218/230 looper letters, 392 selfloop transitions, 18 changer transitions 0/677 dead transitions.
[2024-02-28 20:21:23,847 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 677 transitions, 6404 flow
[2024-02-28 20:21:23,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-02-28 20:21:23,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-02-28 20:21:23,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1930 transitions.
[2024-02-28 20:21:23,849 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8391304347826087
[2024-02-28 20:21:23,849 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1930 transitions.
[2024-02-28 20:21:23,850 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1930 transitions.
[2024-02-28 20:21:23,850 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:21:23,850 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1930 transitions.
[2024-02-28 20:21:23,852 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 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-02-28 20:21:23,853 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 230.0) internal successors, (2530), 11 states have internal predecessors, (2530), 0 states have call successors, (0), 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-02-28 20:21:23,853 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 230.0) internal successors, (2530), 11 states have internal predecessors, (2530), 0 states have call successors, (0), 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-02-28 20:21:23,853 INFO  L175             Difference]: Start difference. First operand has 280 places, 670 transitions, 5498 flow. Second operand 10 states and 1930 transitions.
[2024-02-28 20:21:23,853 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 677 transitions, 6404 flow
[2024-02-28 20:21:24,323 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 677 transitions, 6360 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-02-28 20:21:24,330 INFO  L231             Difference]: Finished difference. Result has 287 places, 671 transitions, 5526 flow
[2024-02-28 20:21:24,330 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=5442, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5526, PETRI_PLACES=287, PETRI_TRANSITIONS=671}
[2024-02-28 20:21:24,331 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 67 predicate places.
[2024-02-28 20:21:24,331 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 671 transitions, 5526 flow
[2024-02-28 20:21:24,331 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 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-02-28 20:21:24,331 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:21:24,331 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:21:24,332 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-02-28 20:21:24,332 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:21:24,332 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:21:24,332 INFO  L85        PathProgramCache]: Analyzing trace with hash 997836388, now seen corresponding path program 1 times
[2024-02-28 20:21:24,332 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:21:24,332 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092927352]
[2024-02-28 20:21:24,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:21:24,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:21:24,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:21:24,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:21:24,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:21:24,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092927352]
[2024-02-28 20:21:24,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092927352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:21:24,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:21:24,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:21:24,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991801414]
[2024-02-28 20:21:24,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:21:24,364 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:21:24,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:21:24,364 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:21:24,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:21:24,395 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 211 out of 230
[2024-02-28 20:21:24,396 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 671 transitions, 5526 flow. Second operand  has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 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-02-28 20:21:24,396 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:21:24,396 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 230
[2024-02-28 20:21:24,396 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:21:26,113 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1042-->L1042-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][553], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 96#L1052-2true, Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, 22#L1042-1true, 296#true, 245#true, threadThread1of2ForFork0InUse, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 374#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 199#L1042-21true, Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 307#true, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-02-28 20:21:26,114 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is cut-off event
[2024-02-28 20:21:26,114 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-02-28 20:21:26,114 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-02-28 20:21:26,114 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-02-28 20:21:26,125 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1042-->L1042-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][553], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, 22#L1042-1true, 296#true, 245#true, threadThread1of2ForFork0InUse, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 374#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, 108#L1053-2true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 199#L1042-21true, Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 307#true, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-02-28 20:21:26,125 INFO  L294   olderBase$Statistics]: this new event has 161 ancestors and is cut-off event
[2024-02-28 20:21:26,126 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-02-28 20:21:26,126 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-02-28 20:21:26,126 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-02-28 20:21:27,622 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1042-->L1042-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][669], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 118#L1053-21true, Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 22#L1042-1true, Black: 319#true, threadThread1of2ForFork0InUse, 296#true, 245#true, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread2of2ForFork0InUse, Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 374#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 199#L1042-21true, Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 307#true, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-02-28 20:21:27,623 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-02-28 20:21:27,623 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-02-28 20:21:27,623 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-02-28 20:21:27,623 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-02-28 20:21:32,165 INFO  L124   PetriNetUnfolderBase]: 14197/58926 cut-off events.
[2024-02-28 20:21:32,165 INFO  L125   PetriNetUnfolderBase]: For 77446/84587 co-relation queries the response was YES.
[2024-02-28 20:21:32,556 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 136596 conditions, 58926 events. 14197/58926 cut-off events. For 77446/84587 co-relation queries the response was YES. Maximal size of possible extension queue 1749. Compared 867445 event pairs, 1222 based on Foata normal form. 222/52541 useless extension candidates. Maximal degree in co-relation 136296. Up to 7264 conditions per place. 
[2024-02-28 20:21:32,733 INFO  L140   encePairwiseOnDemand]: 221/230 looper letters, 28 selfloop transitions, 19 changer transitions 0/688 dead transitions.
[2024-02-28 20:21:32,733 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 688 transitions, 5706 flow
[2024-02-28 20:21:32,734 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:21:32,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:21:32,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions.
[2024-02-28 20:21:32,735 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9536231884057971
[2024-02-28 20:21:32,735 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 658 transitions.
[2024-02-28 20:21:32,735 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions.
[2024-02-28 20:21:32,735 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:21:32,735 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions.
[2024-02-28 20:21:32,736 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 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-02-28 20:21:32,736 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 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-02-28 20:21:32,737 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 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-02-28 20:21:32,737 INFO  L175             Difference]: Start difference. First operand has 287 places, 671 transitions, 5526 flow. Second operand 3 states and 658 transitions.
[2024-02-28 20:21:32,737 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 688 transitions, 5706 flow
[2024-02-28 20:21:33,348 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 688 transitions, 5670 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-02-28 20:21:33,354 INFO  L231             Difference]: Finished difference. Result has 286 places, 686 transitions, 5672 flow
[2024-02-28 20:21:33,355 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=5490, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5672, PETRI_PLACES=286, PETRI_TRANSITIONS=686}
[2024-02-28 20:21:33,355 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 66 predicate places.
[2024-02-28 20:21:33,355 INFO  L495      AbstractCegarLoop]: Abstraction has has 286 places, 686 transitions, 5672 flow
[2024-02-28 20:21:33,355 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 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-02-28 20:21:33,356 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:21:33,356 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:21:33,356 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-02-28 20:21:33,356 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:21:33,356 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:21:33,356 INFO  L85        PathProgramCache]: Analyzing trace with hash -1052477290, now seen corresponding path program 1 times
[2024-02-28 20:21:33,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:21:33,357 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939215688]
[2024-02-28 20:21:33,357 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:21:33,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:21:33,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:21:33,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:21:33,899 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:21:33,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939215688]
[2024-02-28 20:21:33,900 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939215688] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:21:33,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019757640]
[2024-02-28 20:21:33,900 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:21:33,900 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:21:33,900 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:21:33,901 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:21:33,903 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-02-28 20:21:34,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:21:34,030 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-02-28 20:21:34,034 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:21:34,039 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:21:34,073 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-02-28 20:21:34,074 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-02-28 20:21:34,131 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-02-28 20:21:34,132 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-02-28 20:21:34,361 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:21:34,361 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32
[2024-02-28 20:21:34,414 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 20:21:34,433 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:21:34,440 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:21:34,454 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:21:34,454 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:21:34,478 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:21:34,478 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:21:34,510 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:21:34,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:21:34,522 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:21:34,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019757640] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:21:34,523 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:21:34,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 20
[2024-02-28 20:21:34,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213661957]
[2024-02-28 20:21:34,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:21:34,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-02-28 20:21:34,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:21:34,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-02-28 20:21:34,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420
[2024-02-28 20:21:35,148 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 230
[2024-02-28 20:21:35,149 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 686 transitions, 5672 flow. Second operand  has 14 states, 14 states have (on average 174.21428571428572) internal successors, (2439), 14 states have internal predecessors, (2439), 0 states have call successors, (0), 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-02-28 20:21:35,149 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:21:35,149 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 230
[2024-02-28 20:21:35,149 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:21:48,889 INFO  L124   PetriNetUnfolderBase]: 24219/81785 cut-off events.
[2024-02-28 20:21:48,890 INFO  L125   PetriNetUnfolderBase]: For 153435/156179 co-relation queries the response was YES.
[2024-02-28 20:21:49,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 228444 conditions, 81785 events. 24219/81785 cut-off events. For 153435/156179 co-relation queries the response was YES. Maximal size of possible extension queue 2139. Compared 1153519 event pairs, 2714 based on Foata normal form. 214/74431 useless extension candidates. Maximal degree in co-relation 228061. Up to 11947 conditions per place. 
[2024-02-28 20:21:49,725 INFO  L140   encePairwiseOnDemand]: 206/230 looper letters, 979 selfloop transitions, 484 changer transitions 10/1684 dead transitions.
[2024-02-28 20:21:49,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 1684 transitions, 19359 flow
[2024-02-28 20:21:49,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-02-28 20:21:49,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-02-28 20:21:49,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3680 transitions.
[2024-02-28 20:21:49,731 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8
[2024-02-28 20:21:49,731 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 3680 transitions.
[2024-02-28 20:21:49,731 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 3680 transitions.
[2024-02-28 20:21:49,731 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:21:49,731 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3680 transitions.
[2024-02-28 20:21:49,736 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 184.0) internal successors, (3680), 20 states have internal predecessors, (3680), 0 states have call successors, (0), 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-02-28 20:21:49,739 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 230.0) internal successors, (4830), 21 states have internal predecessors, (4830), 0 states have call successors, (0), 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-02-28 20:21:49,740 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 230.0) internal successors, (4830), 21 states have internal predecessors, (4830), 0 states have call successors, (0), 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-02-28 20:21:49,740 INFO  L175             Difference]: Start difference. First operand has 286 places, 686 transitions, 5672 flow. Second operand 20 states and 3680 transitions.
[2024-02-28 20:21:49,740 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 1684 transitions, 19359 flow
[2024-02-28 20:21:50,819 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 1684 transitions, 19321 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:21:50,834 INFO  L231             Difference]: Finished difference. Result has 312 places, 1089 transitions, 12480 flow
[2024-02-28 20:21:50,835 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=5634, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=12480, PETRI_PLACES=312, PETRI_TRANSITIONS=1089}
[2024-02-28 20:21:50,835 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 92 predicate places.
[2024-02-28 20:21:50,835 INFO  L495      AbstractCegarLoop]: Abstraction has has 312 places, 1089 transitions, 12480 flow
[2024-02-28 20:21:50,835 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 174.21428571428572) internal successors, (2439), 14 states have internal predecessors, (2439), 0 states have call successors, (0), 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-02-28 20:21:50,836 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:21:50,836 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:21:50,843 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-02-28 20:21:51,036 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42
[2024-02-28 20:21:51,041 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:21:51,041 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:21:51,042 INFO  L85        PathProgramCache]: Analyzing trace with hash -2068093836, now seen corresponding path program 2 times
[2024-02-28 20:21:51,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:21:51,042 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136321152]
[2024-02-28 20:21:51,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:21:51,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:21:51,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:21:51,638 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:21:51,638 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:21:51,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136321152]
[2024-02-28 20:21:51,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136321152] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:21:51,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367839466]
[2024-02-28 20:21:51,639 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 20:21:51,640 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:21:51,640 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:21:51,641 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:21:51,643 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-02-28 20:21:51,818 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:21:51,819 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:21:51,820 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-02-28 20:21:51,825 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:21:51,836 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:21:51,895 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:21:51,895 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:21:52,173 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-02-28 20:21:52,174 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-02-28 20:21:52,227 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:21:52,228 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:21:52,242 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:21:52,282 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:21:52,333 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:21:52,334 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:21:52,527 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:21:52,585 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:21:52,585 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35
[2024-02-28 20:21:52,607 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:21:52,608 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:21:52,687 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:21:52,688 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:21:52,708 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:21:52,708 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:21:52,723 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:21:52,724 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:21:52,773 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:21:52,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:21:52,785 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:21:52,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [367839466] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:21:52,785 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:21:52,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25
[2024-02-28 20:21:52,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583824751]
[2024-02-28 20:21:52,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:21:52,786 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-02-28 20:21:52,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:21:52,787 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-02-28 20:21:52,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650
[2024-02-28 20:21:53,954 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 230
[2024-02-28 20:21:53,955 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 1089 transitions, 12480 flow. Second operand  has 15 states, 15 states have (on average 175.06666666666666) internal successors, (2626), 15 states have internal predecessors, (2626), 0 states have call successors, (0), 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-02-28 20:21:53,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:21:53,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 230
[2024-02-28 20:21:53,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:22:12,365 INFO  L124   PetriNetUnfolderBase]: 25373/87759 cut-off events.
[2024-02-28 20:22:12,365 INFO  L125   PetriNetUnfolderBase]: For 257401/262239 co-relation queries the response was YES.
[2024-02-28 20:22:13,047 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 268641 conditions, 87759 events. 25373/87759 cut-off events. For 257401/262239 co-relation queries the response was YES. Maximal size of possible extension queue 2284. Compared 1256663 event pairs, 2440 based on Foata normal form. 547/80322 useless extension candidates. Maximal degree in co-relation 268178. Up to 12119 conditions per place. 
[2024-02-28 20:22:13,359 INFO  L140   encePairwiseOnDemand]: 202/230 looper letters, 804 selfloop transitions, 929 changer transitions 1/1946 dead transitions.
[2024-02-28 20:22:13,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 1946 transitions, 26403 flow
[2024-02-28 20:22:13,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-02-28 20:22:13,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-02-28 20:22:13,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4859 transitions.
[2024-02-28 20:22:13,363 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8125418060200669
[2024-02-28 20:22:13,363 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 4859 transitions.
[2024-02-28 20:22:13,363 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 4859 transitions.
[2024-02-28 20:22:13,364 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:22:13,364 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4859 transitions.
[2024-02-28 20:22:13,368 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 186.8846153846154) internal successors, (4859), 26 states have internal predecessors, (4859), 0 states have call successors, (0), 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-02-28 20:22:13,371 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 230.0) internal successors, (6210), 27 states have internal predecessors, (6210), 0 states have call successors, (0), 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-02-28 20:22:13,371 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 230.0) internal successors, (6210), 27 states have internal predecessors, (6210), 0 states have call successors, (0), 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-02-28 20:22:13,371 INFO  L175             Difference]: Start difference. First operand has 312 places, 1089 transitions, 12480 flow. Second operand 26 states and 4859 transitions.
[2024-02-28 20:22:13,371 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 1946 transitions, 26403 flow
[2024-02-28 20:22:15,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1946 transitions, 26263 flow, removed 64 selfloop flow, removed 6 redundant places.
[2024-02-28 20:22:15,644 INFO  L231             Difference]: Finished difference. Result has 342 places, 1555 transitions, 22779 flow
[2024-02-28 20:22:15,645 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=12356, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1089, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=22779, PETRI_PLACES=342, PETRI_TRANSITIONS=1555}
[2024-02-28 20:22:15,645 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 122 predicate places.
[2024-02-28 20:22:15,646 INFO  L495      AbstractCegarLoop]: Abstraction has has 342 places, 1555 transitions, 22779 flow
[2024-02-28 20:22:15,646 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 175.06666666666666) internal successors, (2626), 15 states have internal predecessors, (2626), 0 states have call successors, (0), 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-02-28 20:22:15,646 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:22:15,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:22:15,654 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-02-28 20:22:15,847 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,10 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:22:15,848 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:22:15,848 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:22:15,849 INFO  L85        PathProgramCache]: Analyzing trace with hash -136952818, now seen corresponding path program 3 times
[2024-02-28 20:22:15,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:22:15,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967986957]
[2024-02-28 20:22:15,849 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:22:15,850 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:22:15,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:22:16,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:22:16,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:22:16,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967986957]
[2024-02-28 20:22:16,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967986957] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:22:16,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266827345]
[2024-02-28 20:22:16,453 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 20:22:16,453 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:22:16,453 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:22:16,454 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:22:16,457 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-02-28 20:22:16,653 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 20:22:16,653 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:22:16,654 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-02-28 20:22:16,661 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:22:16,689 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:22:16,761 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:22:16,761 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:22:17,062 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-02-28 20:22:17,063 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-02-28 20:22:17,102 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:17,106 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:22:17,136 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:22:17,178 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:22:17,334 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:22:17,384 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:22:17,385 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:22:17,456 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:22:17,457 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:22:17,519 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:17,519 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:22:17,548 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:17,549 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:22:17,567 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:17,568 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:22:17,596 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:17,598 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:22:17,647 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:22:17,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:22:17,657 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:22:17,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266827345] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:22:17,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:22:17,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-02-28 20:22:17,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571487640]
[2024-02-28 20:22:17,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:22:17,658 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-02-28 20:22:17,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:22:17,659 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-02-28 20:22:17,659 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702
[2024-02-28 20:22:18,670 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 230
[2024-02-28 20:22:18,671 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 1555 transitions, 22779 flow. Second operand  has 15 states, 15 states have (on average 175.06666666666666) internal successors, (2626), 15 states have internal predecessors, (2626), 0 states have call successors, (0), 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-02-28 20:22:18,671 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:22:18,672 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 230
[2024-02-28 20:22:18,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:22:42,145 INFO  L124   PetriNetUnfolderBase]: 27868/95781 cut-off events.
[2024-02-28 20:22:42,146 INFO  L125   PetriNetUnfolderBase]: For 448104/454172 co-relation queries the response was YES.
[2024-02-28 20:22:43,160 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 329063 conditions, 95781 events. 27868/95781 cut-off events. For 448104/454172 co-relation queries the response was YES. Maximal size of possible extension queue 2516. Compared 1387093 event pairs, 2527 based on Foata normal form. 752/87939 useless extension candidates. Maximal degree in co-relation 328577. Up to 13272 conditions per place. 
[2024-02-28 20:22:43,573 INFO  L140   encePairwiseOnDemand]: 202/230 looper letters, 1048 selfloop transitions, 1111 changer transitions 2/2373 dead transitions.
[2024-02-28 20:22:43,573 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 2373 transitions, 38498 flow
[2024-02-28 20:22:43,574 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-02-28 20:22:43,574 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-02-28 20:22:43,576 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4479 transitions.
[2024-02-28 20:22:43,576 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8114130434782608
[2024-02-28 20:22:43,577 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 4479 transitions.
[2024-02-28 20:22:43,577 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 4479 transitions.
[2024-02-28 20:22:43,577 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:22:43,577 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4479 transitions.
[2024-02-28 20:22:43,580 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 186.625) internal successors, (4479), 24 states have internal predecessors, (4479), 0 states have call successors, (0), 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-02-28 20:22:43,583 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 230.0) internal successors, (5750), 25 states have internal predecessors, (5750), 0 states have call successors, (0), 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-02-28 20:22:43,584 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 230.0) internal successors, (5750), 25 states have internal predecessors, (5750), 0 states have call successors, (0), 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-02-28 20:22:43,584 INFO  L175             Difference]: Start difference. First operand has 342 places, 1555 transitions, 22779 flow. Second operand 24 states and 4479 transitions.
[2024-02-28 20:22:43,584 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 2373 transitions, 38498 flow
[2024-02-28 20:22:49,059 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 2373 transitions, 37619 flow, removed 418 selfloop flow, removed 7 redundant places.
[2024-02-28 20:22:49,090 INFO  L231             Difference]: Finished difference. Result has 367 places, 1952 transitions, 33003 flow
[2024-02-28 20:22:49,091 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=21970, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=766, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=33003, PETRI_PLACES=367, PETRI_TRANSITIONS=1952}
[2024-02-28 20:22:49,092 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 147 predicate places.
[2024-02-28 20:22:49,092 INFO  L495      AbstractCegarLoop]: Abstraction has has 367 places, 1952 transitions, 33003 flow
[2024-02-28 20:22:49,092 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 175.06666666666666) internal successors, (2626), 15 states have internal predecessors, (2626), 0 states have call successors, (0), 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-02-28 20:22:49,092 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:22:49,092 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:22:49,098 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-02-28 20:22:49,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44
[2024-02-28 20:22:49,294 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:22:49,294 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:22:49,295 INFO  L85        PathProgramCache]: Analyzing trace with hash -912565382, now seen corresponding path program 4 times
[2024-02-28 20:22:49,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:22:49,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869255946]
[2024-02-28 20:22:49,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:22:49,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:22:49,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:22:49,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:22:49,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:22:49,968 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869255946]
[2024-02-28 20:22:49,968 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869255946] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:22:49,968 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070088428]
[2024-02-28 20:22:49,968 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 20:22:49,968 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:22:49,969 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:22:49,970 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:22:49,971 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-02-28 20:22:50,223 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 20:22:50,224 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:22:50,227 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 66 conjunts are in the unsatisfiable core
[2024-02-28 20:22:50,233 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:22:50,282 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:22:50,385 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:22:50,386 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:22:51,242 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-02-28 20:22:51,242 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-02-28 20:22:51,249 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:51,250 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-02-28 20:22:51,540 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:51,541 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-02-28 20:22:51,549 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:51,550 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:22:51,626 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:22:51,928 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-02-28 20:22:51,940 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:22:52,006 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:22:52,080 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:22:52,181 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:22:52,307 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:52,308 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:22:52,340 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:52,342 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:22:52,383 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:52,384 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:22:52,427 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:22:52,428 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:22:52,543 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48
[2024-02-28 20:22:52,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:22:52,615 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:22:52,615 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070088428] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:22:52,615 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:22:52,615 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [15] total 33
[2024-02-28 20:22:52,615 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839843254]
[2024-02-28 20:22:52,615 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:22:52,616 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-02-28 20:22:52,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:22:52,616 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-02-28 20:22:52,616 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122
[2024-02-28 20:22:55,200 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 162 out of 230
[2024-02-28 20:22:55,202 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 1952 transitions, 33003 flow. Second operand  has 20 states, 20 states have (on average 163.8) internal successors, (3276), 20 states have internal predecessors, (3276), 0 states have call successors, (0), 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-02-28 20:22:55,203 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:22:55,203 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 230
[2024-02-28 20:22:55,203 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:24:18,020 INFO  L124   PetriNetUnfolderBase]: 85127/276340 cut-off events.
[2024-02-28 20:24:18,021 INFO  L125   PetriNetUnfolderBase]: For 1786286/1796080 co-relation queries the response was YES.
[2024-02-28 20:24:21,397 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1033127 conditions, 276340 events. 85127/276340 cut-off events. For 1786286/1796080 co-relation queries the response was YES. Maximal size of possible extension queue 7293. Compared 4526953 event pairs, 11681 based on Foata normal form. 897/250708 useless extension candidates. Maximal degree in co-relation 1016760. Up to 44761 conditions per place. 
[2024-02-28 20:24:22,843 INFO  L140   encePairwiseOnDemand]: 189/230 looper letters, 4293 selfloop transitions, 1549 changer transitions 1/6043 dead transitions.
[2024-02-28 20:24:22,844 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 6043 transitions, 117406 flow
[2024-02-28 20:24:22,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2024-02-28 20:24:22,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2024-02-28 20:24:22,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6551 transitions.
[2024-02-28 20:24:22,859 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7698002350176263
[2024-02-28 20:24:22,859 INFO  L72            ComplementDD]: Start complementDD. Operand 37 states and 6551 transitions.
[2024-02-28 20:24:22,859 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 6551 transitions.
[2024-02-28 20:24:22,861 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:24:22,861 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 6551 transitions.
[2024-02-28 20:24:22,866 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 38 states, 37 states have (on average 177.05405405405406) internal successors, (6551), 37 states have internal predecessors, (6551), 0 states have call successors, (0), 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-02-28 20:24:22,871 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 38 states, 38 states have (on average 230.0) internal successors, (8740), 38 states have internal predecessors, (8740), 0 states have call successors, (0), 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-02-28 20:24:22,871 INFO  L81            ComplementDD]: Finished complementDD. Result  has 38 states, 38 states have (on average 230.0) internal successors, (8740), 38 states have internal predecessors, (8740), 0 states have call successors, (0), 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-02-28 20:24:22,871 INFO  L175             Difference]: Start difference. First operand has 367 places, 1952 transitions, 33003 flow. Second operand 37 states and 6551 transitions.
[2024-02-28 20:24:22,872 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 6043 transitions, 117406 flow
[2024-02-28 20:25:11,445 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 6043 transitions, 116325 flow, removed 230 selfloop flow, removed 11 redundant places.
[2024-02-28 20:25:11,513 INFO  L231             Difference]: Finished difference. Result has 417 places, 3486 transitions, 71567 flow
[2024-02-28 20:25:11,514 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=32629, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=71567, PETRI_PLACES=417, PETRI_TRANSITIONS=3486}
[2024-02-28 20:25:11,515 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 197 predicate places.
[2024-02-28 20:25:11,515 INFO  L495      AbstractCegarLoop]: Abstraction has has 417 places, 3486 transitions, 71567 flow
[2024-02-28 20:25:11,515 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 163.8) internal successors, (3276), 20 states have internal predecessors, (3276), 0 states have call successors, (0), 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-02-28 20:25:11,515 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:25:11,515 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:25:11,524 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-02-28 20:25:11,716 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45
[2024-02-28 20:25:11,716 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:25:11,718 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:25:11,718 INFO  L85        PathProgramCache]: Analyzing trace with hash 1768512129, now seen corresponding path program 1 times
[2024-02-28 20:25:11,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:25:11,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988215620]
[2024-02-28 20:25:11,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:25:11,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:25:11,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:25:12,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:25:12,202 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:25:12,202 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988215620]
[2024-02-28 20:25:12,202 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988215620] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:25:12,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236576757]
[2024-02-28 20:25:12,203 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:25:12,203 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:25:12,203 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:25:12,204 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:25:12,206 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-02-28 20:25:12,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:25:12,384 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 69 conjunts are in the unsatisfiable core
[2024-02-28 20:25:12,388 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:25:12,496 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:25:12,552 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-02-28 20:25:12,553 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-02-28 20:25:12,677 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:25:12,683 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:25:12,684 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-02-28 20:25:13,368 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:25:13,368 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44
[2024-02-28 20:25:13,372 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11
[2024-02-28 20:25:13,605 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:25:13,606 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18
[2024-02-28 20:25:13,613 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:25:13,613 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-02-28 20:25:13,725 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 20:25:13,730 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-02-28 20:25:13,795 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:25:13,843 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:25:13,890 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:25:13,956 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:25:14,025 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:25:14,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:25:14,076 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:25:14,105 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1859 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1859) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1859 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1859) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1859 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1859) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1859 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1859) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse0)) 0)))) is different from false
[2024-02-28 20:25:14,140 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1859 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1859) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1859 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1859) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1859 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1859) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1859 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1859) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse2) 0)))))) is different from false
[2024-02-28 20:25:14,221 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_1853) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-02-28 20:25:14,255 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1851 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1851) c_~datas~0.base v_ArrVal_1853) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-02-28 20:25:14,276 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1851 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1851) c_~datas~0.base v_ArrVal_1853) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-02-28 20:25:14,613 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-02-28 20:25:14,620 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 119
[2024-02-28 20:25:14,626 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50
[2024-02-28 20:25:14,630 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46
[2024-02-28 20:25:14,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 20:25:14,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [236576757] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:25:14,829 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:25:14,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 17] total 47
[2024-02-28 20:25:14,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731991415]
[2024-02-28 20:25:14,829 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:25:14,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 48 states
[2024-02-28 20:25:14,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:25:14,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2024-02-28 20:25:14,831 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1608, Unknown=5, NotChecked=430, Total=2256
[2024-02-28 20:25:15,022 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 129 out of 230
[2024-02-28 20:25:15,025 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 3486 transitions, 71567 flow. Second operand  has 48 states, 48 states have (on average 131.95833333333334) internal successors, (6334), 48 states have internal predecessors, (6334), 0 states have call successors, (0), 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-02-28 20:25:15,025 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:25:15,025 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 230
[2024-02-28 20:25:15,025 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
