./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash beff54424fcf36aab8f456fbde1b8a8c3ae1314f098c6178f3e14ce4b705395c
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 23:02:44,271 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 23:02:44,272 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 23:02:44,292 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 23:02:44,292 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 23:02:44,293 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 23:02:44,294 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 23:02:44,295 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 23:02:44,296 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 23:02:44,297 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 23:02:44,297 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 23:02:44,298 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 23:02:44,298 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 23:02:44,299 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 23:02:44,300 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 23:02:44,301 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 23:02:44,301 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 23:02:44,302 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 23:02:44,303 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 23:02:44,304 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 23:02:44,305 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 23:02:44,306 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 23:02:44,307 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 23:02:44,307 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 23:02:44,310 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 23:02:44,310 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 23:02:44,310 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 23:02:44,311 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 23:02:44,311 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 23:02:44,312 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 23:02:44,312 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 23:02:44,313 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 23:02:44,313 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 23:02:44,314 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 23:02:44,315 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 23:02:44,315 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 23:02:44,315 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 23:02:44,315 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 23:02:44,316 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 23:02:44,316 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 23:02:44,317 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 23:02:44,318 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 23:02:44,333 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 23:02:44,333 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 23:02:44,334 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 23:02:44,334 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 23:02:44,334 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 23:02:44,335 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 23:02:44,335 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 23:02:44,335 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 23:02:44,335 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 23:02:44,336 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 23:02:44,336 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 23:02:44,336 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 23:02:44,336 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 23:02:44,336 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 23:02:44,337 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 23:02:44,337 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 23:02:44,337 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 23:02:44,337 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 23:02:44,337 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 23:02:44,338 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 23:02:44,338 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 23:02:44,338 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 23:02:44,338 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 23:02:44,338 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 23:02:44,339 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 23:02:44,339 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 23:02:44,339 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 23:02:44,339 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 23:02:44,339 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 23:02:44,340 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 23:02:44,340 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 23:02:44,340 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 23:02:44,340 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 23:02:44,341 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 23:02:44,341 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 23:02:44,341 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 23:02:44,341 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 23:02:44,342 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> beff54424fcf36aab8f456fbde1b8a8c3ae1314f098c6178f3e14ce4b705395c
[2024-03-11 23:02:44,519 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 23:02:44,538 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 23:02:44,540 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 23:02:44,541 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 23:02:44,541 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 23:02:44,542 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race.i
[2024-03-11 23:02:45,569 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 23:02:45,820 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 23:02:45,821 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race.i
[2024-03-11 23:02:45,833 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/0541b802b/aa906d0bb9394958850f63d51e5e1bd8/FLAG54dbd940c
[2024-03-11 23:02:46,176 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/0541b802b/aa906d0bb9394958850f63d51e5e1bd8
[2024-03-11 23:02:46,178 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 23:02:46,180 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 23:02:46,181 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 23:02:46,181 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 23:02:46,184 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 23:02:46,185 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,185 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516c1861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46, skipping insertion in model container
[2024-03-11 23:02:46,186 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,191 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 23:02:46,221 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 23:02:46,334 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 23:02:46,479 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 23:02:46,488 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 23:02:46,497 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 23:02:46,518 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 23:02:46,554 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 23:02:46,555 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46 WrapperNode
[2024-03-11 23:02:46,555 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 23:02:46,556 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 23:02:46,556 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 23:02:46,556 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 23:02:46,561 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,575 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,592 INFO  L138                Inliner]: procedures = 269, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84
[2024-03-11 23:02:46,592 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 23:02:46,593 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 23:02:46,593 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 23:02:46,593 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 23:02:46,599 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,599 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,602 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,603 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,609 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,611 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,612 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,613 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,616 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 23:02:46,616 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 23:02:46,616 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 23:02:46,617 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 23:02:46,617 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (1/1) ...
[2024-03-11 23:02:46,622 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 23:02:46,629 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:02:46,640 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-11 23:02:46,646 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-11 23:02:46,674 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 23:02:46,674 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 23:02:46,674 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 23:02:46,674 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-11 23:02:46,675 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 23:02:46,675 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 23:02:46,675 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-11 23:02:46,675 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 23:02:46,675 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-11 23:02:46,675 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-11 23:02:46,676 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 23:02:46,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 23:02:46,676 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 23:02:46,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 23:02:46,677 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 23:02:46,789 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 23:02:46,790 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 23:02:46,954 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 23:02:46,960 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 23:02:46,960 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 23:02:46,962 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:02:46 BoogieIcfgContainer
[2024-03-11 23:02:46,962 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 23:02:46,964 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 23:02:46,964 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 23:02:46,966 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 23:02:46,966 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:02:46" (1/3) ...
[2024-03-11 23:02:46,966 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3c199f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:02:46, skipping insertion in model container
[2024-03-11 23:02:46,967 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:02:46" (2/3) ...
[2024-03-11 23:02:46,967 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3c199f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:02:46, skipping insertion in model container
[2024-03-11 23:02:46,967 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:02:46" (3/3) ...
[2024-03-11 23:02:46,968 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race.i
[2024-03-11 23:02:46,974 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 23:02:46,981 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 23:02:46,981 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2024-03-11 23:02:46,981 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 23:02:47,019 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 23:02:47,053 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 108 places, 109 transitions, 226 flow
[2024-03-11 23:02:47,104 INFO  L130       PetriNetUnfolder]: 6/158 cut-off events.
[2024-03-11 23:02:47,104 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 23:02:47,109 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164 conditions, 158 events. 6/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 301 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2024-03-11 23:02:47,109 INFO  L82        GeneralOperation]: Start removeDead. Operand has 108 places, 109 transitions, 226 flow
[2024-03-11 23:02:47,113 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 108 places, 109 transitions, 226 flow
[2024-03-11 23:02:47,115 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:02:47,123 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 109 transitions, 226 flow
[2024-03-11 23:02:47,125 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 109 transitions, 226 flow
[2024-03-11 23:02:47,126 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 108 places, 109 transitions, 226 flow
[2024-03-11 23:02:47,149 INFO  L130       PetriNetUnfolder]: 6/158 cut-off events.
[2024-03-11 23:02:47,150 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 23:02:47,150 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164 conditions, 158 events. 6/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 301 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2024-03-11 23:02:47,152 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1568
[2024-03-11 23:02:51,838 INFO  L134        LiptonReduction]: Checked pairs total: 2392
[2024-03-11 23:02:51,839 INFO  L136        LiptonReduction]: Total number of compositions: 103
[2024-03-11 23:02:51,854 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:02:51,859 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@354dc07f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:02:51,859 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-11 23:02:51,862 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2024-03-11 23:02:51,862 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:02:51,862 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:02:51,863 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 23:02:51,864 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 23:02:51,867 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:02:51,868 INFO  L85        PathProgramCache]: Analyzing trace with hash 12447, now seen corresponding path program 1 times
[2024-03-11 23:02:51,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:02:51,875 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279233684]
[2024-03-11 23:02:51,875 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:02:51,875 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:02:51,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:02:51,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:02:51,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:02:51,997 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279233684]
[2024-03-11 23:02:51,997 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279233684] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:02:51,997 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:02:51,998 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 23:02:52,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145523870]
[2024-03-11 23:02:52,000 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:02:52,006 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:02:52,006 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:02:52,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:02:52,022 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:02:52,024 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 212
[2024-03-11 23:02:52,026 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 50 flow. Second operand  has 2 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:52,026 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:02:52,026 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 212
[2024-03-11 23:02:52,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:02:52,081 INFO  L130       PetriNetUnfolder]: 19/69 cut-off events.
[2024-03-11 23:02:52,082 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 23:02:52,082 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 131 conditions, 69 events. 19/69 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 239 event pairs, 18 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 101. Up to 55 conditions per place. 
[2024-03-11 23:02:52,084 INFO  L137   encePairwiseOnDemand]: 208/212 looper letters, 13 selfloop transitions, 0 changer transitions 0/17 dead transitions.
[2024-03-11 23:02:52,085 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 17 transitions, 68 flow
[2024-03-11 23:02:52,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:02:52,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:02:52,095 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 225 transitions.
[2024-03-11 23:02:52,096 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5306603773584906
[2024-03-11 23:02:52,097 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 225 transitions.
[2024-03-11 23:02:52,097 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 225 transitions.
[2024-03-11 23:02:52,098 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:02:52,100 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 225 transitions.
[2024-03-11 23:02:52,102 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:52,106 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:52,107 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:52,108 INFO  L175             Difference]: Start difference. First operand has 23 places, 21 transitions, 50 flow. Second operand 2 states and 225 transitions.
[2024-03-11 23:02:52,109 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 17 transitions, 68 flow
[2024-03-11 23:02:52,111 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:02:52,112 INFO  L231             Difference]: Finished difference. Result has 20 places, 17 transitions, 42 flow
[2024-03-11 23:02:52,113 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=20, PETRI_TRANSITIONS=17}
[2024-03-11 23:02:52,116 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, -3 predicate places.
[2024-03-11 23:02:52,116 INFO  L495      AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 42 flow
[2024-03-11 23:02:52,116 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:52,116 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:02:52,117 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-03-11 23:02:52,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 23:02:52,117 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 23:02:52,118 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:02:52,118 INFO  L85        PathProgramCache]: Analyzing trace with hash 11921774, now seen corresponding path program 1 times
[2024-03-11 23:02:52,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:02:52,118 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367380277]
[2024-03-11 23:02:52,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:02:52,119 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:02:52,137 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:02:52,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:02:52,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:02:52,178 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367380277]
[2024-03-11 23:02:52,179 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367380277] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:02:52,179 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:02:52,179 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:02:52,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267684727]
[2024-03-11 23:02:52,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:02:52,180 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:02:52,181 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:02:52,181 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:02:52,181 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:02:52,191 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 212
[2024-03-11 23:02:52,193 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 42 flow. Second operand  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:52,193 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:02:52,193 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 212
[2024-03-11 23:02:52,194 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:02:52,285 INFO  L130       PetriNetUnfolder]: 24/82 cut-off events.
[2024-03-11 23:02:52,286 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 23:02:52,286 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 163 conditions, 82 events. 24/82 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 301 event pairs, 13 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 159. Up to 50 conditions per place. 
[2024-03-11 23:02:52,287 INFO  L137   encePairwiseOnDemand]: 208/212 looper letters, 14 selfloop transitions, 3 changer transitions 3/22 dead transitions.
[2024-03-11 23:02:52,288 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 92 flow
[2024-03-11 23:02:52,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:02:52,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:02:52,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions.
[2024-03-11 23:02:52,293 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5047169811320755
[2024-03-11 23:02:52,293 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 321 transitions.
[2024-03-11 23:02:52,293 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions.
[2024-03-11 23:02:52,294 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:02:52,295 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions.
[2024-03-11 23:02:52,297 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:52,299 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:52,300 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:52,300 INFO  L175             Difference]: Start difference. First operand has 20 places, 17 transitions, 42 flow. Second operand 3 states and 321 transitions.
[2024-03-11 23:02:52,300 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 22 transitions, 92 flow
[2024-03-11 23:02:52,301 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:02:52,302 INFO  L231             Difference]: Finished difference. Result has 24 places, 17 transitions, 57 flow
[2024-03-11 23:02:52,302 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=24, PETRI_TRANSITIONS=17}
[2024-03-11 23:02:52,302 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, 1 predicate places.
[2024-03-11 23:02:52,303 INFO  L495      AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 57 flow
[2024-03-11 23:02:52,303 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:52,303 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:02:52,303 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2024-03-11 23:02:52,303 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 23:02:52,304 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 23:02:52,304 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:02:52,304 INFO  L85        PathProgramCache]: Analyzing trace with hash -1380981527, now seen corresponding path program 1 times
[2024-03-11 23:02:52,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:02:52,305 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083515638]
[2024-03-11 23:02:52,305 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:02:52,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:02:52,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:02:52,348 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:02:52,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:02:52,379 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:02:52,379 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:02:52,380 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2024-03-11 23:02:52,382 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-03-11 23:02:52,382 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-03-11 23:02:52,382 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2024-03-11 23:02:52,382 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-03-11 23:02:52,383 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-03-11 23:02:52,383 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-03-11 23:02:52,383 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-03-11 23:02:52,383 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 23:02:52,384 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-03-11 23:02:52,385 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:02:52,386 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 23:02:52,400 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 23:02:52,402 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 125 transitions, 268 flow
[2024-03-11 23:02:52,425 INFO  L130       PetriNetUnfolder]: 11/276 cut-off events.
[2024-03-11 23:02:52,426 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 23:02:52,426 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290 conditions, 276 events. 11/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 632 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. 
[2024-03-11 23:02:52,426 INFO  L82        GeneralOperation]: Start removeDead. Operand has 125 places, 125 transitions, 268 flow
[2024-03-11 23:02:52,428 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 125 places, 125 transitions, 268 flow
[2024-03-11 23:02:52,428 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:02:52,428 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 125 transitions, 268 flow
[2024-03-11 23:02:52,428 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 125 transitions, 268 flow
[2024-03-11 23:02:52,428 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 125 transitions, 268 flow
[2024-03-11 23:02:52,448 INFO  L130       PetriNetUnfolder]: 11/276 cut-off events.
[2024-03-11 23:02:52,448 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 23:02:52,449 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290 conditions, 276 events. 11/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 632 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. 
[2024-03-11 23:02:52,451 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3892
[2024-03-11 23:02:56,759 INFO  L134        LiptonReduction]: Checked pairs total: 8005
[2024-03-11 23:02:56,759 INFO  L136        LiptonReduction]: Total number of compositions: 106
[2024-03-11 23:02:56,761 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:02:56,762 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@354dc07f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:02:56,762 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-11 23:02:56,763 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2024-03-11 23:02:56,763 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:02:56,763 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:02:56,763 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 23:02:56,763 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 23:02:56,764 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:02:56,764 INFO  L85        PathProgramCache]: Analyzing trace with hash 20350, now seen corresponding path program 1 times
[2024-03-11 23:02:56,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:02:56,764 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51902149]
[2024-03-11 23:02:56,764 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:02:56,764 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:02:56,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:02:56,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:02:56,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:02:56,779 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51902149]
[2024-03-11 23:02:56,779 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51902149] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:02:56,779 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:02:56,780 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 23:02:56,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342597316]
[2024-03-11 23:02:56,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:02:56,780 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 23:02:56,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:02:56,781 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 23:02:56,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 23:02:56,781 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 231
[2024-03-11 23:02:56,782 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 84 flow. Second operand  has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:56,782 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:02:56,782 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 231
[2024-03-11 23:02:56,782 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:02:56,863 INFO  L130       PetriNetUnfolder]: 378/759 cut-off events.
[2024-03-11 23:02:56,864 INFO  L131       PetriNetUnfolder]: For 38/38 co-relation queries the response was YES.
[2024-03-11 23:02:56,866 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 759 events. 378/759 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3857 event pairs, 371 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 519. Up to 666 conditions per place. 
[2024-03-11 23:02:56,869 INFO  L137   encePairwiseOnDemand]: 227/231 looper letters, 21 selfloop transitions, 0 changer transitions 0/29 dead transitions.
[2024-03-11 23:02:56,869 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 118 flow
[2024-03-11 23:02:56,869 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 23:02:56,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 23:02:56,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions.
[2024-03-11 23:02:56,871 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.564935064935065
[2024-03-11 23:02:56,871 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 261 transitions.
[2024-03-11 23:02:56,871 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 261 transitions.
[2024-03-11 23:02:56,871 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:02:56,871 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 261 transitions.
[2024-03-11 23:02:56,872 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:56,874 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:56,874 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:56,874 INFO  L175             Difference]: Start difference. First operand has 36 places, 33 transitions, 84 flow. Second operand 2 states and 261 transitions.
[2024-03-11 23:02:56,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 118 flow
[2024-03-11 23:02:56,875 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:02:56,876 INFO  L231             Difference]: Finished difference. Result has 33 places, 29 transitions, 76 flow
[2024-03-11 23:02:56,876 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=29}
[2024-03-11 23:02:56,877 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places.
[2024-03-11 23:02:56,877 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 76 flow
[2024-03-11 23:02:56,877 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:56,877 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:02:56,877 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-03-11 23:02:56,878 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 23:02:56,878 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 23:02:56,878 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:02:56,878 INFO  L85        PathProgramCache]: Analyzing trace with hash 19524473, now seen corresponding path program 1 times
[2024-03-11 23:02:56,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:02:56,879 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35433243]
[2024-03-11 23:02:56,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:02:56,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:02:56,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:02:56,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:02:56,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:02:56,904 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35433243]
[2024-03-11 23:02:56,904 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35433243] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:02:56,904 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:02:56,904 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:02:56,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588595046]
[2024-03-11 23:02:56,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:02:56,905 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:02:56,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:02:56,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:02:56,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:02:56,919 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 231
[2024-03-11 23:02:56,920 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 76 flow. Second operand  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:56,920 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:02:56,920 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 231
[2024-03-11 23:02:56,920 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:02:57,076 INFO  L130       PetriNetUnfolder]: 679/1281 cut-off events.
[2024-03-11 23:02:57,077 INFO  L131       PetriNetUnfolder]: For 42/42 co-relation queries the response was YES.
[2024-03-11 23:02:57,079 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2525 conditions, 1281 events. 679/1281 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6822 event pairs, 416 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 2520. Up to 850 conditions per place. 
[2024-03-11 23:02:57,082 INFO  L137   encePairwiseOnDemand]: 226/231 looper letters, 32 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2024-03-11 23:02:57,082 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 172 flow
[2024-03-11 23:02:57,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:02:57,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:02:57,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions.
[2024-03-11 23:02:57,084 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5425685425685426
[2024-03-11 23:02:57,084 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 376 transitions.
[2024-03-11 23:02:57,084 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions.
[2024-03-11 23:02:57,085 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:02:57,085 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions.
[2024-03-11 23:02:57,086 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:57,088 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:57,088 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:57,088 INFO  L175             Difference]: Start difference. First operand has 33 places, 29 transitions, 76 flow. Second operand 3 states and 376 transitions.
[2024-03-11 23:02:57,089 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 172 flow
[2024-03-11 23:02:57,089 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:02:57,090 INFO  L231             Difference]: Finished difference. Result has 37 places, 32 transitions, 106 flow
[2024-03-11 23:02:57,090 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=32}
[2024-03-11 23:02:57,091 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places.
[2024-03-11 23:02:57,091 INFO  L495      AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 106 flow
[2024-03-11 23:02:57,091 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:57,091 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:02:57,092 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:02:57,092 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 23:02:57,092 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 23:02:57,092 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:02:57,092 INFO  L85        PathProgramCache]: Analyzing trace with hash -1008417731, now seen corresponding path program 1 times
[2024-03-11 23:02:57,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:02:57,093 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564979257]
[2024-03-11 23:02:57,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:02:57,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:02:57,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:02:57,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:02:57,120 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:02:57,120 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564979257]
[2024-03-11 23:02:57,120 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564979257] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:02:57,121 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:02:57,121 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:02:57,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466372279]
[2024-03-11 23:02:57,121 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:02:57,121 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:02:57,122 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:02:57,122 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:02:57,122 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:02:57,137 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 231
[2024-03-11 23:02:57,137 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:57,137 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:02:57,137 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 231
[2024-03-11 23:02:57,138 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:02:57,309 INFO  L130       PetriNetUnfolder]: 739/1420 cut-off events.
[2024-03-11 23:02:57,310 INFO  L131       PetriNetUnfolder]: For 335/335 co-relation queries the response was YES.
[2024-03-11 23:02:57,311 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3150 conditions, 1420 events. 739/1420 cut-off events. For 335/335 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8175 event pairs, 430 based on Foata normal form. 0/1298 useless extension candidates. Maximal degree in co-relation 3143. Up to 943 conditions per place. 
[2024-03-11 23:02:57,316 INFO  L137   encePairwiseOnDemand]: 225/231 looper letters, 35 selfloop transitions, 7 changer transitions 0/49 dead transitions.
[2024-03-11 23:02:57,316 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 242 flow
[2024-03-11 23:02:57,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:02:57,316 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:02:57,317 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions.
[2024-03-11 23:02:57,318 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5382395382395382
[2024-03-11 23:02:57,318 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 373 transitions.
[2024-03-11 23:02:57,318 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions.
[2024-03-11 23:02:57,318 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:02:57,318 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions.
[2024-03-11 23:02:57,319 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:57,321 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:57,321 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:57,321 INFO  L175             Difference]: Start difference. First operand has 37 places, 32 transitions, 106 flow. Second operand 3 states and 373 transitions.
[2024-03-11 23:02:57,321 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 242 flow
[2024-03-11 23:02:57,325 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:02:57,325 INFO  L231             Difference]: Finished difference. Result has 39 places, 37 transitions, 154 flow
[2024-03-11 23:02:57,326 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=39, PETRI_TRANSITIONS=37}
[2024-03-11 23:02:57,326 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places.
[2024-03-11 23:02:57,326 INFO  L495      AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 154 flow
[2024-03-11 23:02:57,327 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:57,327 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:02:57,327 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:02:57,327 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 23:02:57,327 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 23:02:57,328 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:02:57,328 INFO  L85        PathProgramCache]: Analyzing trace with hash 2135546759, now seen corresponding path program 1 times
[2024-03-11 23:02:57,328 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:02:57,328 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391763810]
[2024-03-11 23:02:57,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:02:57,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:02:57,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:02:57,346 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:02:57,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:02:57,360 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:02:57,361 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:02:57,361 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining)
[2024-03-11 23:02:57,361 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-11 23:02:57,361 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-11 23:02:57,361 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-11 23:02:57,362 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-11 23:02:57,362 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining)
[2024-03-11 23:02:57,362 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-11 23:02:57,362 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-11 23:02:57,362 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-11 23:02:57,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 23:02:57,363 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-11 23:02:57,367 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2024-03-11 23:02:57,367 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-11 23:02:57,391 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:02:57 BasicIcfg
[2024-03-11 23:02:57,392 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-11 23:02:57,392 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-11 23:02:57,392 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2024-03-11 23:02:57,392 INFO  L275        PluginConnector]: Witness Printer initialized
[2024-03-11 23:02:57,393 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:02:46" (3/4) ...
[2024-03-11 23:02:57,395 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-11 23:02:57,395 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-11 23:02:57,396 INFO  L158              Benchmark]: Toolchain (without parser) took 11215.71ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 101.9MB in the beginning and 93.0MB in the end (delta: 9.0MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB.
[2024-03-11 23:02:57,396 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 23:02:57,396 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 374.83ms. Allocated memory is still 138.4MB. Free memory was 101.3MB in the beginning and 73.5MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-03-11 23:02:57,397 INFO  L158              Benchmark]: Boogie Procedure Inliner took 36.22ms. Allocated memory is still 138.4MB. Free memory was 73.5MB in the beginning and 71.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-11 23:02:57,397 INFO  L158              Benchmark]: Boogie Preprocessor took 23.17ms. Allocated memory is still 138.4MB. Free memory was 71.1MB in the beginning and 69.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-11 23:02:57,397 INFO  L158              Benchmark]: RCFGBuilder took 345.73ms. Allocated memory is still 138.4MB. Free memory was 69.2MB in the beginning and 53.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-03-11 23:02:57,398 INFO  L158              Benchmark]: TraceAbstraction took 10428.21ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 52.2MB in the beginning and 94.0MB in the end (delta: -41.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 23:02:57,398 INFO  L158              Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 93.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 23:02:57,400 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 374.83ms. Allocated memory is still 138.4MB. Free memory was 101.3MB in the beginning and 73.5MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 36.22ms. Allocated memory is still 138.4MB. Free memory was 73.5MB in the beginning and 71.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 23.17ms. Allocated memory is still 138.4MB. Free memory was 71.1MB in the beginning and 69.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 345.73ms. Allocated memory is still 138.4MB. Free memory was 69.2MB in the beginning and 53.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 10428.21ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 52.2MB in the beginning and 94.0MB in the end (delta: -41.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 2.83ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 93.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 4.7s, 108 PlacesBefore, 23 PlacesAfterwards, 109 TransitionsBefore, 21 TransitionsAfterwards, 1568 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 2392 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1721, independent: 1633, independent conditional: 0, independent unconditional: 1633, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 848, independent: 829, independent conditional: 0, independent unconditional: 829, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1721, independent: 804, independent conditional: 0, independent unconditional: 804, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 848, unknown conditional: 0, unknown unconditional: 848] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 4.3s, 125 PlacesBefore, 36 PlacesAfterwards, 125 TransitionsBefore, 33 TransitionsAfterwards, 3892 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 106 TotalNumberOfCompositions, 8005 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4296, independent: 4123, independent conditional: 0, independent unconditional: 4123, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2043, independent: 2009, independent conditional: 0, independent unconditional: 2009, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4296, independent: 2114, independent conditional: 0, independent unconditional: 2114, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 2043, unknown conditional: 0, unknown unconditional: 2043] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 1031]: Data race detected
    Data race detected
The following path leads to a data race: 
[L1012]               0  int data = 0;
[L1013]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
[L1021]               0  int breads_total = __VERIFIER_nondet_int();
[L1022]  CALL         0  assume_abort_if_not(breads_total >= 0)
[L1009]  COND FALSE   0  !(!cond)
[L1022]  RET          0  assume_abort_if_not(breads_total >= 0)
[L1023]               0  pthread_t *tids = malloc(breads_total * sizeof(pthread_t));
[L1023]               0  pthread_t *tids = malloc(breads_total * sizeof(pthread_t));
[L1024]               0  int i = 0;
         VAL             [breads_total=1, data=0, data_mutex={1:0}, i=0, tids={5:0}]
[L1024]  COND TRUE    0  i < breads_total
[L1025]  EXPR         0  \read(*tids)
[L1025]  EXPR         0  tids[i]
[L1025]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
         VAL             [\read(*tids)={-2:0}, arg={0:0}, breads_total=1, data=0, data_mutex={1:0}, i=0, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=-1, tids={5:0}]
[L1024]               0  i++
         VAL             [arg={0:0}, breads_total=1, data=0, data_mutex={1:0}, i=1, tids={5:0}]
[L1024]  COND FALSE   0  !(i < breads_total)
[L1027]               0  int i = 0;
         VAL             [arg={0:0}, breads_total=1, data=0, data_mutex={1:0}, i=0, i=1, tids={5:0}]
[L1027]  COND FALSE   0  !(i < breads_total - 1)
[L1030]  EXPR         0  \read(*tids)
[L1030]               0  free(tids)
[L1031]               0  return data;
         VAL             [arg={0:0}, breads_total=1, data=0, data_mutex={1:0}, i=0, i=1, tids={5:0}]
[L1016]               1  data = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=25, data_mutex={1:0}]
[L1031]               0  return data;
         VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=1, data=0, data = __VERIFIER_nondet_int()=25, data_mutex={1:0}, i=0, i=1, tids={5:0}]

Now there is a data race on ~data~0 between 
	C: data = __VERIFIER_nondet_int() [1016]
and
	C: return data; [1031]

  - UnprovableResult [Line: 1025]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1028]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1030]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1028]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1025]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1016]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 121 locations, 8 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: 5.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 2 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=2, InterpolantAutomatonStates: 5, 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.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 136 locations, 9 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: 5.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 10 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=3, InterpolantAutomatonStates: 8, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 14 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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
RESULT: Ultimate proved your program to be incorrect!
[2024-03-11 23:02:57,432 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
