./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 09:26:54,961 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 09:26:55,017 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-02-06 09:26:55,021 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 09:26:55,021 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 09:26:55,037 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 09:26:55,037 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 09:26:55,037 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 09:26:55,038 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-06 09:26:55,038 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-06 09:26:55,038 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 09:26:55,038 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 09:26:55,038 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 09:26:55,038 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 09:26:55,038 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-06 09:26:55,038 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-06 09:26:55,038 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-06 09:26:55,038 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-06 09:26:55,038 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 09:26:55,038 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-06 09:26:55,038 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 09:26:55,039 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 09:26:55,039 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-06 09:26:55,039 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-06 09:26:55,040 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-06 09:26:55,040 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-06 09:26:55,040 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-jdk21/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 -> 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b
[2025-02-06 09:26:55,279 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 09:26:55,291 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 09:26:55,293 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 09:26:55,294 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 09:26:55,295 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 09:26:55,295 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i
[2025-02-06 09:26:56,504 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/415e713c7/84bd0b7ebbaa482684dfdf00ad7ff838/FLAG302845da4
[2025-02-06 09:26:56,773 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 09:26:56,774 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i
[2025-02-06 09:26:56,786 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/415e713c7/84bd0b7ebbaa482684dfdf00ad7ff838/FLAG302845da4
[2025-02-06 09:26:57,052 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/415e713c7/84bd0b7ebbaa482684dfdf00ad7ff838
[2025-02-06 09:26:57,054 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 09:26:57,056 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 09:26:57,057 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 09:26:57,057 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 09:26:57,060 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 09:26:57,061 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,063 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d3d26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57, skipping insertion in model container
[2025-02-06 09:26:57,063 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,093 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 09:26:57,424 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 09:26:57,439 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 09:26:57,492 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 09:26:57,536 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 09:26:57,537 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57 WrapperNode
[2025-02-06 09:26:57,537 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 09:26:57,538 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 09:26:57,538 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 09:26:57,538 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 09:26:57,543 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,564 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,599 INFO  L138                Inliner]: procedures = 279, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 366
[2025-02-06 09:26:57,600 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 09:26:57,600 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 09:26:57,600 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 09:26:57,600 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 09:26:57,606 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,607 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,617 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,618 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,643 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,649 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,651 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,654 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,659 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 09:26:57,663 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 09:26:57,663 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 09:26:57,663 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 09:26:57,664 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (1/1) ...
[2025-02-06 09:26:57,671 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 09:26:57,683 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 09:26:57,695 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-06 09:26:57,698 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-06 09:26:57,715 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-02-06 09:26:57,716 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2025-02-06 09:26:57,716 INFO  L130     BoogieDeclarations]: Found specification of procedure t1_fun
[2025-02-06 09:26:57,716 INFO  L138     BoogieDeclarations]: Found implementation of procedure t1_fun
[2025-02-06 09:26:57,716 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-02-06 09:26:57,716 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2025-02-06 09:26:57,716 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-02-06 09:26:57,716 INFO  L130     BoogieDeclarations]: Found specification of procedure t2_fun
[2025-02-06 09:26:57,717 INFO  L138     BoogieDeclarations]: Found implementation of procedure t2_fun
[2025-02-06 09:26:57,717 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-02-06 09:26:57,718 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2025-02-06 09:26:57,718 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-02-06 09:26:57,718 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 09:26:57,718 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2025-02-06 09:26:57,718 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-02-06 09:26:57,718 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 09:26:57,718 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 09:26:57,719 WARN  L227             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-02-06 09:26:57,851 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 09:26:57,853 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 09:26:58,402 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1043: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset;
[2025-02-06 09:26:58,403 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1043-1: SUMMARY for call ULTIMATE.dealloc(main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset); srcloc: null
[2025-02-06 09:26:58,403 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1042: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset;
[2025-02-06 09:26:58,403 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1042-1: SUMMARY for call ULTIMATE.dealloc(main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset); srcloc: null
[2025-02-06 09:26:58,404 INFO  L304             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-02-06 09:26:58,404 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 09:26:58,429 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 09:26:58,432 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 09:26:58,432 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:26:58 BoogieIcfgContainer
[2025-02-06 09:26:58,432 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 09:26:58,434 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-06 09:26:58,434 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-06 09:26:58,441 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-06 09:26:58,441 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:26:57" (1/3) ...
[2025-02-06 09:26:58,441 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ed65d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:26:58, skipping insertion in model container
[2025-02-06 09:26:58,442 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:57" (2/3) ...
[2025-02-06 09:26:58,442 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ed65d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:26:58, skipping insertion in model container
[2025-02-06 09:26:58,442 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:26:58" (3/3) ...
[2025-02-06 09:26:58,443 INFO  L128   eAbstractionObserver]: Analyzing ICFG 28-race_reach_81-list_racing.i
[2025-02-06 09:26:58,453 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-06 09:26:58,454 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_81-list_racing.i that has 3 procedures, 390 locations, 1 initial locations, 10 loop locations, and 22 error locations.
[2025-02-06 09:26:58,455 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-02-06 09:26:58,563 INFO  L143    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2025-02-06 09:26:58,596 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 396 places, 411 transitions, 842 flow
[2025-02-06 09:26:58,800 INFO  L124   PetriNetUnfolderBase]: 40/724 cut-off events.
[2025-02-06 09:26:58,803 INFO  L125   PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES.
[2025-02-06 09:26:58,814 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 741 conditions, 724 events. 40/724 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3110 event pairs, 0 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 382. Up to 8 conditions per place. 
[2025-02-06 09:26:58,814 INFO  L82        GeneralOperation]: Start removeDead. Operand has 396 places, 411 transitions, 842 flow
[2025-02-06 09:26:58,822 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 396 places, 411 transitions, 842 flow
[2025-02-06 09:26:58,833 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 09:26:58,843 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;@40d8a480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 09:26:58,843 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 38 error locations.
[2025-02-06 09:26:58,853 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-02-06 09:26:58,853 INFO  L124   PetriNetUnfolderBase]: 0/85 cut-off events.
[2025-02-06 09:26:58,853 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-06 09:26:58,853 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:26:58,854 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]
[2025-02-06 09:26:58,855 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] ===
[2025-02-06 09:26:58,859 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:26:58,860 INFO  L85        PathProgramCache]: Analyzing trace with hash 1191411606, now seen corresponding path program 1 times
[2025-02-06 09:26:58,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:26:58,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850988468]
[2025-02-06 09:26:58,865 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:26:58,867 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:26:58,939 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-02-06 09:26:58,973 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-02-06 09:26:58,974 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:26:58,974 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:26:59,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:26:59,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:26:59,118 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850988468]
[2025-02-06 09:26:59,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850988468] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:26:59,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:26:59,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:26:59,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518500264]
[2025-02-06 09:26:59,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:26:59,125 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:26:59,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:26:59,142 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:26:59,142 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:26:59,176 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 371 out of 411
[2025-02-06 09:26:59,182 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 411 transitions, 842 flow. Second operand  has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 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-02-06 09:26:59,183 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:26:59,183 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 411
[2025-02-06 09:26:59,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:26:59,721 INFO  L124   PetriNetUnfolderBase]: 184/2408 cut-off events.
[2025-02-06 09:26:59,721 INFO  L125   PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES.
[2025-02-06 09:26:59,730 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 2408 events. 184/2408 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 17822 event pairs, 132 based on Foata normal form. 156/2333 useless extension candidates. Maximal degree in co-relation 1828. Up to 283 conditions per place. 
[2025-02-06 09:26:59,739 INFO  L140   encePairwiseOnDemand]: 395/411 looper letters, 23 selfloop transitions, 2 changer transitions 0/395 dead transitions.
[2025-02-06 09:26:59,739 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 395 transitions, 860 flow
[2025-02-06 09:26:59,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:26:59,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:26:59,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions.
[2025-02-06 09:26:59,757 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9343065693430657
[2025-02-06 09:26:59,758 INFO  L175             Difference]: Start difference. First operand has 396 places, 411 transitions, 842 flow. Second operand 3 states and 1152 transitions.
[2025-02-06 09:26:59,759 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 395 transitions, 860 flow
[2025-02-06 09:26:59,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 395 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-06 09:26:59,775 INFO  L231             Difference]: Finished difference. Result has 395 places, 395 transitions, 814 flow
[2025-02-06 09:26:59,778 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=395, PETRI_TRANSITIONS=395}
[2025-02-06 09:26:59,781 INFO  L279   CegarLoopForPetriNet]: 396 programPoint places, -1 predicate places.
[2025-02-06 09:26:59,781 INFO  L471      AbstractCegarLoop]: Abstraction has has 395 places, 395 transitions, 814 flow
[2025-02-06 09:26:59,782 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 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-02-06 09:26:59,782 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:26:59,782 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]
[2025-02-06 09:26:59,782 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-06 09:26:59,782 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] ===
[2025-02-06 09:26:59,783 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:26:59,783 INFO  L85        PathProgramCache]: Analyzing trace with hash 342056677, now seen corresponding path program 1 times
[2025-02-06 09:26:59,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:26:59,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534885492]
[2025-02-06 09:26:59,783 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:26:59,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:26:59,807 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-02-06 09:26:59,819 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-02-06 09:26:59,824 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:26:59,824 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:26:59,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:26:59,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:26:59,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534885492]
[2025-02-06 09:26:59,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534885492] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:26:59,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:26:59,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:26:59,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034153575]
[2025-02-06 09:26:59,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:26:59,904 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:26:59,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:26:59,905 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:26:59,906 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:26:59,927 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 371 out of 411
[2025-02-06 09:26:59,929 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 395 transitions, 814 flow. Second operand  has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 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-02-06 09:26:59,929 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:26:59,929 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 411
[2025-02-06 09:26:59,930 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:27:00,251 INFO  L124   PetriNetUnfolderBase]: 104/1872 cut-off events.
[2025-02-06 09:27:00,251 INFO  L125   PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES.
[2025-02-06 09:27:00,260 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 1872 events. 104/1872 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11473 event pairs, 72 based on Foata normal form. 0/1696 useless extension candidates. Maximal degree in co-relation 2024. Up to 185 conditions per place. 
[2025-02-06 09:27:00,267 INFO  L140   encePairwiseOnDemand]: 407/411 looper letters, 22 selfloop transitions, 1 changer transitions 0/392 dead transitions.
[2025-02-06 09:27:00,267 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 392 transitions, 854 flow
[2025-02-06 09:27:00,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:27:00,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:27:00,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions.
[2025-02-06 09:27:00,270 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9237631792376317
[2025-02-06 09:27:00,270 INFO  L175             Difference]: Start difference. First operand has 395 places, 395 transitions, 814 flow. Second operand 3 states and 1139 transitions.
[2025-02-06 09:27:00,270 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 392 transitions, 854 flow
[2025-02-06 09:27:00,273 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 392 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:27:00,276 INFO  L231             Difference]: Finished difference. Result has 392 places, 392 transitions, 806 flow
[2025-02-06 09:27:00,277 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=392, PETRI_TRANSITIONS=392}
[2025-02-06 09:27:00,277 INFO  L279   CegarLoopForPetriNet]: 396 programPoint places, -4 predicate places.
[2025-02-06 09:27:00,277 INFO  L471      AbstractCegarLoop]: Abstraction has has 392 places, 392 transitions, 806 flow
[2025-02-06 09:27:00,278 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 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-02-06 09:27:00,278 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:27:00,278 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]
[2025-02-06 09:27:00,278 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-06 09:27:00,279 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] ===
[2025-02-06 09:27:00,279 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:27:00,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -1297288877, now seen corresponding path program 1 times
[2025-02-06 09:27:00,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:27:00,279 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665398459]
[2025-02-06 09:27:00,279 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:27:00,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:27:00,317 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-02-06 09:27:00,334 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-02-06 09:27:00,335 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:27:00,336 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:27:00,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:27:00,870 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:27:00,870 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665398459]
[2025-02-06 09:27:00,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665398459] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:27:00,871 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:27:00,871 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:27:00,871 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523034385]
[2025-02-06 09:27:00,871 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:27:00,871 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 09:27:00,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:27:00,872 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 09:27:00,872 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-06 09:27:01,227 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 306 out of 411
[2025-02-06 09:27:01,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 392 transitions, 806 flow. Second operand  has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 0 states have call successors, (0), 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-02-06 09:27:01,229 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:27:01,229 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 411
[2025-02-06 09:27:01,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:27:08,521 INFO  L124   PetriNetUnfolderBase]: 22282/61168 cut-off events.
[2025-02-06 09:27:08,521 INFO  L125   PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES.
[2025-02-06 09:27:08,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95235 conditions, 61168 events. 22282/61168 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 1103. Compared 724005 event pairs, 21418 based on Foata normal form. 0/57030 useless extension candidates. Maximal degree in co-relation 95141. Up to 33875 conditions per place. 
[2025-02-06 09:27:08,825 INFO  L140   encePairwiseOnDemand]: 405/411 looper letters, 85 selfloop transitions, 5 changer transitions 0/391 dead transitions.
[2025-02-06 09:27:08,825 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 391 transitions, 984 flow
[2025-02-06 09:27:08,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:27:08,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:27:08,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1927 transitions.
[2025-02-06 09:27:08,832 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.7814274128142741
[2025-02-06 09:27:08,833 INFO  L175             Difference]: Start difference. First operand has 392 places, 392 transitions, 806 flow. Second operand 6 states and 1927 transitions.
[2025-02-06 09:27:08,833 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 391 transitions, 984 flow
[2025-02-06 09:27:08,841 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 391 transitions, 983 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-02-06 09:27:08,845 INFO  L231             Difference]: Finished difference. Result has 395 places, 391 transitions, 813 flow
[2025-02-06 09:27:08,846 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=813, PETRI_PLACES=395, PETRI_TRANSITIONS=391}
[2025-02-06 09:27:08,847 INFO  L279   CegarLoopForPetriNet]: 396 programPoint places, -1 predicate places.
[2025-02-06 09:27:08,847 INFO  L471      AbstractCegarLoop]: Abstraction has has 395 places, 391 transitions, 813 flow
[2025-02-06 09:27:08,848 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 0 states have call successors, (0), 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-02-06 09:27:08,848 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:27:08,848 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, 1]
[2025-02-06 09:27:08,848 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-06 09:27:08,849 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] ===
[2025-02-06 09:27:08,850 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:27:08,851 INFO  L85        PathProgramCache]: Analyzing trace with hash 1603910716, now seen corresponding path program 1 times
[2025-02-06 09:27:08,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:27:08,851 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796757892]
[2025-02-06 09:27:08,851 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:27:08,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:27:08,867 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-02-06 09:27:08,878 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-02-06 09:27:08,878 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:27:08,878 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:27:09,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:27:09,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:27:09,226 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796757892]
[2025-02-06 09:27:09,226 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796757892] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:27:09,226 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:27:09,226 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:27:09,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776725253]
[2025-02-06 09:27:09,227 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:27:09,227 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 09:27:09,227 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:27:09,227 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 09:27:09,228 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-06 09:27:09,522 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 306 out of 411
[2025-02-06 09:27:09,524 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 391 transitions, 813 flow. Second operand  has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 0 states have call successors, (0), 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-02-06 09:27:09,525 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:27:09,525 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 411
[2025-02-06 09:27:09,525 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:27:15,622 INFO  L124   PetriNetUnfolderBase]: 22282/61167 cut-off events.
[2025-02-06 09:27:15,622 INFO  L125   PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES.
[2025-02-06 09:27:15,734 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95239 conditions, 61167 events. 22282/61167 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 1103. Compared 723958 event pairs, 21418 based on Foata normal form. 0/57030 useless extension candidates. Maximal degree in co-relation 95145. Up to 33875 conditions per place. 
[2025-02-06 09:27:15,915 INFO  L140   encePairwiseOnDemand]: 405/411 looper letters, 85 selfloop transitions, 5 changer transitions 0/390 dead transitions.
[2025-02-06 09:27:15,915 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 390 transitions, 991 flow
[2025-02-06 09:27:15,916 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:27:15,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:27:15,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1927 transitions.
[2025-02-06 09:27:15,920 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.7814274128142741
[2025-02-06 09:27:15,920 INFO  L175             Difference]: Start difference. First operand has 395 places, 391 transitions, 813 flow. Second operand 6 states and 1927 transitions.
[2025-02-06 09:27:15,920 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 390 transitions, 991 flow
[2025-02-06 09:27:15,926 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 390 transitions, 981 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-02-06 09:27:15,928 INFO  L231             Difference]: Finished difference. Result has 394 places, 390 transitions, 811 flow
[2025-02-06 09:27:15,929 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=811, PETRI_PLACES=394, PETRI_TRANSITIONS=390}
[2025-02-06 09:27:15,930 INFO  L279   CegarLoopForPetriNet]: 396 programPoint places, -2 predicate places.
[2025-02-06 09:27:15,930 INFO  L471      AbstractCegarLoop]: Abstraction has has 394 places, 390 transitions, 811 flow
[2025-02-06 09:27:15,931 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 0 states have call successors, (0), 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-02-06 09:27:15,931 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:27:15,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:27:15,932 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-06 09:27:15,932 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] ===
[2025-02-06 09:27:15,933 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:27:15,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -853062212, now seen corresponding path program 1 times
[2025-02-06 09:27:15,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:27:15,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708666684]
[2025-02-06 09:27:15,934 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:27:15,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:27:15,953 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-02-06 09:27:15,971 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-02-06 09:27:15,972 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:27:15,972 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:27:16,328 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:27:16,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:27:16,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708666684]
[2025-02-06 09:27:16,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708666684] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:27:16,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:27:16,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:27:16,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749237852]
[2025-02-06 09:27:16,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:27:16,330 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 09:27:16,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:27:16,331 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 09:27:16,331 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-06 09:27:16,829 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 299 out of 411
[2025-02-06 09:27:16,831 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 390 transitions, 811 flow. Second operand  has 6 states, 6 states have (on average 301.8333333333333) internal successors, (1811), 6 states have internal predecessors, (1811), 0 states have call successors, (0), 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-02-06 09:27:16,831 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:27:16,831 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 411
[2025-02-06 09:27:16,831 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:27:24,497 INFO  L124   PetriNetUnfolderBase]: 26036/70842 cut-off events.
[2025-02-06 09:27:24,497 INFO  L125   PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES.
[2025-02-06 09:27:24,652 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110650 conditions, 70842 events. 26036/70842 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 1375. Compared 867508 event pairs, 24776 based on Foata normal form. 0/65983 useless extension candidates. Maximal degree in co-relation 110555. Up to 39463 conditions per place. 
[2025-02-06 09:27:24,861 INFO  L140   encePairwiseOnDemand]: 384/411 looper letters, 105 selfloop transitions, 86 changer transitions 0/483 dead transitions.
[2025-02-06 09:27:24,862 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 483 transitions, 1379 flow
[2025-02-06 09:27:24,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:27:24,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:27:24,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1986 transitions.
[2025-02-06 09:27:24,867 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.805352798053528
[2025-02-06 09:27:24,867 INFO  L175             Difference]: Start difference. First operand has 394 places, 390 transitions, 811 flow. Second operand 6 states and 1986 transitions.
[2025-02-06 09:27:24,867 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 483 transitions, 1379 flow
[2025-02-06 09:27:24,872 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 483 transitions, 1369 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-02-06 09:27:24,882 INFO  L231             Difference]: Finished difference. Result has 399 places, 475 transitions, 1367 flow
[2025-02-06 09:27:24,883 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1367, PETRI_PLACES=399, PETRI_TRANSITIONS=475}
[2025-02-06 09:27:24,885 INFO  L279   CegarLoopForPetriNet]: 396 programPoint places, 3 predicate places.
[2025-02-06 09:27:24,885 INFO  L471      AbstractCegarLoop]: Abstraction has has 399 places, 475 transitions, 1367 flow
[2025-02-06 09:27:24,887 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 301.8333333333333) internal successors, (1811), 6 states have internal predecessors, (1811), 0 states have call successors, (0), 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-02-06 09:27:24,887 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:27:24,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:27:24,887 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-06 09:27:24,887 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] ===
[2025-02-06 09:27:24,888 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:27:24,888 INFO  L85        PathProgramCache]: Analyzing trace with hash -1434384662, now seen corresponding path program 1 times
[2025-02-06 09:27:24,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:27:24,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091395509]
[2025-02-06 09:27:24,888 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:27:24,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:27:24,909 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-02-06 09:27:24,915 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-02-06 09:27:24,916 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:27:24,916 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:27:24,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:27:24,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:27:24,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091395509]
[2025-02-06 09:27:24,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091395509] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:27:24,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:27:24,966 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 09:27:24,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546829764]
[2025-02-06 09:27:24,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:27:24,966 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:27:24,966 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:27:24,967 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:27:24,967 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:27:24,985 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 375 out of 411
[2025-02-06 09:27:24,987 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 475 transitions, 1367 flow. Second operand  has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 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-02-06 09:27:24,987 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:27:24,988 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 411
[2025-02-06 09:27:24,988 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:27:25,213 INFO  L124   PetriNetUnfolderBase]: 290/2464 cut-off events.
[2025-02-06 09:27:25,214 INFO  L125   PetriNetUnfolderBase]: For 218/241 co-relation queries the response was YES.
[2025-02-06 09:27:25,221 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 2464 events. 290/2464 cut-off events. For 218/241 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 17007 event pairs, 94 based on Foata normal form. 1/2270 useless extension candidates. Maximal degree in co-relation 3248. Up to 237 conditions per place. 
[2025-02-06 09:27:25,227 INFO  L140   encePairwiseOnDemand]: 408/411 looper letters, 22 selfloop transitions, 3 changer transitions 0/477 dead transitions.
[2025-02-06 09:27:25,227 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 477 transitions, 1421 flow
[2025-02-06 09:27:25,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:27:25,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:27:25,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions.
[2025-02-06 09:27:25,229 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9326845093268451
[2025-02-06 09:27:25,229 INFO  L175             Difference]: Start difference. First operand has 399 places, 475 transitions, 1367 flow. Second operand 3 states and 1150 transitions.
[2025-02-06 09:27:25,229 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 477 transitions, 1421 flow
[2025-02-06 09:27:25,234 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 477 transitions, 1421 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-06 09:27:25,239 INFO  L231             Difference]: Finished difference. Result has 402 places, 475 transitions, 1378 flow
[2025-02-06 09:27:25,239 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1378, PETRI_PLACES=402, PETRI_TRANSITIONS=475}
[2025-02-06 09:27:25,240 INFO  L279   CegarLoopForPetriNet]: 396 programPoint places, 6 predicate places.
[2025-02-06 09:27:25,240 INFO  L471      AbstractCegarLoop]: Abstraction has has 402 places, 475 transitions, 1378 flow
[2025-02-06 09:27:25,241 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 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-02-06 09:27:25,241 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:27:25,241 INFO  L206   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:27:25,241 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-06 09:27:25,241 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 34 more)] ===
[2025-02-06 09:27:25,241 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:27:25,242 INFO  L85        PathProgramCache]: Analyzing trace with hash 662758682, now seen corresponding path program 1 times
[2025-02-06 09:27:25,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:27:25,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347217995]
[2025-02-06 09:27:25,242 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:27:25,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:27:25,256 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-02-06 09:27:25,275 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-02-06 09:27:25,276 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:27:25,276 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 09:27:25,276 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 09:27:25,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-02-06 09:27:25,298 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-02-06 09:27:25,299 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:27:25,299 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 09:27:25,341 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 09:27:25,342 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-02-06 09:27:25,343 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining)
[2025-02-06 09:27:25,344 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining)
[2025-02-06 09:27:25,344 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining)
[2025-02-06 09:27:25,345 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining)
[2025-02-06 09:27:25,345 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining)
[2025-02-06 09:27:25,345 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining)
[2025-02-06 09:27:25,345 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining)
[2025-02-06 09:27:25,345 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining)
[2025-02-06 09:27:25,346 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining)
[2025-02-06 09:27:25,347 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-06 09:27:25,347 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:27:25,353 WARN  L246   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2025-02-06 09:27:25,353 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2025-02-06 09:27:25,641 INFO  L143    ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions.
[2025-02-06 09:27:25,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 603 places, 634 transitions, 1312 flow
[2025-02-06 09:27:25,968 INFO  L124   PetriNetUnfolderBase]: 153/1967 cut-off events.
[2025-02-06 09:27:25,969 INFO  L125   PetriNetUnfolderBase]: For 72/90 co-relation queries the response was YES.
[2025-02-06 09:27:26,003 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 1967 events. 153/1967 cut-off events. For 72/90 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13401 event pairs, 2 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 1247. Up to 32 conditions per place. 
[2025-02-06 09:27:26,004 INFO  L82        GeneralOperation]: Start removeDead. Operand has 603 places, 634 transitions, 1312 flow
[2025-02-06 09:27:26,023 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 603 places, 634 transitions, 1312 flow
[2025-02-06 09:27:26,024 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 09:27:26,025 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;@40d8a480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 09:27:26,025 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 52 error locations.
[2025-02-06 09:27:26,028 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-02-06 09:27:26,029 INFO  L124   PetriNetUnfolderBase]: 0/85 cut-off events.
[2025-02-06 09:27:26,029 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-06 09:27:26,029 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:27:26,029 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]
[2025-02-06 09:27:26,029 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 48 more)] ===
[2025-02-06 09:27:26,029 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:27:26,030 INFO  L85        PathProgramCache]: Analyzing trace with hash -1113715698, now seen corresponding path program 1 times
[2025-02-06 09:27:26,030 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:27:26,030 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6868900]
[2025-02-06 09:27:26,030 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:27:26,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:27:26,039 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-02-06 09:27:26,042 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-02-06 09:27:26,043 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:27:26,043 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:27:26,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 09:27:26,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:27:26,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6868900]
[2025-02-06 09:27:26,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6868900] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:27:26,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:27:26,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:27:26,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283781105]
[2025-02-06 09:27:26,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:27:26,061 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:27:26,061 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:27:26,062 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:27:26,062 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:27:26,081 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 562 out of 634
[2025-02-06 09:27:26,083 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 634 transitions, 1312 flow. Second operand  has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 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-02-06 09:27:26,083 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:27:26,083 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 634
[2025-02-06 09:27:26,084 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand