./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version f8ab0bd5
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-f8ab0bd-m
[2025-03-13 22:25:01,832 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-13 22:25:01,892 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-03-13 22:25:01,900 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-13 22:25:01,900 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-13 22:25:01,918 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-13 22:25:01,919 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-13 22:25:01,919 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-13 22:25:01,920 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-13 22:25:01,920 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-13 22:25:01,920 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-13 22:25:01,921 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-13 22:25:01,921 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-13 22:25:01,921 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-13 22:25:01,921 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-13 22:25:01,921 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-13 22:25:01,921 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-13 22:25:01,921 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-13 22:25:01,922 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-13 22:25:01,922 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-13 22:25:01,922 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-13 22:25:01,922 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-13 22:25:01,922 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-03-13 22:25:01,922 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-03-13 22:25:01,922 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-13 22:25:01,922 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-13 22:25:01,922 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-13 22:25:01,922 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-13 22:25:01,923 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-13 22:25:01,923 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-13 22:25:01,923 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
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 -> /storage/repos/ultimate/releaseScripts/default/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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751
[2025-03-13 22:25:02,159 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-13 22:25:02,168 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-13 22:25:02,169 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-13 22:25:02,170 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-13 22:25:02,170 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-13 22:25:02,171 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c
[2025-03-13 22:25:03,322 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49af722fb/656c82bd35394b5299c764ed88a79c2a/FLAG90541214b
[2025-03-13 22:25:03,541 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-13 22:25:03,541 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c
[2025-03-13 22:25:03,554 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49af722fb/656c82bd35394b5299c764ed88a79c2a/FLAG90541214b
[2025-03-13 22:25:03,877 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49af722fb/656c82bd35394b5299c764ed88a79c2a
[2025-03-13 22:25:03,879 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-13 22:25:03,881 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-13 22:25:03,881 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-13 22:25:03,882 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-13 22:25:03,884 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-13 22:25:03,885 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:03" (1/1) ...
[2025-03-13 22:25:03,885 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648b6cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:03, skipping insertion in model container
[2025-03-13 22:25:03,886 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:03" (1/1) ...
[2025-03-13 22:25:03,897 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-13 22:25:04,012 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-13 22:25:04,023 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-13 22:25:04,045 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-13 22:25:04,062 INFO  L204         MainTranslator]: Completed translation
[2025-03-13 22:25:04,063 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04 WrapperNode
[2025-03-13 22:25:04,063 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-13 22:25:04,064 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-13 22:25:04,064 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-13 22:25:04,064 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-13 22:25:04,069 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,074 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,097 INFO  L138                Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214
[2025-03-13 22:25:04,098 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-13 22:25:04,098 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-13 22:25:04,098 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-13 22:25:04,098 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-13 22:25:04,104 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,105 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,110 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,111 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,114 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,120 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,121 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,122 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,123 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-13 22:25:04,124 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-13 22:25:04,124 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-13 22:25:04,124 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-13 22:25:04,125 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (1/1) ...
[2025-03-13 22:25:04,131 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-13 22:25:04,141 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-13 22:25:04,154 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-13 22:25:04,156 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-13 22:25:04,174 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-13 22:25:04,174 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2025-03-13 22:25:04,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2025-03-13 22:25:04,175 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2025-03-13 22:25:04,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2025-03-13 22:25:04,175 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2025-03-13 22:25:04,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2025-03-13 22:25:04,175 INFO  L130     BoogieDeclarations]: Found specification of procedure thread4
[2025-03-13 22:25:04,176 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread4
[2025-03-13 22:25:04,176 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-03-13 22:25:04,176 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-13 22:25:04,176 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-13 22:25:04,177 WARN  L225             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-03-13 22:25:04,251 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-13 22:25:04,252 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-13 22:25:04,500 INFO  L303             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-03-13 22:25:04,500 INFO  L313             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-13 22:25:04,500 INFO  L318             CfgBuilder]: Performing block encoding
[2025-03-13 22:25:04,532 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-13 22:25:04,532 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:04 BoogieIcfgContainer
[2025-03-13 22:25:04,532 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-13 22:25:04,534 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-13 22:25:04,534 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-13 22:25:04,538 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-13 22:25:04,538 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:25:03" (1/3) ...
[2025-03-13 22:25:04,539 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dace1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:04, skipping insertion in model container
[2025-03-13 22:25:04,539 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:04" (2/3) ...
[2025-03-13 22:25:04,539 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dace1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:04, skipping insertion in model container
[2025-03-13 22:25:04,539 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:04" (3/3) ...
[2025-03-13 22:25:04,541 INFO  L128   eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c
[2025-03-13 22:25:04,551 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-13 22:25:04,552 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 227 locations, 1 initial locations, 0 loop locations, and 12 error locations.
[2025-03-13 22:25:04,552 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-03-13 22:25:04,630 INFO  L143    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2025-03-13 22:25:04,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 239 places, 235 transitions, 498 flow
[2025-03-13 22:25:04,726 INFO  L124   PetriNetUnfolderBase]: 9/231 cut-off events.
[2025-03-13 22:25:04,729 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2025-03-13 22:25:04,734 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 248 conditions, 231 events. 9/231 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 358 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. 
[2025-03-13 22:25:04,734 INFO  L82        GeneralOperation]: Start removeDead. Operand has 239 places, 235 transitions, 498 flow
[2025-03-13 22:25:04,740 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 219 places, 214 transitions, 449 flow
[2025-03-13 22:25:04,749 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-13 22:25:04,757 INFO  L333      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, 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;@1f4545cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-13 22:25:04,758 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 24 error locations.
[2025-03-13 22:25:04,765 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-13 22:25:04,765 INFO  L124   PetriNetUnfolderBase]: 0/26 cut-off events.
[2025-03-13 22:25:04,765 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-13 22:25:04,766 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:04,767 INFO  L206   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]
[2025-03-13 22:25:04,767 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:04,770 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:04,770 INFO  L85        PathProgramCache]: Analyzing trace with hash -390363681, now seen corresponding path program 1 times
[2025-03-13 22:25:04,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:04,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108319146]
[2025-03-13 22:25:04,775 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:04,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:04,823 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-03-13 22:25:04,830 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-03-13 22:25:04,830 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:04,830 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:04,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:04,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:04,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108319146]
[2025-03-13 22:25:04,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108319146] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:04,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:04,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:04,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139244487]
[2025-03-13 22:25:04,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:04,908 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:04,911 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:04,939 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:04,940 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:04,964 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235
[2025-03-13 22:25:04,969 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 449 flow. Second operand  has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:04,969 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:04,969 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235
[2025-03-13 22:25:04,971 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:05,699 INFO  L124   PetriNetUnfolderBase]: 1590/4870 cut-off events.
[2025-03-13 22:25:05,699 INFO  L125   PetriNetUnfolderBase]: For 339/339 co-relation queries the response was YES.
[2025-03-13 22:25:05,721 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7393 conditions, 4870 events. 1590/4870 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 44619 event pairs, 1132 based on Foata normal form. 350/4509 useless extension candidates. Maximal degree in co-relation 7098. Up to 2178 conditions per place. 
[2025-03-13 22:25:05,745 INFO  L140   encePairwiseOnDemand]: 227/235 looper letters, 29 selfloop transitions, 2 changer transitions 1/208 dead transitions.
[2025-03-13 22:25:05,746 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 208 transitions, 499 flow
[2025-03-13 22:25:05,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:05,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:05,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions.
[2025-03-13 22:25:05,758 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8780141843971632
[2025-03-13 22:25:05,760 INFO  L175             Difference]: Start difference. First operand has 219 places, 214 transitions, 449 flow. Second operand 3 states and 619 transitions.
[2025-03-13 22:25:05,760 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 208 transitions, 499 flow
[2025-03-13 22:25:05,768 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 208 transitions, 486 flow, removed 0 selfloop flow, removed 7 redundant places.
[2025-03-13 22:25:05,773 INFO  L231             Difference]: Finished difference. Result has 213 places, 207 transitions, 426 flow
[2025-03-13 22:25:05,775 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=213, PETRI_TRANSITIONS=207}
[2025-03-13 22:25:05,780 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -6 predicate places.
[2025-03-13 22:25:05,780 INFO  L471      AbstractCegarLoop]: Abstraction has has 213 places, 207 transitions, 426 flow
[2025-03-13 22:25:05,780 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:05,781 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:05,781 INFO  L206   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]
[2025-03-13 22:25:05,781 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-13 22:25:05,781 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:05,782 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:05,782 INFO  L85        PathProgramCache]: Analyzing trace with hash -223971345, now seen corresponding path program 1 times
[2025-03-13 22:25:05,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:05,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895576967]
[2025-03-13 22:25:05,782 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:05,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:05,789 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.
[2025-03-13 22:25:05,799 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements.
[2025-03-13 22:25:05,799 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:05,799 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:05,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:05,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:05,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895576967]
[2025-03-13 22:25:05,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895576967] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:05,830 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:05,830 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:05,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165239597]
[2025-03-13 22:25:05,830 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:05,831 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:05,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:05,831 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:05,831 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:05,852 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235
[2025-03-13 22:25:05,853 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 207 transitions, 426 flow. Second operand  has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:05,853 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:05,853 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235
[2025-03-13 22:25:05,853 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:06,445 INFO  L124   PetriNetUnfolderBase]: 1827/4770 cut-off events.
[2025-03-13 22:25:06,446 INFO  L125   PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES.
[2025-03-13 22:25:06,459 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7534 conditions, 4770 events. 1827/4770 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 40737 event pairs, 1374 based on Foata normal form. 0/4108 useless extension candidates. Maximal degree in co-relation 7500. Up to 2507 conditions per place. 
[2025-03-13 22:25:06,481 INFO  L140   encePairwiseOnDemand]: 232/235 looper letters, 29 selfloop transitions, 2 changer transitions 0/206 dead transitions.
[2025-03-13 22:25:06,481 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 206 transitions, 486 flow
[2025-03-13 22:25:06,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:06,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:06,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions.
[2025-03-13 22:25:06,485 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8709219858156029
[2025-03-13 22:25:06,485 INFO  L175             Difference]: Start difference. First operand has 213 places, 207 transitions, 426 flow. Second operand 3 states and 614 transitions.
[2025-03-13 22:25:06,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 206 transitions, 486 flow
[2025-03-13 22:25:06,487 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:06,489 INFO  L231             Difference]: Finished difference. Result has 211 places, 206 transitions, 424 flow
[2025-03-13 22:25:06,491 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=211, PETRI_TRANSITIONS=206}
[2025-03-13 22:25:06,492 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -8 predicate places.
[2025-03-13 22:25:06,492 INFO  L471      AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 424 flow
[2025-03-13 22:25:06,492 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:06,492 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:06,493 INFO  L206   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]
[2025-03-13 22:25:06,493 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-13 22:25:06,493 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:06,494 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:06,494 INFO  L85        PathProgramCache]: Analyzing trace with hash -207963243, now seen corresponding path program 1 times
[2025-03-13 22:25:06,494 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:06,494 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160470994]
[2025-03-13 22:25:06,494 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:06,494 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:06,504 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-03-13 22:25:06,511 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-03-13 22:25:06,511 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:06,511 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:06,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:06,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:06,549 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160470994]
[2025-03-13 22:25:06,549 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160470994] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:06,549 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:06,549 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:06,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136220690]
[2025-03-13 22:25:06,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:06,549 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:06,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:06,549 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:06,550 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:06,572 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235
[2025-03-13 22:25:06,573 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 424 flow. Second operand  has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:06,573 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:06,573 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235
[2025-03-13 22:25:06,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:07,064 INFO  L124   PetriNetUnfolderBase]: 1848/4571 cut-off events.
[2025-03-13 22:25:07,066 INFO  L125   PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES.
[2025-03-13 22:25:07,076 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7342 conditions, 4571 events. 1848/4571 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 37572 event pairs, 1400 based on Foata normal form. 0/3911 useless extension candidates. Maximal degree in co-relation 7300. Up to 2534 conditions per place. 
[2025-03-13 22:25:07,111 INFO  L140   encePairwiseOnDemand]: 232/235 looper letters, 29 selfloop transitions, 2 changer transitions 0/205 dead transitions.
[2025-03-13 22:25:07,112 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 205 transitions, 484 flow
[2025-03-13 22:25:07,112 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:07,112 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:07,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions.
[2025-03-13 22:25:07,115 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8709219858156029
[2025-03-13 22:25:07,115 INFO  L175             Difference]: Start difference. First operand has 211 places, 206 transitions, 424 flow. Second operand 3 states and 614 transitions.
[2025-03-13 22:25:07,115 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 205 transitions, 484 flow
[2025-03-13 22:25:07,116 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 205 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:07,121 INFO  L231             Difference]: Finished difference. Result has 210 places, 205 transitions, 422 flow
[2025-03-13 22:25:07,121 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=210, PETRI_TRANSITIONS=205}
[2025-03-13 22:25:07,122 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -9 predicate places.
[2025-03-13 22:25:07,122 INFO  L471      AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 422 flow
[2025-03-13 22:25:07,122 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:07,123 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:07,127 INFO  L206   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]
[2025-03-13 22:25:07,127 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-13 22:25:07,127 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:07,128 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:07,128 INFO  L85        PathProgramCache]: Analyzing trace with hash 2054704289, now seen corresponding path program 1 times
[2025-03-13 22:25:07,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:07,128 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102886014]
[2025-03-13 22:25:07,128 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:07,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:07,134 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes.
[2025-03-13 22:25:07,138 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements.
[2025-03-13 22:25:07,138 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:07,138 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:07,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:07,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:07,177 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102886014]
[2025-03-13 22:25:07,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102886014] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:07,177 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:07,177 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:07,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108870413]
[2025-03-13 22:25:07,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:07,178 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:07,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:07,178 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:07,178 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:07,191 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235
[2025-03-13 22:25:07,192 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 422 flow. Second operand  has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:07,192 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:07,192 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235
[2025-03-13 22:25:07,192 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:07,647 INFO  L124   PetriNetUnfolderBase]: 1714/4642 cut-off events.
[2025-03-13 22:25:07,647 INFO  L125   PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES.
[2025-03-13 22:25:07,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7165 conditions, 4642 events. 1714/4642 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 39101 event pairs, 1266 based on Foata normal form. 0/3988 useless extension candidates. Maximal degree in co-relation 7115. Up to 2354 conditions per place. 
[2025-03-13 22:25:07,681 INFO  L140   encePairwiseOnDemand]: 232/235 looper letters, 29 selfloop transitions, 2 changer transitions 0/204 dead transitions.
[2025-03-13 22:25:07,681 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 204 transitions, 482 flow
[2025-03-13 22:25:07,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:07,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:07,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions.
[2025-03-13 22:25:07,683 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8709219858156029
[2025-03-13 22:25:07,683 INFO  L175             Difference]: Start difference. First operand has 210 places, 205 transitions, 422 flow. Second operand 3 states and 614 transitions.
[2025-03-13 22:25:07,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 204 transitions, 482 flow
[2025-03-13 22:25:07,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 204 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:07,686 INFO  L231             Difference]: Finished difference. Result has 209 places, 204 transitions, 420 flow
[2025-03-13 22:25:07,686 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=209, PETRI_TRANSITIONS=204}
[2025-03-13 22:25:07,687 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -10 predicate places.
[2025-03-13 22:25:07,687 INFO  L471      AbstractCegarLoop]: Abstraction has has 209 places, 204 transitions, 420 flow
[2025-03-13 22:25:07,687 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:07,687 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:07,687 INFO  L206   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]
[2025-03-13 22:25:07,688 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-13 22:25:07,688 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:07,688 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:07,688 INFO  L85        PathProgramCache]: Analyzing trace with hash -1032916118, now seen corresponding path program 1 times
[2025-03-13 22:25:07,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:07,689 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530482816]
[2025-03-13 22:25:07,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:07,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:07,696 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-03-13 22:25:07,711 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-03-13 22:25:07,711 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:07,711 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:07,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:07,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:07,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530482816]
[2025-03-13 22:25:07,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530482816] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:07,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:07,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:07,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457721326]
[2025-03-13 22:25:07,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:07,766 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:07,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:07,767 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:07,767 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:07,784 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 196 out of 235
[2025-03-13 22:25:07,785 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 204 transitions, 420 flow. Second operand  has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:07,785 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:07,785 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 235
[2025-03-13 22:25:07,785 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:08,431 INFO  L124   PetriNetUnfolderBase]: 2313/6203 cut-off events.
[2025-03-13 22:25:08,431 INFO  L125   PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES.
[2025-03-13 22:25:08,449 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9691 conditions, 6203 events. 2313/6203 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 57579 event pairs, 1319 based on Foata normal form. 0/5320 useless extension candidates. Maximal degree in co-relation 9633. Up to 2498 conditions per place. 
[2025-03-13 22:25:08,469 INFO  L140   encePairwiseOnDemand]: 232/235 looper letters, 40 selfloop transitions, 2 changer transitions 0/215 dead transitions.
[2025-03-13 22:25:08,469 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 215 transitions, 530 flow
[2025-03-13 22:25:08,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:08,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:08,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions.
[2025-03-13 22:25:08,473 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8950354609929078
[2025-03-13 22:25:08,473 INFO  L175             Difference]: Start difference. First operand has 209 places, 204 transitions, 420 flow. Second operand 3 states and 631 transitions.
[2025-03-13 22:25:08,473 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 215 transitions, 530 flow
[2025-03-13 22:25:08,474 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 215 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:08,477 INFO  L231             Difference]: Finished difference. Result has 208 places, 203 transitions, 418 flow
[2025-03-13 22:25:08,477 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=208, PETRI_TRANSITIONS=203}
[2025-03-13 22:25:08,478 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -11 predicate places.
[2025-03-13 22:25:08,479 INFO  L471      AbstractCegarLoop]: Abstraction has has 208 places, 203 transitions, 418 flow
[2025-03-13 22:25:08,479 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:08,479 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:08,479 INFO  L206   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]
[2025-03-13 22:25:08,479 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-13 22:25:08,480 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:08,480 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:08,482 INFO  L85        PathProgramCache]: Analyzing trace with hash 1115249900, now seen corresponding path program 1 times
[2025-03-13 22:25:08,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:08,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409785745]
[2025-03-13 22:25:08,483 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:08,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:08,492 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes.
[2025-03-13 22:25:08,501 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements.
[2025-03-13 22:25:08,501 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:08,501 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:08,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:08,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:08,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409785745]
[2025-03-13 22:25:08,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409785745] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:08,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:08,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:08,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033379942]
[2025-03-13 22:25:08,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:08,556 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:08,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:08,558 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:08,558 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:08,568 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 198 out of 235
[2025-03-13 22:25:08,569 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 203 transitions, 418 flow. Second operand  has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:08,570 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:08,570 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 235
[2025-03-13 22:25:08,570 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:08,964 INFO  L124   PetriNetUnfolderBase]: 1959/4969 cut-off events.
[2025-03-13 22:25:08,964 INFO  L125   PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES.
[2025-03-13 22:25:08,977 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7991 conditions, 4969 events. 1959/4969 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 42759 event pairs, 431 based on Foata normal form. 0/4352 useless extension candidates. Maximal degree in co-relation 5950. Up to 1962 conditions per place. 
[2025-03-13 22:25:08,990 INFO  L140   encePairwiseOnDemand]: 233/235 looper letters, 39 selfloop transitions, 1 changer transitions 0/214 dead transitions.
[2025-03-13 22:25:08,990 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 214 transitions, 524 flow
[2025-03-13 22:25:08,990 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:08,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:08,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions.
[2025-03-13 22:25:08,992 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.900709219858156
[2025-03-13 22:25:08,992 INFO  L175             Difference]: Start difference. First operand has 208 places, 203 transitions, 418 flow. Second operand 3 states and 635 transitions.
[2025-03-13 22:25:08,992 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 214 transitions, 524 flow
[2025-03-13 22:25:08,993 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 214 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:08,994 INFO  L231             Difference]: Finished difference. Result has 207 places, 202 transitions, 414 flow
[2025-03-13 22:25:08,994 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=207, PETRI_TRANSITIONS=202}
[2025-03-13 22:25:08,995 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -12 predicate places.
[2025-03-13 22:25:08,995 INFO  L471      AbstractCegarLoop]: Abstraction has has 207 places, 202 transitions, 414 flow
[2025-03-13 22:25:08,995 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:08,995 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:08,995 INFO  L206   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]
[2025-03-13 22:25:08,996 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-13 22:25:08,996 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:08,996 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:08,996 INFO  L85        PathProgramCache]: Analyzing trace with hash 2028137539, now seen corresponding path program 1 times
[2025-03-13 22:25:08,996 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:08,996 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457990860]
[2025-03-13 22:25:08,996 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:08,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:09,002 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-03-13 22:25:09,006 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-03-13 22:25:09,006 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:09,006 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:09,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:09,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:09,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457990860]
[2025-03-13 22:25:09,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457990860] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:09,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:09,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:09,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033286970]
[2025-03-13 22:25:09,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:09,031 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:09,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:09,031 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:09,032 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:09,042 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 196 out of 235
[2025-03-13 22:25:09,043 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 202 transitions, 414 flow. Second operand  has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:09,043 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:09,043 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 235
[2025-03-13 22:25:09,043 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:09,479 INFO  L124   PetriNetUnfolderBase]: 2801/6242 cut-off events.
[2025-03-13 22:25:09,479 INFO  L125   PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES.
[2025-03-13 22:25:09,494 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10467 conditions, 6242 events. 2801/6242 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 52547 event pairs, 1639 based on Foata normal form. 0/5489 useless extension candidates. Maximal degree in co-relation 8004. Up to 2924 conditions per place. 
[2025-03-13 22:25:09,513 INFO  L140   encePairwiseOnDemand]: 232/235 looper letters, 41 selfloop transitions, 2 changer transitions 0/214 dead transitions.
[2025-03-13 22:25:09,513 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 214 transitions, 528 flow
[2025-03-13 22:25:09,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:09,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:09,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions.
[2025-03-13 22:25:09,514 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8964539007092198
[2025-03-13 22:25:09,514 INFO  L175             Difference]: Start difference. First operand has 207 places, 202 transitions, 414 flow. Second operand 3 states and 632 transitions.
[2025-03-13 22:25:09,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 214 transitions, 528 flow
[2025-03-13 22:25:09,515 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 214 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:09,517 INFO  L231             Difference]: Finished difference. Result has 207 places, 201 transitions, 415 flow
[2025-03-13 22:25:09,517 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=207, PETRI_TRANSITIONS=201}
[2025-03-13 22:25:09,517 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -12 predicate places.
[2025-03-13 22:25:09,517 INFO  L471      AbstractCegarLoop]: Abstraction has has 207 places, 201 transitions, 415 flow
[2025-03-13 22:25:09,518 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:09,518 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:09,518 INFO  L206   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]
[2025-03-13 22:25:09,518 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-13 22:25:09,518 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:09,518 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:09,518 INFO  L85        PathProgramCache]: Analyzing trace with hash 976189381, now seen corresponding path program 1 times
[2025-03-13 22:25:09,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:09,519 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670665208]
[2025-03-13 22:25:09,519 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:09,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:09,524 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-03-13 22:25:09,528 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-03-13 22:25:09,528 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:09,528 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:09,551 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:09,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:09,551 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670665208]
[2025-03-13 22:25:09,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670665208] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:09,551 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:09,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:09,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933162250]
[2025-03-13 22:25:09,551 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:09,551 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:09,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:09,552 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:09,552 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:09,559 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 198 out of 235
[2025-03-13 22:25:09,560 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 201 transitions, 415 flow. Second operand  has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:09,560 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:09,560 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 235
[2025-03-13 22:25:09,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:10,085 INFO  L124   PetriNetUnfolderBase]: 2062/5252 cut-off events.
[2025-03-13 22:25:10,085 INFO  L125   PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES.
[2025-03-13 22:25:10,102 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8514 conditions, 5252 events. 2062/5252 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 44088 event pairs, 910 based on Foata normal form. 0/4720 useless extension candidates. Maximal degree in co-relation 6469. Up to 1687 conditions per place. 
[2025-03-13 22:25:10,119 INFO  L140   encePairwiseOnDemand]: 233/235 looper letters, 40 selfloop transitions, 1 changer transitions 0/213 dead transitions.
[2025-03-13 22:25:10,119 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 213 transitions, 525 flow
[2025-03-13 22:25:10,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:10,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:10,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions.
[2025-03-13 22:25:10,121 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.902127659574468
[2025-03-13 22:25:10,121 INFO  L175             Difference]: Start difference. First operand has 207 places, 201 transitions, 415 flow. Second operand 3 states and 636 transitions.
[2025-03-13 22:25:10,121 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 213 transitions, 525 flow
[2025-03-13 22:25:10,123 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 213 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:10,124 INFO  L231             Difference]: Finished difference. Result has 206 places, 200 transitions, 411 flow
[2025-03-13 22:25:10,124 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=206, PETRI_TRANSITIONS=200}
[2025-03-13 22:25:10,125 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -13 predicate places.
[2025-03-13 22:25:10,125 INFO  L471      AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 411 flow
[2025-03-13 22:25:10,125 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:10,126 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:10,126 INFO  L206   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]
[2025-03-13 22:25:10,126 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-13 22:25:10,126 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:10,126 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:10,126 INFO  L85        PathProgramCache]: Analyzing trace with hash 744594477, now seen corresponding path program 1 times
[2025-03-13 22:25:10,126 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:10,126 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032933753]
[2025-03-13 22:25:10,127 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:10,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:10,135 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes.
[2025-03-13 22:25:10,140 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements.
[2025-03-13 22:25:10,140 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:10,140 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:10,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:10,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:10,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032933753]
[2025-03-13 22:25:10,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032933753] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:10,192 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:10,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:10,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900806292]
[2025-03-13 22:25:10,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:10,193 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:10,193 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:10,193 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:10,193 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:10,208 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 196 out of 235
[2025-03-13 22:25:10,209 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 411 flow. Second operand  has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:10,209 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:10,209 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 235
[2025-03-13 22:25:10,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:10,633 INFO  L124   PetriNetUnfolderBase]: 2675/6405 cut-off events.
[2025-03-13 22:25:10,634 INFO  L125   PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES.
[2025-03-13 22:25:10,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10417 conditions, 6405 events. 2675/6405 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 55117 event pairs, 1449 based on Foata normal form. 0/5645 useless extension candidates. Maximal degree in co-relation 8037. Up to 2744 conditions per place. 
[2025-03-13 22:25:10,678 INFO  L140   encePairwiseOnDemand]: 232/235 looper letters, 41 selfloop transitions, 2 changer transitions 0/212 dead transitions.
[2025-03-13 22:25:10,678 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 212 transitions, 525 flow
[2025-03-13 22:25:10,679 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:10,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:10,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions.
[2025-03-13 22:25:10,680 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8964539007092198
[2025-03-13 22:25:10,680 INFO  L175             Difference]: Start difference. First operand has 206 places, 200 transitions, 411 flow. Second operand 3 states and 632 transitions.
[2025-03-13 22:25:10,680 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 212 transitions, 525 flow
[2025-03-13 22:25:10,682 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 212 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:10,684 INFO  L231             Difference]: Finished difference. Result has 206 places, 199 transitions, 412 flow
[2025-03-13 22:25:10,684 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=206, PETRI_TRANSITIONS=199}
[2025-03-13 22:25:10,685 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -13 predicate places.
[2025-03-13 22:25:10,685 INFO  L471      AbstractCegarLoop]: Abstraction has has 206 places, 199 transitions, 412 flow
[2025-03-13 22:25:10,686 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:10,686 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:10,686 INFO  L206   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]
[2025-03-13 22:25:10,686 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-13 22:25:10,686 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:10,687 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:10,687 INFO  L85        PathProgramCache]: Analyzing trace with hash -1381183121, now seen corresponding path program 1 times
[2025-03-13 22:25:10,687 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:10,687 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455805188]
[2025-03-13 22:25:10,687 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:10,687 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:10,698 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes.
[2025-03-13 22:25:10,705 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements.
[2025-03-13 22:25:10,708 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:10,708 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:10,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:10,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:10,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455805188]
[2025-03-13 22:25:10,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455805188] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:10,743 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:10,743 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:10,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510292361]
[2025-03-13 22:25:10,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:10,744 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:10,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:10,744 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:10,746 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:10,754 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 198 out of 235
[2025-03-13 22:25:10,755 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 199 transitions, 412 flow. Second operand  has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:10,755 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:10,755 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 235
[2025-03-13 22:25:10,756 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:11,111 INFO  L124   PetriNetUnfolderBase]: 2090/5019 cut-off events.
[2025-03-13 22:25:11,111 INFO  L125   PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES.
[2025-03-13 22:25:11,131 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8324 conditions, 5019 events. 2090/5019 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 40256 event pairs, 809 based on Foata normal form. 0/4540 useless extension candidates. Maximal degree in co-relation 6378. Up to 1626 conditions per place. 
[2025-03-13 22:25:11,140 INFO  L140   encePairwiseOnDemand]: 233/235 looper letters, 37 selfloop transitions, 1 changer transitions 6/211 dead transitions.
[2025-03-13 22:25:11,141 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 211 transitions, 522 flow
[2025-03-13 22:25:11,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:11,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:11,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions.
[2025-03-13 22:25:11,142 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.902127659574468
[2025-03-13 22:25:11,142 INFO  L175             Difference]: Start difference. First operand has 206 places, 199 transitions, 412 flow. Second operand 3 states and 636 transitions.
[2025-03-13 22:25:11,142 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 211 transitions, 522 flow
[2025-03-13 22:25:11,144 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 211 transitions, 518 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:11,145 INFO  L231             Difference]: Finished difference. Result has 205 places, 194 transitions, 400 flow
[2025-03-13 22:25:11,146 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=205, PETRI_TRANSITIONS=194}
[2025-03-13 22:25:11,150 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -14 predicate places.
[2025-03-13 22:25:11,150 INFO  L471      AbstractCegarLoop]: Abstraction has has 205 places, 194 transitions, 400 flow
[2025-03-13 22:25:11,150 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:11,150 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:11,150 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:11,150 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-13 22:25:11,150 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting thread4Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:11,151 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:11,151 INFO  L85        PathProgramCache]: Analyzing trace with hash 1102906694, now seen corresponding path program 1 times
[2025-03-13 22:25:11,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:11,151 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928801412]
[2025-03-13 22:25:11,151 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:11,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:11,156 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-03-13 22:25:11,161 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-03-13 22:25:11,161 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:11,161 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:11,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:11,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:11,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928801412]
[2025-03-13 22:25:11,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928801412] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:11,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:11,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:11,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648097954]
[2025-03-13 22:25:11,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:11,184 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:11,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:11,185 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:11,185 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:11,193 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 196 out of 235
[2025-03-13 22:25:11,194 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 194 transitions, 400 flow. Second operand  has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:11,194 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:11,194 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 235
[2025-03-13 22:25:11,194 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:11,554 INFO  L124   PetriNetUnfolderBase]: 2100/5349 cut-off events.
[2025-03-13 22:25:11,554 INFO  L125   PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES.
[2025-03-13 22:25:11,566 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8453 conditions, 5349 events. 2100/5349 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 44793 event pairs, 1147 based on Foata normal form. 0/4565 useless extension candidates. Maximal degree in co-relation 7132. Up to 2129 conditions per place. 
[2025-03-13 22:25:11,578 INFO  L140   encePairwiseOnDemand]: 232/235 looper letters, 40 selfloop transitions, 2 changer transitions 0/206 dead transitions.
[2025-03-13 22:25:11,578 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 511 flow
[2025-03-13 22:25:11,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:11,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:11,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions.
[2025-03-13 22:25:11,579 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8950354609929078
[2025-03-13 22:25:11,580 INFO  L175             Difference]: Start difference. First operand has 205 places, 194 transitions, 400 flow. Second operand 3 states and 631 transitions.
[2025-03-13 22:25:11,580 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 511 flow
[2025-03-13 22:25:11,581 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 206 transitions, 510 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:11,582 INFO  L231             Difference]: Finished difference. Result has 201 places, 193 transitions, 401 flow
[2025-03-13 22:25:11,582 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=201, PETRI_TRANSITIONS=193}
[2025-03-13 22:25:11,583 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -18 predicate places.
[2025-03-13 22:25:11,583 INFO  L471      AbstractCegarLoop]: Abstraction has has 201 places, 193 transitions, 401 flow
[2025-03-13 22:25:11,583 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:11,583 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:11,583 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:11,584 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-13 22:25:11,584 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2025-03-13 22:25:11,584 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:11,584 INFO  L85        PathProgramCache]: Analyzing trace with hash 1721283784, now seen corresponding path program 1 times
[2025-03-13 22:25:11,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:11,584 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429536529]
[2025-03-13 22:25:11,584 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:11,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:11,595 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes.
[2025-03-13 22:25:11,599 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements.
[2025-03-13 22:25:11,599 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:11,600 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:11,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:11,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:11,631 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429536529]
[2025-03-13 22:25:11,631 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429536529] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:11,631 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:11,631 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:11,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701038418]
[2025-03-13 22:25:11,631 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:11,631 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:11,632 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:11,632 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:11,632 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:11,643 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 198 out of 235
[2025-03-13 22:25:11,645 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 193 transitions, 401 flow. Second operand  has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:11,645 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:11,646 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 235
[2025-03-13 22:25:11,646 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:11,924 INFO  L124   PetriNetUnfolderBase]: 1527/4385 cut-off events.
[2025-03-13 22:25:11,924 INFO  L125   PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES.
[2025-03-13 22:25:11,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6793 conditions, 4385 events. 1527/4385 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 36385 event pairs, 686 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 5472. Up to 1242 conditions per place. 
[2025-03-13 22:25:11,942 INFO  L140   encePairwiseOnDemand]: 233/235 looper letters, 0 selfloop transitions, 0 changer transitions 205/205 dead transitions.
[2025-03-13 22:25:11,942 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 205 transitions, 508 flow
[2025-03-13 22:25:11,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:11,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:11,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions.
[2025-03-13 22:25:11,944 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.900709219858156
[2025-03-13 22:25:11,944 INFO  L175             Difference]: Start difference. First operand has 201 places, 193 transitions, 401 flow. Second operand 3 states and 635 transitions.
[2025-03-13 22:25:11,944 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 205 transitions, 508 flow
[2025-03-13 22:25:11,945 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 205 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:11,946 INFO  L231             Difference]: Finished difference. Result has 200 places, 0 transitions, 0 flow
[2025-03-13 22:25:11,946 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=200, PETRI_TRANSITIONS=0}
[2025-03-13 22:25:11,946 INFO  L279   CegarLoopForPetriNet]: 219 programPoint places, -19 predicate places.
[2025-03-13 22:25:11,946 INFO  L471      AbstractCegarLoop]: Abstraction has has 200 places, 0 transitions, 0 flow
[2025-03-13 22:25:11,947 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-13 22:25:11,949 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (23 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 24 remaining)
[2025-03-13 22:25:11,950 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 24 remaining)
[2025-03-13 22:25:11,951 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 24 remaining)
[2025-03-13 22:25:11,951 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining)
[2025-03-13 22:25:11,951 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining)
[2025-03-13 22:25:11,951 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining)
[2025-03-13 22:25:11,951 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining)
[2025-03-13 22:25:11,951 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining)
[2025-03-13 22:25:11,951 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining)
[2025-03-13 22:25:11,951 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining)
[2025-03-13 22:25:11,951 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining)
[2025-03-13 22:25:11,951 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining)
[2025-03-13 22:25:11,951 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining)
[2025-03-13 22:25:11,951 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-13 22:25:11,952 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:11,955 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-03-13 22:25:11,955 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-13 22:25:11,959 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:25:11 BasicIcfg
[2025-03-13 22:25:11,959 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-13 22:25:11,960 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-13 22:25:11,960 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-13 22:25:11,960 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-13 22:25:11,960 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:04" (3/4) ...
[2025-03-13 22:25:11,962 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-13 22:25:11,963 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread1
[2025-03-13 22:25:11,964 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread2
[2025-03-13 22:25:11,964 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread3
[2025-03-13 22:25:11,964 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread4
[2025-03-13 22:25:11,966 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges
[2025-03-13 22:25:11,966 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-13 22:25:11,966 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2025-03-13 22:25:11,966 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-13 22:25:12,019 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-13 22:25:12,019 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-13 22:25:12,019 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-13 22:25:12,020 INFO  L158              Benchmark]: Toolchain (without parser) took 8139.95ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 112.5MB in the beginning and 290.6MB in the end (delta: -178.2MB). Peak memory consumption was 462.3MB. Max. memory is 16.1GB.
[2025-03-13 22:25:12,020 INFO  L158              Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-13 22:25:12,020 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 182.28ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 100.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-13 22:25:12,020 INFO  L158              Benchmark]: Boogie Procedure Inliner took 33.49ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-13 22:25:12,020 INFO  L158              Benchmark]: Boogie Preprocessor took 25.08ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-13 22:25:12,020 INFO  L158              Benchmark]: IcfgBuilder took 408.76ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 75.9MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-13 22:25:12,021 INFO  L158              Benchmark]: TraceAbstraction took 7425.13ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 75.4MB in the beginning and 294.8MB in the end (delta: -219.4MB). Peak memory consumption was 428.7MB. Max. memory is 16.1GB.
[2025-03-13 22:25:12,021 INFO  L158              Benchmark]: Witness Printer took 59.32ms. Allocated memory is still 788.5MB. Free memory was 294.8MB in the beginning and 290.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-13 22:25:12,022 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 182.28ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 100.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 33.49ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 25.08ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 408.76ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 75.9MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 7425.13ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 75.4MB in the beginning and 294.8MB in the end (delta: -219.4MB). Peak memory consumption was 428.7MB. Max. memory is 16.1GB.
 * Witness Printer took 59.32ms. Allocated memory is still 788.5MB. Free memory was 294.8MB in the beginning and 290.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 41]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 43]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 52]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 54]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 62]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 64]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 85]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 86]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 87]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 88]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 72]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 74]: there are no data races
    For all program executions holds that there are no data races at this location
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 335 locations, 24 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 839 IncrementalHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 30 mSDtfsCounter, 839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=449occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 912 NumberOfCodeBlocks, 912 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 900 ConstructedInterpolants, 0 QuantifiedInterpolants, 924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    12 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-03-13 22:25:12,034 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE