./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-const-race.i --full-output --architecture 32bit


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 012c6ae43b2e350f359f7e3c984c7ae78befabaf58043c4d043bdbd9937b27d7
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 01:33:15,394 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 01:33:15,433 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-12 01:33:15,436 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 01:33:15,437 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 01:33:15,454 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 01:33:15,455 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 01:33:15,455 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 01:33:15,456 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 01:33:15,456 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 01:33:15,457 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 01:33:15,457 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 01:33:15,458 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 01:33:15,458 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 01:33:15,458 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 01:33:15,458 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 01:33:15,459 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 01:33:15,459 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 01:33:15,459 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 01:33:15,460 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 01:33:15,460 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 01:33:15,461 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 01:33:15,461 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 01:33:15,461 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 01:33:15,462 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 01:33:15,462 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 01:33:15,462 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 01:33:15,462 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 01:33:15,463 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 01:33:15,463 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 01:33:15,463 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:33:15,464 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 01:33:15,464 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 01:33:15,464 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 01:33:15,465 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 01:33:15,465 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 01:33:15,465 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 01:33:15,465 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 01:33:15,466 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 01:33:15,466 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 01:33:15,466 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 01:33:15,467 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 012c6ae43b2e350f359f7e3c984c7ae78befabaf58043c4d043bdbd9937b27d7
[2024-03-12 01:33:15,657 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 01:33:15,686 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 01:33:15,688 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 01:33:15,689 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 01:33:15,690 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 01:33:15,691 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2024-03-12 01:33:16,713 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 01:33:16,891 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 01:33:16,892 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2024-03-12 01:33:16,905 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/c80a237db/8e9e2b50b5484122acb535df81c07f96/FLAGbeb20cb72
[2024-03-12 01:33:16,920 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/c80a237db/8e9e2b50b5484122acb535df81c07f96
[2024-03-12 01:33:16,923 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 01:33:16,924 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 01:33:16,925 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 01:33:16,925 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 01:33:16,929 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 01:33:16,930 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:33:16" (1/1) ...
[2024-03-12 01:33:16,930 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f37ddac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:16, skipping insertion in model container
[2024-03-12 01:33:16,931 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:33:16" (1/1) ...
[2024-03-12 01:33:16,959 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 01:33:17,165 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:33:17,174 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 01:33:17,204 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:33:17,229 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 01:33:17,229 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17 WrapperNode
[2024-03-12 01:33:17,229 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 01:33:17,230 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 01:33:17,230 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 01:33:17,231 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 01:33:17,236 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (1/1) ...
[2024-03-12 01:33:17,245 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (1/1) ...
[2024-03-12 01:33:17,260 INFO  L138                Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54
[2024-03-12 01:33:17,260 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 01:33:17,261 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 01:33:17,261 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 01:33:17,261 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 01:33:17,268 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (1/1) ...
[2024-03-12 01:33:17,268 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (1/1) ...
[2024-03-12 01:33:17,270 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (1/1) ...
[2024-03-12 01:33:17,270 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (1/1) ...
[2024-03-12 01:33:17,275 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (1/1) ...
[2024-03-12 01:33:17,277 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (1/1) ...
[2024-03-12 01:33:17,278 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (1/1) ...
[2024-03-12 01:33:17,279 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (1/1) ...
[2024-03-12 01:33:17,280 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 01:33:17,281 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 01:33:17,281 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 01:33:17,281 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 01:33:17,282 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (1/1) ...
[2024-03-12 01:33:17,286 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:33:17,294 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:33:17,310 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-12 01:33:17,314 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-12 01:33:17,337 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 01:33:17,337 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 01:33:17,337 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-12 01:33:17,337 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-12 01:33:17,337 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-12 01:33:17,337 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 01:33:17,337 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-12 01:33:17,338 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 01:33:17,338 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 01:33:17,338 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-12 01:33:17,338 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 01:33:17,338 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 01:33:17,339 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-12 01:33:17,479 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 01:33:17,480 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 01:33:17,596 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 01:33:17,609 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 01:33:17,609 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 01:33:17,610 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:33:17 BoogieIcfgContainer
[2024-03-12 01:33:17,610 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 01:33:17,612 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 01:33:17,612 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 01:33:17,614 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 01:33:17,615 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 01:33:16" (1/3) ...
[2024-03-12 01:33:17,615 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c51f095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:33:17, skipping insertion in model container
[2024-03-12 01:33:17,615 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:33:17" (2/3) ...
[2024-03-12 01:33:17,616 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c51f095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:33:17, skipping insertion in model container
[2024-03-12 01:33:17,616 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:33:17" (3/3) ...
[2024-03-12 01:33:17,616 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race.i
[2024-03-12 01:33:17,622 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 01:33:17,630 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 01:33:17,630 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-03-12 01:33:17,630 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 01:33:17,665 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 01:33:17,690 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 149 flow
[2024-03-12 01:33:17,732 INFO  L124   PetriNetUnfolderBase]: 5/99 cut-off events.
[2024-03-12 01:33:17,732 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 01:33:17,735 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 104 conditions, 99 events. 5/99 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 201 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. 
[2024-03-12 01:33:17,735 INFO  L82        GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 149 flow
[2024-03-12 01:33:17,738 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 149 flow
[2024-03-12 01:33:17,745 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:33:17,751 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1093aaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:33:17,751 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-03-12 01:33:17,759 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:33:17,759 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-12 01:33:17,759 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:33:17,759 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:17,760 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:17,760 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-12 01:33:17,764 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:17,764 INFO  L85        PathProgramCache]: Analyzing trace with hash -328016813, now seen corresponding path program 1 times
[2024-03-12 01:33:17,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:17,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843359640]
[2024-03-12 01:33:17,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:17,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:17,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:17,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:17,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:17,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843359640]
[2024-03-12 01:33:17,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843359640] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:17,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:17,965 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:33:17,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667225294]
[2024-03-12 01:33:17,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:17,972 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:33:17,976 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:17,995 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:33:17,995 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:33:18,059 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 71
[2024-03-12 01:33:18,063 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 149 flow. Second operand  has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,063 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:18,063 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 71
[2024-03-12 01:33:18,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:18,113 INFO  L124   PetriNetUnfolderBase]: 8/158 cut-off events.
[2024-03-12 01:33:18,113 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 01:33:18,114 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 158 events. 8/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 439 event pairs, 0 based on Foata normal form. 5/147 useless extension candidates. Maximal degree in co-relation 133. Up to 17 conditions per place. 
[2024-03-12 01:33:18,115 INFO  L140   encePairwiseOnDemand]: 64/71 looper letters, 10 selfloop transitions, 4 changer transitions 1/73 dead transitions.
[2024-03-12 01:33:18,115 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 183 flow
[2024-03-12 01:33:18,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:33:18,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:33:18,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions.
[2024-03-12 01:33:18,125 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8838028169014085
[2024-03-12 01:33:18,125 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 251 transitions.
[2024-03-12 01:33:18,126 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 251 transitions.
[2024-03-12 01:33:18,127 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:18,128 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 251 transitions.
[2024-03-12 01:33:18,130 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,133 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,133 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,135 INFO  L175             Difference]: Start difference. First operand has 71 places, 71 transitions, 149 flow. Second operand 4 states and 251 transitions.
[2024-03-12 01:33:18,135 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 183 flow
[2024-03-12 01:33:18,137 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 183 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:33:18,139 INFO  L231             Difference]: Finished difference. Result has 75 places, 69 transitions, 157 flow
[2024-03-12 01:33:18,141 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=75, PETRI_TRANSITIONS=69}
[2024-03-12 01:33:18,143 INFO  L281   CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places.
[2024-03-12 01:33:18,144 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 157 flow
[2024-03-12 01:33:18,144 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,144 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:18,144 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:18,144 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 01:33:18,144 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-12 01:33:18,145 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:18,145 INFO  L85        PathProgramCache]: Analyzing trace with hash -749003099, now seen corresponding path program 1 times
[2024-03-12 01:33:18,145 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:18,145 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743680509]
[2024-03-12 01:33:18,146 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:18,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:18,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:18,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:18,194 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:18,194 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743680509]
[2024-03-12 01:33:18,194 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743680509] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:18,195 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:18,195 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:33:18,195 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100443592]
[2024-03-12 01:33:18,195 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:18,196 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:18,196 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:18,197 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:18,197 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:18,209 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 71
[2024-03-12 01:33:18,209 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 157 flow. Second operand  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,209 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:18,209 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 71
[2024-03-12 01:33:18,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:18,235 INFO  L124   PetriNetUnfolderBase]: 6/130 cut-off events.
[2024-03-12 01:33:18,235 INFO  L125   PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES.
[2024-03-12 01:33:18,235 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 130 events. 6/130 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 338 event pairs, 4 based on Foata normal form. 1/119 useless extension candidates. Maximal degree in co-relation 128. Up to 21 conditions per place. 
[2024-03-12 01:33:18,236 INFO  L140   encePairwiseOnDemand]: 66/71 looper letters, 9 selfloop transitions, 4 changer transitions 0/72 dead transitions.
[2024-03-12 01:33:18,236 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 72 transitions, 189 flow
[2024-03-12 01:33:18,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:18,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:18,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions.
[2024-03-12 01:33:18,238 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8967136150234741
[2024-03-12 01:33:18,238 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 191 transitions.
[2024-03-12 01:33:18,238 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 191 transitions.
[2024-03-12 01:33:18,238 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:18,238 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 191 transitions.
[2024-03-12 01:33:18,240 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,241 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,241 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,241 INFO  L175             Difference]: Start difference. First operand has 75 places, 69 transitions, 157 flow. Second operand 3 states and 191 transitions.
[2024-03-12 01:33:18,241 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 72 transitions, 189 flow
[2024-03-12 01:33:18,242 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 72 transitions, 181 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 01:33:18,243 INFO  L231             Difference]: Finished difference. Result has 76 places, 72 transitions, 179 flow
[2024-03-12 01:33:18,244 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=76, PETRI_TRANSITIONS=72}
[2024-03-12 01:33:18,244 INFO  L281   CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places.
[2024-03-12 01:33:18,244 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 179 flow
[2024-03-12 01:33:18,244 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,245 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:18,245 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:18,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 01:33:18,245 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-12 01:33:18,246 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:18,246 INFO  L85        PathProgramCache]: Analyzing trace with hash -155908587, now seen corresponding path program 1 times
[2024-03-12 01:33:18,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:18,246 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438696139]
[2024-03-12 01:33:18,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:18,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:18,265 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:33:18,265 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:33:18,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:33:18,290 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:33:18,290 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:33:18,291 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining)
[2024-03-12 01:33:18,292 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining)
[2024-03-12 01:33:18,293 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining)
[2024-03-12 01:33:18,293 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining)
[2024-03-12 01:33:18,293 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining)
[2024-03-12 01:33:18,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 01:33:18,293 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-03-12 01:33:18,295 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:33:18,296 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 01:33:18,314 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 01:33:18,316 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 194 flow
[2024-03-12 01:33:18,339 INFO  L124   PetriNetUnfolderBase]: 10/180 cut-off events.
[2024-03-12 01:33:18,340 INFO  L125   PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES.
[2024-03-12 01:33:18,340 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 180 events. 10/180 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 470 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 101. Up to 8 conditions per place. 
[2024-03-12 01:33:18,340 INFO  L82        GeneralOperation]: Start removeDead. Operand has 90 places, 89 transitions, 194 flow
[2024-03-12 01:33:18,341 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 90 places, 89 transitions, 194 flow
[2024-03-12 01:33:18,342 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:33:18,343 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1093aaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:33:18,344 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-03-12 01:33:18,346 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:33:18,346 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-12 01:33:18,347 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:33:18,347 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:18,347 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:18,347 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:33:18,347 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:18,347 INFO  L85        PathProgramCache]: Analyzing trace with hash -1646010701, now seen corresponding path program 1 times
[2024-03-12 01:33:18,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:18,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698301628]
[2024-03-12 01:33:18,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:18,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:18,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:18,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:18,394 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:18,394 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698301628]
[2024-03-12 01:33:18,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698301628] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:18,394 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:18,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:33:18,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038322287]
[2024-03-12 01:33:18,395 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:18,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:33:18,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:18,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:33:18,396 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:33:18,420 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-03-12 01:33:18,421 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 194 flow. Second operand  has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,421 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:18,421 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-03-12 01:33:18,421 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:18,496 INFO  L124   PetriNetUnfolderBase]: 72/568 cut-off events.
[2024-03-12 01:33:18,497 INFO  L125   PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES.
[2024-03-12 01:33:18,499 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 734 conditions, 568 events. 72/568 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3512 event pairs, 20 based on Foata normal form. 16/535 useless extension candidates. Maximal degree in co-relation 189. Up to 106 conditions per place. 
[2024-03-12 01:33:18,501 INFO  L140   encePairwiseOnDemand]: 82/89 looper letters, 18 selfloop transitions, 4 changer transitions 0/94 dead transitions.
[2024-03-12 01:33:18,501 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 94 transitions, 248 flow
[2024-03-12 01:33:18,502 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:33:18,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:33:18,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions.
[2024-03-12 01:33:18,504 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8820224719101124
[2024-03-12 01:33:18,504 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 314 transitions.
[2024-03-12 01:33:18,504 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 314 transitions.
[2024-03-12 01:33:18,504 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:18,504 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 314 transitions.
[2024-03-12 01:33:18,505 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,506 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,506 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,507 INFO  L175             Difference]: Start difference. First operand has 90 places, 89 transitions, 194 flow. Second operand 4 states and 314 transitions.
[2024-03-12 01:33:18,507 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 94 transitions, 248 flow
[2024-03-12 01:33:18,508 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:33:18,509 INFO  L231             Difference]: Finished difference. Result has 94 places, 88 transitions, 206 flow
[2024-03-12 01:33:18,509 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=94, PETRI_TRANSITIONS=88}
[2024-03-12 01:33:18,510 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places.
[2024-03-12 01:33:18,510 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 206 flow
[2024-03-12 01:33:18,510 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,510 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:18,511 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:18,511 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 01:33:18,511 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:33:18,511 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:18,511 INFO  L85        PathProgramCache]: Analyzing trace with hash -853170898, now seen corresponding path program 1 times
[2024-03-12 01:33:18,511 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:18,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437892611]
[2024-03-12 01:33:18,512 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:18,512 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:18,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:18,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:18,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:18,539 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437892611]
[2024-03-12 01:33:18,539 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437892611] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:18,539 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:18,539 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:33:18,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131970845]
[2024-03-12 01:33:18,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:18,539 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:18,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:18,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:18,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:18,554 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-03-12 01:33:18,555 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 206 flow. Second operand  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,555 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:18,555 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-03-12 01:33:18,555 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:18,641 INFO  L124   PetriNetUnfolderBase]: 116/699 cut-off events.
[2024-03-12 01:33:18,641 INFO  L125   PetriNetUnfolderBase]: For 76/107 co-relation queries the response was YES.
[2024-03-12 01:33:18,643 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 991 conditions, 699 events. 116/699 cut-off events. For 76/107 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4637 event pairs, 52 based on Foata normal form. 1/608 useless extension candidates. Maximal degree in co-relation 921. Up to 185 conditions per place. 
[2024-03-12 01:33:18,645 INFO  L140   encePairwiseOnDemand]: 83/89 looper letters, 18 selfloop transitions, 5 changer transitions 0/96 dead transitions.
[2024-03-12 01:33:18,645 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 96 transitions, 276 flow
[2024-03-12 01:33:18,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:18,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:18,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions.
[2024-03-12 01:33:18,646 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.898876404494382
[2024-03-12 01:33:18,646 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 240 transitions.
[2024-03-12 01:33:18,646 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 240 transitions.
[2024-03-12 01:33:18,646 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:18,647 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 240 transitions.
[2024-03-12 01:33:18,647 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,648 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,648 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,648 INFO  L175             Difference]: Start difference. First operand has 94 places, 88 transitions, 206 flow. Second operand 3 states and 240 transitions.
[2024-03-12 01:33:18,648 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 96 transitions, 276 flow
[2024-03-12 01:33:18,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:18,651 INFO  L231             Difference]: Finished difference. Result has 96 places, 92 transitions, 238 flow
[2024-03-12 01:33:18,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=96, PETRI_TRANSITIONS=92}
[2024-03-12 01:33:18,651 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, 6 predicate places.
[2024-03-12 01:33:18,651 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 238 flow
[2024-03-12 01:33:18,652 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,652 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:18,652 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:18,652 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 01:33:18,652 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:33:18,652 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:18,653 INFO  L85        PathProgramCache]: Analyzing trace with hash -1480076718, now seen corresponding path program 1 times
[2024-03-12 01:33:18,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:18,653 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605156045]
[2024-03-12 01:33:18,653 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:18,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:18,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:18,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:33:18,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:18,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605156045]
[2024-03-12 01:33:18,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605156045] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:18,706 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:18,706 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:33:18,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395882754]
[2024-03-12 01:33:18,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:18,707 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:33:18,707 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:18,707 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:33:18,707 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:33:18,743 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-03-12 01:33:18,743 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 238 flow. Second operand  has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,743 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:18,743 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-03-12 01:33:18,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:18,819 INFO  L124   PetriNetUnfolderBase]: 63/581 cut-off events.
[2024-03-12 01:33:18,819 INFO  L125   PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES.
[2024-03-12 01:33:18,820 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 811 conditions, 581 events. 63/581 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3341 event pairs, 24 based on Foata normal form. 15/545 useless extension candidates. Maximal degree in co-relation 651. Up to 72 conditions per place. 
[2024-03-12 01:33:18,822 INFO  L140   encePairwiseOnDemand]: 84/89 looper letters, 19 selfloop transitions, 4 changer transitions 3/103 dead transitions.
[2024-03-12 01:33:18,822 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 318 flow
[2024-03-12 01:33:18,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:33:18,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:33:18,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions.
[2024-03-12 01:33:18,823 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8848314606741573
[2024-03-12 01:33:18,823 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 315 transitions.
[2024-03-12 01:33:18,823 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 315 transitions.
[2024-03-12 01:33:18,823 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:18,823 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 315 transitions.
[2024-03-12 01:33:18,824 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,825 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,825 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,825 INFO  L175             Difference]: Start difference. First operand has 96 places, 92 transitions, 238 flow. Second operand 4 states and 315 transitions.
[2024-03-12 01:33:18,825 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 318 flow
[2024-03-12 01:33:18,827 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:18,828 INFO  L231             Difference]: Finished difference. Result has 98 places, 93 transitions, 244 flow
[2024-03-12 01:33:18,828 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=98, PETRI_TRANSITIONS=93}
[2024-03-12 01:33:18,828 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places.
[2024-03-12 01:33:18,829 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 244 flow
[2024-03-12 01:33:18,829 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:18,829 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:18,829 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:18,829 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 01:33:18,829 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:33:18,830 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:18,830 INFO  L85        PathProgramCache]: Analyzing trace with hash -1931209736, now seen corresponding path program 1 times
[2024-03-12 01:33:18,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:18,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380251283]
[2024-03-12 01:33:18,830 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:18,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:18,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:18,913 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:18,913 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:18,913 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380251283]
[2024-03-12 01:33:18,913 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380251283] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:33:18,913 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053372349]
[2024-03-12 01:33:18,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:18,914 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:33:18,914 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:33:18,916 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:33:18,926 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-12 01:33:19,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:19,005 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-12 01:33:19,007 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:33:19,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:19,108 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:33:19,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:19,166 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053372349] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:33:19,166 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:33:19,167 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-03-12 01:33:19,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004882683]
[2024-03-12 01:33:19,167 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:33:19,167 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-03-12 01:33:19,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:19,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-03-12 01:33:19,168 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-03-12 01:33:19,264 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 69 out of 89
[2024-03-12 01:33:19,265 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 244 flow. Second operand  has 13 states, 13 states have (on average 70.92307692307692) internal successors, (922), 13 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:19,265 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:19,265 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 89
[2024-03-12 01:33:19,266 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:19,408 INFO  L124   PetriNetUnfolderBase]: 81/351 cut-off events.
[2024-03-12 01:33:19,409 INFO  L125   PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES.
[2024-03-12 01:33:19,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 558 conditions, 351 events. 81/351 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1830 event pairs, 6 based on Foata normal form. 15/347 useless extension candidates. Maximal degree in co-relation 550. Up to 56 conditions per place. 
[2024-03-12 01:33:19,410 INFO  L140   encePairwiseOnDemand]: 83/89 looper letters, 28 selfloop transitions, 8 changer transitions 0/85 dead transitions.
[2024-03-12 01:33:19,410 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 276 flow
[2024-03-12 01:33:19,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 01:33:19,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 01:33:19,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 728 transitions.
[2024-03-12 01:33:19,412 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8179775280898877
[2024-03-12 01:33:19,412 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 728 transitions.
[2024-03-12 01:33:19,413 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 728 transitions.
[2024-03-12 01:33:19,413 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:19,413 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 728 transitions.
[2024-03-12 01:33:19,414 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 72.8) internal successors, (728), 10 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:19,416 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:19,416 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:19,416 INFO  L175             Difference]: Start difference. First operand has 98 places, 93 transitions, 244 flow. Second operand 10 states and 728 transitions.
[2024-03-12 01:33:19,416 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 276 flow
[2024-03-12 01:33:19,417 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:33:19,418 INFO  L231             Difference]: Finished difference. Result has 79 places, 65 transitions, 179 flow
[2024-03-12 01:33:19,418 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=179, PETRI_PLACES=79, PETRI_TRANSITIONS=65}
[2024-03-12 01:33:19,419 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, -11 predicate places.
[2024-03-12 01:33:19,419 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 179 flow
[2024-03-12 01:33:19,420 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 70.92307692307692) internal successors, (922), 13 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:19,420 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:19,420 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:19,427 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-12 01:33:19,626 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:33:19,627 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:33:19,628 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:19,628 INFO  L85        PathProgramCache]: Analyzing trace with hash -778921506, now seen corresponding path program 1 times
[2024-03-12 01:33:19,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:19,629 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234325307]
[2024-03-12 01:33:19,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:19,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:19,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:19,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-12 01:33:19,669 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:19,669 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234325307]
[2024-03-12 01:33:19,669 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234325307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:19,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:19,669 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:33:19,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94888123]
[2024-03-12 01:33:19,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:19,670 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:19,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:19,671 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:19,671 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:19,690 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-03-12 01:33:19,690 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 179 flow. Second operand  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:19,690 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:19,690 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-03-12 01:33:19,690 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:19,720 INFO  L124   PetriNetUnfolderBase]: 27/209 cut-off events.
[2024-03-12 01:33:19,721 INFO  L125   PetriNetUnfolderBase]: For 27/31 co-relation queries the response was YES.
[2024-03-12 01:33:19,721 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 348 conditions, 209 events. 27/209 cut-off events. For 27/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 799 event pairs, 16 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 340. Up to 55 conditions per place. 
[2024-03-12 01:33:19,722 INFO  L140   encePairwiseOnDemand]: 84/89 looper letters, 13 selfloop transitions, 5 changer transitions 0/70 dead transitions.
[2024-03-12 01:33:19,722 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 70 transitions, 227 flow
[2024-03-12 01:33:19,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:19,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:19,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions.
[2024-03-12 01:33:19,723 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8764044943820225
[2024-03-12 01:33:19,723 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 234 transitions.
[2024-03-12 01:33:19,723 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions.
[2024-03-12 01:33:19,723 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:19,723 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions.
[2024-03-12 01:33:19,724 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:19,724 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:19,725 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:19,725 INFO  L175             Difference]: Start difference. First operand has 79 places, 65 transitions, 179 flow. Second operand 3 states and 234 transitions.
[2024-03-12 01:33:19,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 70 transitions, 227 flow
[2024-03-12 01:33:19,727 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 70 transitions, 210 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-03-12 01:33:19,728 INFO  L231             Difference]: Finished difference. Result has 77 places, 68 transitions, 198 flow
[2024-03-12 01:33:19,728 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=77, PETRI_TRANSITIONS=68}
[2024-03-12 01:33:19,729 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, -13 predicate places.
[2024-03-12 01:33:19,730 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 198 flow
[2024-03-12 01:33:19,730 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:19,730 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:19,730 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:19,730 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 01:33:19,730 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:33:19,731 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:19,731 INFO  L85        PathProgramCache]: Analyzing trace with hash 1306650741, now seen corresponding path program 1 times
[2024-03-12 01:33:19,731 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:19,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573249030]
[2024-03-12 01:33:19,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:19,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:19,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:33:19,751 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:33:19,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:33:19,773 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:33:19,775 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:33:19,775 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2024-03-12 01:33:19,775 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2024-03-12 01:33:19,775 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2024-03-12 01:33:19,775 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2024-03-12 01:33:19,776 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2024-03-12 01:33:19,776 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2024-03-12 01:33:19,776 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-12 01:33:19,776 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:19,777 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:33:19,777 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-12 01:33:19,803 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-12 01:33:19,804 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 109 places, 107 transitions, 241 flow
[2024-03-12 01:33:19,829 INFO  L124   PetriNetUnfolderBase]: 20/314 cut-off events.
[2024-03-12 01:33:19,829 INFO  L125   PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES.
[2024-03-12 01:33:19,830 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 339 conditions, 314 events. 20/314 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 996 event pairs, 1 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 188. Up to 16 conditions per place. 
[2024-03-12 01:33:19,830 INFO  L82        GeneralOperation]: Start removeDead. Operand has 109 places, 107 transitions, 241 flow
[2024-03-12 01:33:19,831 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 109 places, 107 transitions, 241 flow
[2024-03-12 01:33:19,832 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:33:19,833 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1093aaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:33:19,833 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-12 01:33:19,835 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:33:19,835 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-12 01:33:19,835 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:33:19,835 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:19,835 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:19,835 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:33:19,836 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:19,836 INFO  L85        PathProgramCache]: Analyzing trace with hash 2077821395, now seen corresponding path program 1 times
[2024-03-12 01:33:19,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:19,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786768011]
[2024-03-12 01:33:19,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:19,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:19,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:19,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:19,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:19,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786768011]
[2024-03-12 01:33:19,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786768011] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:19,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:19,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:33:19,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862294341]
[2024-03-12 01:33:19,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:19,865 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:33:19,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:19,865 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:33:19,865 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:33:19,884 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107
[2024-03-12 01:33:19,884 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 241 flow. Second operand  has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:19,884 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:19,884 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107
[2024-03-12 01:33:19,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:20,083 INFO  L124   PetriNetUnfolderBase]: 412/2191 cut-off events.
[2024-03-12 01:33:20,083 INFO  L125   PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES.
[2024-03-12 01:33:20,086 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 2191 events. 412/2191 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 18620 event pairs, 175 based on Foata normal form. 63/2061 useless extension candidates. Maximal degree in co-relation 757. Up to 495 conditions per place. 
[2024-03-12 01:33:20,093 INFO  L140   encePairwiseOnDemand]: 100/107 looper letters, 24 selfloop transitions, 4 changer transitions 0/114 dead transitions.
[2024-03-12 01:33:20,093 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 114 transitions, 311 flow
[2024-03-12 01:33:20,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:33:20,093 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:33:20,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions.
[2024-03-12 01:33:20,094 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8785046728971962
[2024-03-12 01:33:20,094 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 376 transitions.
[2024-03-12 01:33:20,094 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions.
[2024-03-12 01:33:20,094 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:20,095 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions.
[2024-03-12 01:33:20,095 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 94.0) internal successors, (376), 4 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-12 01:33:20,096 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:20,096 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:20,096 INFO  L175             Difference]: Start difference. First operand has 109 places, 107 transitions, 241 flow. Second operand 4 states and 376 transitions.
[2024-03-12 01:33:20,096 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 114 transitions, 311 flow
[2024-03-12 01:33:20,097 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 311 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:33:20,098 INFO  L231             Difference]: Finished difference. Result has 113 places, 106 transitions, 253 flow
[2024-03-12 01:33:20,098 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=113, PETRI_TRANSITIONS=106}
[2024-03-12 01:33:20,099 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places.
[2024-03-12 01:33:20,099 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 253 flow
[2024-03-12 01:33:20,099 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:20,099 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:20,099 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:20,100 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 01:33:20,100 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:33:20,100 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:20,100 INFO  L85        PathProgramCache]: Analyzing trace with hash -2019156887, now seen corresponding path program 1 times
[2024-03-12 01:33:20,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:20,100 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399629449]
[2024-03-12 01:33:20,100 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:20,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:20,107 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:20,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:20,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:20,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399629449]
[2024-03-12 01:33:20,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399629449] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:20,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:20,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:33:20,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717616820]
[2024-03-12 01:33:20,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:20,120 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:20,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:20,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:20,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:20,139 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107
[2024-03-12 01:33:20,140 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 253 flow. Second operand  has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:20,140 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:20,140 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107
[2024-03-12 01:33:20,140 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:20,555 INFO  L124   PetriNetUnfolderBase]: 1023/4264 cut-off events.
[2024-03-12 01:33:20,556 INFO  L125   PetriNetUnfolderBase]: For 720/933 co-relation queries the response was YES.
[2024-03-12 01:33:20,563 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6254 conditions, 4264 events. 1023/4264 cut-off events. For 720/933 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 41775 event pairs, 560 based on Foata normal form. 1/3721 useless extension candidates. Maximal degree in co-relation 6048. Up to 1329 conditions per place. 
[2024-03-12 01:33:20,576 INFO  L140   encePairwiseOnDemand]: 100/107 looper letters, 27 selfloop transitions, 6 changer transitions 0/119 dead transitions.
[2024-03-12 01:33:20,576 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 363 flow
[2024-03-12 01:33:20,577 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:20,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:20,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions.
[2024-03-12 01:33:20,578 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9003115264797508
[2024-03-12 01:33:20,578 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 289 transitions.
[2024-03-12 01:33:20,578 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions.
[2024-03-12 01:33:20,578 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:20,578 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions.
[2024-03-12 01:33:20,579 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:20,579 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:20,579 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:20,579 INFO  L175             Difference]: Start difference. First operand has 113 places, 106 transitions, 253 flow. Second operand 3 states and 289 transitions.
[2024-03-12 01:33:20,580 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 363 flow
[2024-03-12 01:33:20,582 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:20,583 INFO  L231             Difference]: Finished difference. Result has 115 places, 111 transitions, 293 flow
[2024-03-12 01:33:20,583 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=115, PETRI_TRANSITIONS=111}
[2024-03-12 01:33:20,583 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 6 predicate places.
[2024-03-12 01:33:20,584 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 293 flow
[2024-03-12 01:33:20,584 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:20,584 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:20,584 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:20,584 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-12 01:33:20,584 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:33:20,584 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:20,584 INFO  L85        PathProgramCache]: Analyzing trace with hash -1650732958, now seen corresponding path program 1 times
[2024-03-12 01:33:20,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:20,585 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071305457]
[2024-03-12 01:33:20,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:20,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:20,591 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:20,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:33:20,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:20,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071305457]
[2024-03-12 01:33:20,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071305457] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:20,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:20,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:33:20,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316328107]
[2024-03-12 01:33:20,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:20,623 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:33:20,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:20,623 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:33:20,623 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:33:20,659 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107
[2024-03-12 01:33:20,659 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 293 flow. Second operand  has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:20,659 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:20,659 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107
[2024-03-12 01:33:20,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:21,013 INFO  L124   PetriNetUnfolderBase]: 618/3166 cut-off events.
[2024-03-12 01:33:21,013 INFO  L125   PetriNetUnfolderBase]: For 436/440 co-relation queries the response was YES.
[2024-03-12 01:33:21,021 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4697 conditions, 3166 events. 618/3166 cut-off events. For 436/440 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 29550 event pairs, 247 based on Foata normal form. 63/2905 useless extension candidates. Maximal degree in co-relation 3847. Up to 511 conditions per place. 
[2024-03-12 01:33:21,032 INFO  L140   encePairwiseOnDemand]: 102/107 looper letters, 31 selfloop transitions, 4 changer transitions 0/127 dead transitions.
[2024-03-12 01:33:21,032 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 127 transitions, 404 flow
[2024-03-12 01:33:21,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:33:21,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:33:21,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions.
[2024-03-12 01:33:21,033 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8878504672897196
[2024-03-12 01:33:21,033 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 380 transitions.
[2024-03-12 01:33:21,034 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions.
[2024-03-12 01:33:21,034 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:21,034 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions.
[2024-03-12 01:33:21,035 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:21,036 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:21,036 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:21,036 INFO  L175             Difference]: Start difference. First operand has 115 places, 111 transitions, 293 flow. Second operand 4 states and 380 transitions.
[2024-03-12 01:33:21,036 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 127 transitions, 404 flow
[2024-03-12 01:33:21,038 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 127 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:21,039 INFO  L231             Difference]: Finished difference. Result has 117 places, 112 transitions, 297 flow
[2024-03-12 01:33:21,040 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=117, PETRI_TRANSITIONS=112}
[2024-03-12 01:33:21,040 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places.
[2024-03-12 01:33:21,040 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 297 flow
[2024-03-12 01:33:21,040 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:21,040 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:21,041 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:21,041 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-12 01:33:21,041 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:33:21,041 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:21,041 INFO  L85        PathProgramCache]: Analyzing trace with hash -709870861, now seen corresponding path program 1 times
[2024-03-12 01:33:21,041 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:21,041 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277498732]
[2024-03-12 01:33:21,041 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:21,042 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:21,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:21,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:21,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:21,124 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277498732]
[2024-03-12 01:33:21,124 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277498732] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:33:21,125 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986438273]
[2024-03-12 01:33:21,125 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:21,125 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:33:21,125 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:33:21,126 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:33:21,129 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-12 01:33:21,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:21,219 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-12 01:33:21,220 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:33:21,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:21,307 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:33:21,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:21,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986438273] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:33:21,352 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:33:21,352 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-03-12 01:33:21,353 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005815204]
[2024-03-12 01:33:21,353 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:33:21,353 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-03-12 01:33:21,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:21,353 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-03-12 01:33:21,354 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-03-12 01:33:21,444 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107
[2024-03-12 01:33:21,445 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 297 flow. Second operand  has 13 states, 13 states have (on average 84.92307692307692) internal successors, (1104), 13 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:21,445 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:21,445 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107
[2024-03-12 01:33:21,445 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:21,963 INFO  L124   PetriNetUnfolderBase]: 1016/4333 cut-off events.
[2024-03-12 01:33:21,964 INFO  L125   PetriNetUnfolderBase]: For 584/584 co-relation queries the response was YES.
[2024-03-12 01:33:21,972 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 4333 events. 1016/4333 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 40757 event pairs, 151 based on Foata normal form. 15/3810 useless extension candidates. Maximal degree in co-relation 3426. Up to 749 conditions per place. 
[2024-03-12 01:33:21,987 INFO  L140   encePairwiseOnDemand]: 99/107 looper letters, 50 selfloop transitions, 11 changer transitions 0/150 dead transitions.
[2024-03-12 01:33:21,987 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 150 transitions, 497 flow
[2024-03-12 01:33:21,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 01:33:21,988 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 01:33:21,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 893 transitions.
[2024-03-12 01:33:21,992 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8345794392523365
[2024-03-12 01:33:21,992 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 893 transitions.
[2024-03-12 01:33:21,992 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 893 transitions.
[2024-03-12 01:33:21,994 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:21,994 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 893 transitions.
[2024-03-12 01:33:21,998 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 89.3) internal successors, (893), 10 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,000 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,000 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,000 INFO  L175             Difference]: Start difference. First operand has 117 places, 112 transitions, 297 flow. Second operand 10 states and 893 transitions.
[2024-03-12 01:33:22,000 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 150 transitions, 497 flow
[2024-03-12 01:33:22,004 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 150 transitions, 491 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:22,005 INFO  L231             Difference]: Finished difference. Result has 127 places, 118 transitions, 347 flow
[2024-03-12 01:33:22,005 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=347, PETRI_PLACES=127, PETRI_TRANSITIONS=118}
[2024-03-12 01:33:22,006 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 18 predicate places.
[2024-03-12 01:33:22,006 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 118 transitions, 347 flow
[2024-03-12 01:33:22,006 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 84.92307692307692) internal successors, (1104), 13 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,006 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:22,006 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:22,012 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-12 01:33:22,209 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2024-03-12 01:33:22,214 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:33:22,214 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:22,214 INFO  L85        PathProgramCache]: Analyzing trace with hash 1047928841, now seen corresponding path program 1 times
[2024-03-12 01:33:22,215 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:22,215 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096047606]
[2024-03-12 01:33:22,215 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:22,216 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:22,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:22,244 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-12 01:33:22,244 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:22,244 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096047606]
[2024-03-12 01:33:22,244 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096047606] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:22,244 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:22,244 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:33:22,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133160686]
[2024-03-12 01:33:22,245 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:22,245 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:22,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:22,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:22,245 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:22,263 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107
[2024-03-12 01:33:22,264 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 118 transitions, 347 flow. Second operand  has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 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-12 01:33:22,264 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:22,264 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107
[2024-03-12 01:33:22,264 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:22,662 INFO  L124   PetriNetUnfolderBase]: 916/4000 cut-off events.
[2024-03-12 01:33:22,662 INFO  L125   PetriNetUnfolderBase]: For 1214/1242 co-relation queries the response was YES.
[2024-03-12 01:33:22,673 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6786 conditions, 4000 events. 916/4000 cut-off events. For 1214/1242 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 38755 event pairs, 539 based on Foata normal form. 1/3627 useless extension candidates. Maximal degree in co-relation 6142. Up to 1192 conditions per place. 
[2024-03-12 01:33:22,686 INFO  L140   encePairwiseOnDemand]: 100/107 looper letters, 28 selfloop transitions, 9 changer transitions 0/132 dead transitions.
[2024-03-12 01:33:22,686 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 132 transitions, 472 flow
[2024-03-12 01:33:22,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:22,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:22,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions.
[2024-03-12 01:33:22,688 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.897196261682243
[2024-03-12 01:33:22,688 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 288 transitions.
[2024-03-12 01:33:22,688 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions.
[2024-03-12 01:33:22,688 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:22,689 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions.
[2024-03-12 01:33:22,689 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,690 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,690 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,690 INFO  L175             Difference]: Start difference. First operand has 127 places, 118 transitions, 347 flow. Second operand 3 states and 288 transitions.
[2024-03-12 01:33:22,690 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 132 transitions, 472 flow
[2024-03-12 01:33:22,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 132 transitions, 464 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:22,694 INFO  L231             Difference]: Finished difference. Result has 129 places, 125 transitions, 415 flow
[2024-03-12 01:33:22,694 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=129, PETRI_TRANSITIONS=125}
[2024-03-12 01:33:22,695 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places.
[2024-03-12 01:33:22,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 125 transitions, 415 flow
[2024-03-12 01:33:22,695 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 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-12 01:33:22,695 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:22,696 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:22,696 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-12 01:33:22,696 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:33:22,696 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:22,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -1375263459, now seen corresponding path program 1 times
[2024-03-12 01:33:22,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:22,696 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107745393]
[2024-03-12 01:33:22,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:22,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:22,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:22,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-12 01:33:22,756 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:22,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107745393]
[2024-03-12 01:33:22,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107745393] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:22,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:22,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 01:33:22,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083970596]
[2024-03-12 01:33:22,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:22,757 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:22,757 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:22,758 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:22,758 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:22,769 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 107
[2024-03-12 01:33:22,770 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 125 transitions, 415 flow. Second operand  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,770 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:22,770 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 107
[2024-03-12 01:33:22,770 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:22,901 INFO  L124   PetriNetUnfolderBase]: 98/1340 cut-off events.
[2024-03-12 01:33:22,901 INFO  L125   PetriNetUnfolderBase]: For 340/382 co-relation queries the response was YES.
[2024-03-12 01:33:22,904 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1340 events. 98/1340 cut-off events. For 340/382 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10118 event pairs, 26 based on Foata normal form. 20/1253 useless extension candidates. Maximal degree in co-relation 922. Up to 100 conditions per place. 
[2024-03-12 01:33:22,907 INFO  L140   encePairwiseOnDemand]: 101/107 looper letters, 12 selfloop transitions, 6 changer transitions 0/124 dead transitions.
[2024-03-12 01:33:22,907 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 436 flow
[2024-03-12 01:33:22,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:22,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:22,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions.
[2024-03-12 01:33:22,908 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9252336448598131
[2024-03-12 01:33:22,908 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 297 transitions.
[2024-03-12 01:33:22,908 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions.
[2024-03-12 01:33:22,909 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:22,909 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions.
[2024-03-12 01:33:22,909 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,910 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,910 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,910 INFO  L175             Difference]: Start difference. First operand has 129 places, 125 transitions, 415 flow. Second operand 3 states and 297 transitions.
[2024-03-12 01:33:22,910 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 436 flow
[2024-03-12 01:33:22,912 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 124 transitions, 424 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:22,913 INFO  L231             Difference]: Finished difference. Result has 129 places, 119 transitions, 369 flow
[2024-03-12 01:33:22,913 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=129, PETRI_TRANSITIONS=119}
[2024-03-12 01:33:22,914 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places.
[2024-03-12 01:33:22,914 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 119 transitions, 369 flow
[2024-03-12 01:33:22,914 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,914 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:22,914 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:22,914 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-12 01:33:22,914 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:33:22,914 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:22,915 INFO  L85        PathProgramCache]: Analyzing trace with hash -364070712, now seen corresponding path program 1 times
[2024-03-12 01:33:22,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:22,915 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381301346]
[2024-03-12 01:33:22,915 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:22,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:22,923 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:22,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-03-12 01:33:22,939 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:22,939 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381301346]
[2024-03-12 01:33:22,939 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381301346] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:22,939 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:22,939 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:33:22,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234152439]
[2024-03-12 01:33:22,939 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:22,940 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:22,940 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:22,940 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:22,940 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:22,956 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107
[2024-03-12 01:33:22,957 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 119 transitions, 369 flow. Second operand  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:22,957 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:22,957 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107
[2024-03-12 01:33:22,957 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:23,093 INFO  L124   PetriNetUnfolderBase]: 177/1400 cut-off events.
[2024-03-12 01:33:23,094 INFO  L125   PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES.
[2024-03-12 01:33:23,097 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 1400 events. 177/1400 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11059 event pairs, 135 based on Foata normal form. 0/1290 useless extension candidates. Maximal degree in co-relation 2169. Up to 336 conditions per place. 
[2024-03-12 01:33:23,099 INFO  L140   encePairwiseOnDemand]: 102/107 looper letters, 23 selfloop transitions, 4 changer transitions 0/124 dead transitions.
[2024-03-12 01:33:23,099 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 443 flow
[2024-03-12 01:33:23,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:23,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:23,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions.
[2024-03-12 01:33:23,101 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8753894080996885
[2024-03-12 01:33:23,101 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 281 transitions.
[2024-03-12 01:33:23,101 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions.
[2024-03-12 01:33:23,101 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:23,102 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions.
[2024-03-12 01:33:23,102 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:23,103 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:23,103 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:23,103 INFO  L175             Difference]: Start difference. First operand has 129 places, 119 transitions, 369 flow. Second operand 3 states and 281 transitions.
[2024-03-12 01:33:23,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 443 flow
[2024-03-12 01:33:23,105 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 124 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:33:23,106 INFO  L231             Difference]: Finished difference. Result has 132 places, 122 transitions, 397 flow
[2024-03-12 01:33:23,106 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=132, PETRI_TRANSITIONS=122}
[2024-03-12 01:33:23,106 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 23 predicate places.
[2024-03-12 01:33:23,107 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 122 transitions, 397 flow
[2024-03-12 01:33:23,107 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:23,107 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:23,107 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:23,107 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-12 01:33:23,107 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:33:23,107 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:23,108 INFO  L85        PathProgramCache]: Analyzing trace with hash -1107906250, now seen corresponding path program 1 times
[2024-03-12 01:33:23,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:23,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153988761]
[2024-03-12 01:33:23,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:23,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:23,119 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:33:23,119 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:33:23,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:33:23,129 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:33:23,129 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:33:23,129 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-12 01:33:23,130 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-12 01:33:23,130 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-12 01:33:23,130 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-12 01:33:23,130 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-12 01:33:23,130 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-12 01:33:23,130 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-12 01:33:23,130 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-12 01:33:23,130 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:23,131 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:33:23,131 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-12 01:33:23,151 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-03-12 01:33:23,152 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 128 places, 125 transitions, 290 flow
[2024-03-12 01:33:23,189 INFO  L124   PetriNetUnfolderBase]: 42/556 cut-off events.
[2024-03-12 01:33:23,190 INFO  L125   PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES.
[2024-03-12 01:33:23,191 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 607 conditions, 556 events. 42/556 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2238 event pairs, 6 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 334. Up to 32 conditions per place. 
[2024-03-12 01:33:23,191 INFO  L82        GeneralOperation]: Start removeDead. Operand has 128 places, 125 transitions, 290 flow
[2024-03-12 01:33:23,193 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 128 places, 125 transitions, 290 flow
[2024-03-12 01:33:23,193 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:33:23,194 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1093aaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:33:23,194 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-12 01:33:23,196 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:33:23,196 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-12 01:33:23,196 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:33:23,196 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:23,196 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:23,196 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:23,196 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:23,196 INFO  L85        PathProgramCache]: Analyzing trace with hash -2041422413, now seen corresponding path program 1 times
[2024-03-12 01:33:23,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:23,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830232906]
[2024-03-12 01:33:23,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:23,197 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:23,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:23,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:23,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:23,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830232906]
[2024-03-12 01:33:23,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830232906] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:23,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:23,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:33:23,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117282814]
[2024-03-12 01:33:23,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:23,225 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:33:23,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:23,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:33:23,225 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:33:23,245 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125
[2024-03-12 01:33:23,246 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 290 flow. Second operand  has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:23,246 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:23,246 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125
[2024-03-12 01:33:23,246 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:23,950 INFO  L124   PetriNetUnfolderBase]: 2015/8288 cut-off events.
[2024-03-12 01:33:23,950 INFO  L125   PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES.
[2024-03-12 01:33:23,965 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11683 conditions, 8288 events. 2015/8288 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 87488 event pairs, 996 based on Foata normal form. 245/7797 useless extension candidates. Maximal degree in co-relation 3032. Up to 2117 conditions per place. 
[2024-03-12 01:33:23,985 INFO  L140   encePairwiseOnDemand]: 118/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/134 dead transitions.
[2024-03-12 01:33:23,985 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 376 flow
[2024-03-12 01:33:23,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:33:23,986 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:33:23,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions.
[2024-03-12 01:33:23,987 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.876
[2024-03-12 01:33:23,987 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 438 transitions.
[2024-03-12 01:33:23,987 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions.
[2024-03-12 01:33:23,987 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:23,987 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions.
[2024-03-12 01:33:23,988 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:23,989 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:23,989 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:23,989 INFO  L175             Difference]: Start difference. First operand has 128 places, 125 transitions, 290 flow. Second operand 4 states and 438 transitions.
[2024-03-12 01:33:23,989 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 376 flow
[2024-03-12 01:33:23,990 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 376 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:33:23,991 INFO  L231             Difference]: Finished difference. Result has 132 places, 124 transitions, 302 flow
[2024-03-12 01:33:23,992 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=132, PETRI_TRANSITIONS=124}
[2024-03-12 01:33:23,992 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places.
[2024-03-12 01:33:23,992 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 124 transitions, 302 flow
[2024-03-12 01:33:23,992 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:23,992 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:23,992 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:23,993 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-12 01:33:23,993 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:23,993 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:23,993 INFO  L85        PathProgramCache]: Analyzing trace with hash 572042246, now seen corresponding path program 1 times
[2024-03-12 01:33:23,993 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:23,993 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531656979]
[2024-03-12 01:33:23,993 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:23,993 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:23,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:24,009 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:24,010 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:24,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531656979]
[2024-03-12 01:33:24,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531656979] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:24,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:24,010 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:33:24,010 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100232907]
[2024-03-12 01:33:24,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:24,010 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:24,011 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:24,011 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:24,011 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:24,031 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-03-12 01:33:24,031 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 124 transitions, 302 flow. Second operand  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:24,032 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:24,032 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-03-12 01:33:24,032 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:26,290 INFO  L124   PetriNetUnfolderBase]: 7178/24007 cut-off events.
[2024-03-12 01:33:26,290 INFO  L125   PetriNetUnfolderBase]: For 4871/5497 co-relation queries the response was YES.
[2024-03-12 01:33:26,346 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36328 conditions, 24007 events. 7178/24007 cut-off events. For 4871/5497 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 296766 event pairs, 4490 based on Foata normal form. 2/21271 useless extension candidates. Maximal degree in co-relation 35461. Up to 8464 conditions per place. 
[2024-03-12 01:33:26,415 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 36 selfloop transitions, 7 changer transitions 0/142 dead transitions.
[2024-03-12 01:33:26,416 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 142 transitions, 454 flow
[2024-03-12 01:33:26,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:26,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:26,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions.
[2024-03-12 01:33:26,420 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9013333333333333
[2024-03-12 01:33:26,420 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 338 transitions.
[2024-03-12 01:33:26,420 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions.
[2024-03-12 01:33:26,421 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:26,421 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions.
[2024-03-12 01:33:26,421 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:26,422 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:26,422 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:26,422 INFO  L175             Difference]: Start difference. First operand has 132 places, 124 transitions, 302 flow. Second operand 3 states and 338 transitions.
[2024-03-12 01:33:26,422 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 142 transitions, 454 flow
[2024-03-12 01:33:26,439 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:26,441 INFO  L231             Difference]: Finished difference. Result has 134 places, 130 transitions, 350 flow
[2024-03-12 01:33:26,441 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=134, PETRI_TRANSITIONS=130}
[2024-03-12 01:33:26,441 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places.
[2024-03-12 01:33:26,442 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 350 flow
[2024-03-12 01:33:26,442 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:26,442 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:26,442 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:26,442 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-12 01:33:26,442 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:26,442 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:26,442 INFO  L85        PathProgramCache]: Analyzing trace with hash 304378482, now seen corresponding path program 1 times
[2024-03-12 01:33:26,443 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:26,443 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755480637]
[2024-03-12 01:33:26,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:26,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:26,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:26,472 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:33:26,473 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:26,473 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755480637]
[2024-03-12 01:33:26,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755480637] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:26,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:26,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:33:26,473 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593145533]
[2024-03-12 01:33:26,473 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:26,473 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:33:26,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:26,474 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:33:26,474 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:33:26,504 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125
[2024-03-12 01:33:26,505 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 350 flow. Second operand  has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:26,505 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:26,505 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125
[2024-03-12 01:33:26,505 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:28,338 INFO  L124   PetriNetUnfolderBase]: 4997/18928 cut-off events.
[2024-03-12 01:33:28,338 INFO  L125   PetriNetUnfolderBase]: For 2714/2778 co-relation queries the response was YES.
[2024-03-12 01:33:28,393 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28944 conditions, 18928 events. 4997/18928 cut-off events. For 2714/2778 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 235009 event pairs, 2028 based on Foata normal form. 259/17058 useless extension candidates. Maximal degree in co-relation 23406. Up to 3632 conditions per place. 
[2024-03-12 01:33:28,448 INFO  L140   encePairwiseOnDemand]: 120/125 looper letters, 40 selfloop transitions, 4 changer transitions 0/151 dead transitions.
[2024-03-12 01:33:28,449 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 151 transitions, 492 flow
[2024-03-12 01:33:28,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:33:28,450 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:33:28,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions.
[2024-03-12 01:33:28,450 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.89
[2024-03-12 01:33:28,450 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 445 transitions.
[2024-03-12 01:33:28,451 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 445 transitions.
[2024-03-12 01:33:28,451 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:28,451 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 445 transitions.
[2024-03-12 01:33:28,452 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:28,452 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:28,452 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:28,453 INFO  L175             Difference]: Start difference. First operand has 134 places, 130 transitions, 350 flow. Second operand 4 states and 445 transitions.
[2024-03-12 01:33:28,453 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 151 transitions, 492 flow
[2024-03-12 01:33:28,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 151 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:28,463 INFO  L231             Difference]: Finished difference. Result has 136 places, 131 transitions, 352 flow
[2024-03-12 01:33:28,464 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=136, PETRI_TRANSITIONS=131}
[2024-03-12 01:33:28,464 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 8 predicate places.
[2024-03-12 01:33:28,464 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 131 transitions, 352 flow
[2024-03-12 01:33:28,464 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:28,464 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:28,464 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:28,464 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-03-12 01:33:28,464 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:28,465 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:28,465 INFO  L85        PathProgramCache]: Analyzing trace with hash -36338752, now seen corresponding path program 1 times
[2024-03-12 01:33:28,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:28,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15441636]
[2024-03-12 01:33:28,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:28,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:28,472 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:28,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:28,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:28,519 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15441636]
[2024-03-12 01:33:28,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15441636] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:33:28,519 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773401635]
[2024-03-12 01:33:28,519 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:28,519 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:33:28,519 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:33:28,520 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:33:28,524 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-12 01:33:28,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:28,587 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-12 01:33:28,588 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:33:28,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:28,667 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:33:28,713 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:28,714 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [773401635] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:33:28,714 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:33:28,714 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-03-12 01:33:28,714 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027531121]
[2024-03-12 01:33:28,715 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:33:28,715 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-03-12 01:33:28,716 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:28,716 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-03-12 01:33:28,716 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-03-12 01:33:28,775 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125
[2024-03-12 01:33:28,776 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 352 flow. Second operand  has 13 states, 13 states have (on average 98.92307692307692) internal successors, (1286), 13 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:28,776 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:28,776 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125
[2024-03-12 01:33:28,776 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:31,137 INFO  L124   PetriNetUnfolderBase]: 6986/24819 cut-off events.
[2024-03-12 01:33:31,137 INFO  L125   PetriNetUnfolderBase]: For 3247/3247 co-relation queries the response was YES.
[2024-03-12 01:33:31,219 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38373 conditions, 24819 events. 6986/24819 cut-off events. For 3247/3247 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 311486 event pairs, 1505 based on Foata normal form. 15/21402 useless extension candidates. Maximal degree in co-relation 17727. Up to 4886 conditions per place. 
[2024-03-12 01:33:31,295 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 58 selfloop transitions, 11 changer transitions 0/173 dead transitions.
[2024-03-12 01:33:31,295 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 173 transitions, 576 flow
[2024-03-12 01:33:31,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 01:33:31,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 01:33:31,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1041 transitions.
[2024-03-12 01:33:31,298 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8328
[2024-03-12 01:33:31,298 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1041 transitions.
[2024-03-12 01:33:31,298 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1041 transitions.
[2024-03-12 01:33:31,298 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:31,298 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1041 transitions.
[2024-03-12 01:33:31,300 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 104.1) internal successors, (1041), 10 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:31,301 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:31,302 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:31,302 INFO  L175             Difference]: Start difference. First operand has 136 places, 131 transitions, 352 flow. Second operand 10 states and 1041 transitions.
[2024-03-12 01:33:31,302 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 173 transitions, 576 flow
[2024-03-12 01:33:31,323 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 173 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:31,325 INFO  L231             Difference]: Finished difference. Result has 146 places, 137 transitions, 402 flow
[2024-03-12 01:33:31,325 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=402, PETRI_PLACES=146, PETRI_TRANSITIONS=137}
[2024-03-12 01:33:31,325 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 18 predicate places.
[2024-03-12 01:33:31,326 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 137 transitions, 402 flow
[2024-03-12 01:33:31,326 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 98.92307692307692) internal successors, (1286), 13 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:31,326 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:31,326 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:31,332 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-12 01:33:31,527 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:33:31,528 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:31,528 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:31,528 INFO  L85        PathProgramCache]: Analyzing trace with hash 1069939606, now seen corresponding path program 1 times
[2024-03-12 01:33:31,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:31,529 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774292019]
[2024-03-12 01:33:31,529 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:31,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:31,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:31,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-12 01:33:31,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:31,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774292019]
[2024-03-12 01:33:31,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774292019] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:31,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:31,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:33:31,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243009133]
[2024-03-12 01:33:31,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:31,550 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:31,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:31,551 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:31,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:31,570 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-03-12 01:33:31,570 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 137 transitions, 402 flow. Second operand  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:31,570 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:31,570 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-03-12 01:33:31,571 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:34,734 INFO  L124   PetriNetUnfolderBase]: 8531/31196 cut-off events.
[2024-03-12 01:33:34,735 INFO  L125   PetriNetUnfolderBase]: For 11473/13428 co-relation queries the response was YES.
[2024-03-12 01:33:34,839 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53189 conditions, 31196 events. 8531/31196 cut-off events. For 11473/13428 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 417675 event pairs, 4887 based on Foata normal form. 23/27760 useless extension candidates. Maximal degree in co-relation 16780. Up to 9853 conditions per place. 
[2024-03-12 01:33:34,941 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 38 selfloop transitions, 11 changer transitions 0/157 dead transitions.
[2024-03-12 01:33:34,941 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 157 transitions, 579 flow
[2024-03-12 01:33:34,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:34,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:34,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions.
[2024-03-12 01:33:34,943 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8986666666666666
[2024-03-12 01:33:34,943 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 337 transitions.
[2024-03-12 01:33:34,943 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions.
[2024-03-12 01:33:34,943 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:34,943 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions.
[2024-03-12 01:33:34,944 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:34,945 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:34,945 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:34,945 INFO  L175             Difference]: Start difference. First operand has 146 places, 137 transitions, 402 flow. Second operand 3 states and 337 transitions.
[2024-03-12 01:33:34,945 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 157 transitions, 579 flow
[2024-03-12 01:33:34,955 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 157 transitions, 571 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:34,956 INFO  L231             Difference]: Finished difference. Result has 148 places, 146 transitions, 490 flow
[2024-03-12 01:33:34,957 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=148, PETRI_TRANSITIONS=146}
[2024-03-12 01:33:34,957 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 20 predicate places.
[2024-03-12 01:33:34,957 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 146 transitions, 490 flow
[2024-03-12 01:33:34,957 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:34,957 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:34,957 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:34,958 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-12 01:33:34,958 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:34,958 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:34,958 INFO  L85        PathProgramCache]: Analyzing trace with hash -1805915638, now seen corresponding path program 1 times
[2024-03-12 01:33:34,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:34,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052777747]
[2024-03-12 01:33:34,958 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:34,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:34,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:34,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-12 01:33:34,995 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:34,995 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052777747]
[2024-03-12 01:33:34,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052777747] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:34,996 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:34,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 01:33:34,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622697784]
[2024-03-12 01:33:34,996 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:34,996 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:34,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:34,997 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:34,997 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:35,006 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 125
[2024-03-12 01:33:35,006 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 490 flow. Second operand  has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:35,007 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:35,007 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 125
[2024-03-12 01:33:35,007 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:35,400 INFO  L124   PetriNetUnfolderBase]: 472/4778 cut-off events.
[2024-03-12 01:33:35,400 INFO  L125   PetriNetUnfolderBase]: For 1516/1591 co-relation queries the response was YES.
[2024-03-12 01:33:35,415 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7397 conditions, 4778 events. 472/4778 cut-off events. For 1516/1591 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 52409 event pairs, 234 based on Foata normal form. 128/4529 useless extension candidates. Maximal degree in co-relation 5367. Up to 454 conditions per place. 
[2024-03-12 01:33:35,424 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 16 selfloop transitions, 8 changer transitions 0/144 dead transitions.
[2024-03-12 01:33:35,424 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 517 flow
[2024-03-12 01:33:35,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:35,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:35,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions.
[2024-03-12 01:33:35,425 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9226666666666666
[2024-03-12 01:33:35,425 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 346 transitions.
[2024-03-12 01:33:35,426 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions.
[2024-03-12 01:33:35,426 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:35,426 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions.
[2024-03-12 01:33:35,426 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:35,427 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:35,427 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:35,427 INFO  L175             Difference]: Start difference. First operand has 148 places, 146 transitions, 490 flow. Second operand 3 states and 346 transitions.
[2024-03-12 01:33:35,427 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 517 flow
[2024-03-12 01:33:35,435 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 144 transitions, 505 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:35,437 INFO  L231             Difference]: Finished difference. Result has 148 places, 137 transitions, 426 flow
[2024-03-12 01:33:35,437 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=148, PETRI_TRANSITIONS=137}
[2024-03-12 01:33:35,437 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 20 predicate places.
[2024-03-12 01:33:35,437 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 426 flow
[2024-03-12 01:33:35,438 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:35,438 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:35,438 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:35,438 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-12 01:33:35,438 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:35,438 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:35,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 582579221, now seen corresponding path program 1 times
[2024-03-12 01:33:35,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:35,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101930678]
[2024-03-12 01:33:35,439 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:35,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:35,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:35,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-03-12 01:33:35,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:35,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101930678]
[2024-03-12 01:33:35,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101930678] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:35,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:35,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:33:35,457 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484858998]
[2024-03-12 01:33:35,457 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:35,457 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:35,457 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:35,458 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:35,458 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:35,480 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-03-12 01:33:35,481 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 426 flow. Second operand  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:35,481 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:35,481 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-03-12 01:33:35,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:36,059 INFO  L124   PetriNetUnfolderBase]: 928/5614 cut-off events.
[2024-03-12 01:33:36,060 INFO  L125   PetriNetUnfolderBase]: For 3543/3583 co-relation queries the response was YES.
[2024-03-12 01:33:36,075 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10224 conditions, 5614 events. 928/5614 cut-off events. For 3543/3583 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 63319 event pairs, 707 based on Foata normal form. 2/5113 useless extension candidates. Maximal degree in co-relation 7438. Up to 1545 conditions per place. 
[2024-03-12 01:33:36,085 INFO  L140   encePairwiseOnDemand]: 120/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/144 dead transitions.
[2024-03-12 01:33:36,086 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 530 flow
[2024-03-12 01:33:36,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:36,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:36,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions.
[2024-03-12 01:33:36,087 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.872
[2024-03-12 01:33:36,087 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 327 transitions.
[2024-03-12 01:33:36,087 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions.
[2024-03-12 01:33:36,087 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:36,087 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions.
[2024-03-12 01:33:36,088 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:36,088 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:36,089 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:36,089 INFO  L175             Difference]: Start difference. First operand has 148 places, 137 transitions, 426 flow. Second operand 3 states and 327 transitions.
[2024-03-12 01:33:36,089 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 530 flow
[2024-03-12 01:33:36,094 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 522 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:33:36,095 INFO  L231             Difference]: Finished difference. Result has 151 places, 140 transitions, 452 flow
[2024-03-12 01:33:36,096 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=151, PETRI_TRANSITIONS=140}
[2024-03-12 01:33:36,096 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 23 predicate places.
[2024-03-12 01:33:36,096 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 140 transitions, 452 flow
[2024-03-12 01:33:36,096 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:36,096 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:36,096 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:36,096 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-12 01:33:36,097 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:36,097 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:36,097 INFO  L85        PathProgramCache]: Analyzing trace with hash -1061457761, now seen corresponding path program 1 times
[2024-03-12 01:33:36,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:36,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869431618]
[2024-03-12 01:33:36,097 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:36,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:36,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:36,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:36,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:36,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869431618]
[2024-03-12 01:33:36,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869431618] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:33:36,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104099822]
[2024-03-12 01:33:36,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:36,196 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:33:36,197 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:33:36,197 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:33:36,202 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-12 01:33:36,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:36,305 INFO  L262         TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core
[2024-03-12 01:33:36,306 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:33:36,476 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:36,476 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:33:36,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:36,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104099822] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:33:36,578 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:33:36,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19
[2024-03-12 01:33:36,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974737221]
[2024-03-12 01:33:36,579 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:33:36,580 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-03-12 01:33:36,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:36,580 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-03-12 01:33:36,580 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342
[2024-03-12 01:33:36,651 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125
[2024-03-12 01:33:36,652 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 140 transitions, 452 flow. Second operand  has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:36,652 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:36,652 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125
[2024-03-12 01:33:36,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:37,519 INFO  L124   PetriNetUnfolderBase]: 1216/7900 cut-off events.
[2024-03-12 01:33:37,519 INFO  L125   PetriNetUnfolderBase]: For 3282/3529 co-relation queries the response was YES.
[2024-03-12 01:33:37,543 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13529 conditions, 7900 events. 1216/7900 cut-off events. For 3282/3529 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 85618 event pairs, 179 based on Foata normal form. 20/7197 useless extension candidates. Maximal degree in co-relation 5310. Up to 893 conditions per place. 
[2024-03-12 01:33:37,558 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 84 selfloop transitions, 14 changer transitions 1/206 dead transitions.
[2024-03-12 01:33:37,559 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 206 transitions, 858 flow
[2024-03-12 01:33:37,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-03-12 01:33:37,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-03-12 01:33:37,563 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1458 transitions.
[2024-03-12 01:33:37,564 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8331428571428572
[2024-03-12 01:33:37,564 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1458 transitions.
[2024-03-12 01:33:37,564 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1458 transitions.
[2024-03-12 01:33:37,565 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:37,565 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1458 transitions.
[2024-03-12 01:33:37,567 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 104.14285714285714) internal successors, (1458), 14 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:37,569 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:37,569 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:37,570 INFO  L175             Difference]: Start difference. First operand has 151 places, 140 transitions, 452 flow. Second operand 14 states and 1458 transitions.
[2024-03-12 01:33:37,570 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 206 transitions, 858 flow
[2024-03-12 01:33:37,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 206 transitions, 846 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:37,579 INFO  L231             Difference]: Finished difference. Result has 166 places, 144 transitions, 507 flow
[2024-03-12 01:33:37,579 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=507, PETRI_PLACES=166, PETRI_TRANSITIONS=144}
[2024-03-12 01:33:37,580 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 38 predicate places.
[2024-03-12 01:33:37,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 144 transitions, 507 flow
[2024-03-12 01:33:37,580 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:37,580 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:37,580 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:37,584 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-12 01:33:37,785 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2024-03-12 01:33:37,785 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:37,786 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:37,786 INFO  L85        PathProgramCache]: Analyzing trace with hash 665008963, now seen corresponding path program 1 times
[2024-03-12 01:33:37,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:37,787 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534014307]
[2024-03-12 01:33:37,787 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:37,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:37,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:37,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2024-03-12 01:33:37,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:37,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534014307]
[2024-03-12 01:33:37,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534014307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:37,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:37,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:33:37,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900643970]
[2024-03-12 01:33:37,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:37,824 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:37,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:37,824 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:37,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:37,840 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-03-12 01:33:37,841 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 144 transitions, 507 flow. Second operand  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:37,841 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:37,841 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-03-12 01:33:37,841 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:38,433 INFO  L124   PetriNetUnfolderBase]: 883/5676 cut-off events.
[2024-03-12 01:33:38,433 INFO  L125   PetriNetUnfolderBase]: For 4246/4270 co-relation queries the response was YES.
[2024-03-12 01:33:38,448 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10741 conditions, 5676 events. 883/5676 cut-off events. For 4246/4270 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 62301 event pairs, 677 based on Foata normal form. 1/5182 useless extension candidates. Maximal degree in co-relation 9955. Up to 1476 conditions per place. 
[2024-03-12 01:33:38,457 INFO  L140   encePairwiseOnDemand]: 120/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/150 dead transitions.
[2024-03-12 01:33:38,457 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 150 transitions, 602 flow
[2024-03-12 01:33:38,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:38,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:38,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions.
[2024-03-12 01:33:38,459 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8693333333333333
[2024-03-12 01:33:38,459 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 326 transitions.
[2024-03-12 01:33:38,459 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions.
[2024-03-12 01:33:38,459 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:38,459 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions.
[2024-03-12 01:33:38,459 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:38,460 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:38,460 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:38,460 INFO  L175             Difference]: Start difference. First operand has 166 places, 144 transitions, 507 flow. Second operand 3 states and 326 transitions.
[2024-03-12 01:33:38,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 150 transitions, 602 flow
[2024-03-12 01:33:38,475 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 150 transitions, 584 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-03-12 01:33:38,477 INFO  L231             Difference]: Finished difference. Result has 163 places, 147 transitions, 525 flow
[2024-03-12 01:33:38,477 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=163, PETRI_TRANSITIONS=147}
[2024-03-12 01:33:38,477 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 35 predicate places.
[2024-03-12 01:33:38,477 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 147 transitions, 525 flow
[2024-03-12 01:33:38,477 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:38,478 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:38,478 INFO  L208   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:38,478 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-12 01:33:38,478 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:38,478 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:38,478 INFO  L85        PathProgramCache]: Analyzing trace with hash -691052328, now seen corresponding path program 1 times
[2024-03-12 01:33:38,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:38,478 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307841376]
[2024-03-12 01:33:38,478 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:38,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:38,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:38,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 80 backedges. 52 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:38,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:38,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307841376]
[2024-03-12 01:33:38,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307841376] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:33:38,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113593484]
[2024-03-12 01:33:38,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:38,630 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:33:38,630 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:33:38,631 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:33:38,635 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-12 01:33:38,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:38,713 INFO  L262         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core
[2024-03-12 01:33:38,716 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:33:38,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:33:38,950 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 01:33:38,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [113593484] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:38,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 01:33:38,950 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21
[2024-03-12 01:33:38,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221796143]
[2024-03-12 01:33:38,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:38,951 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-03-12 01:33:38,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:38,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-03-12 01:33:38,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420
[2024-03-12 01:33:39,012 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-03-12 01:33:39,013 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 147 transitions, 525 flow. Second operand  has 12 states, 12 states have (on average 100.0) internal successors, (1200), 12 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:39,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:39,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-03-12 01:33:39,013 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:39,949 INFO  L124   PetriNetUnfolderBase]: 1122/7422 cut-off events.
[2024-03-12 01:33:39,949 INFO  L125   PetriNetUnfolderBase]: For 4674/4959 co-relation queries the response was YES.
[2024-03-12 01:33:39,975 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13619 conditions, 7422 events. 1122/7422 cut-off events. For 4674/4959 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 80738 event pairs, 172 based on Foata normal form. 48/6797 useless extension candidates. Maximal degree in co-relation 5711. Up to 572 conditions per place. 
[2024-03-12 01:33:39,990 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 89 selfloop transitions, 16 changer transitions 8/223 dead transitions.
[2024-03-12 01:33:39,990 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 223 transitions, 972 flow
[2024-03-12 01:33:39,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-03-12 01:33:39,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-03-12 01:33:39,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1682 transitions.
[2024-03-12 01:33:39,992 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.841
[2024-03-12 01:33:39,992 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1682 transitions.
[2024-03-12 01:33:39,992 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1682 transitions.
[2024-03-12 01:33:39,992 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:39,993 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1682 transitions.
[2024-03-12 01:33:39,994 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 105.125) internal successors, (1682), 16 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:39,996 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:39,996 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:39,997 INFO  L175             Difference]: Start difference. First operand has 163 places, 147 transitions, 525 flow. Second operand 16 states and 1682 transitions.
[2024-03-12 01:33:39,997 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 223 transitions, 972 flow
[2024-03-12 01:33:40,007 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 223 transitions, 950 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-03-12 01:33:40,009 INFO  L231             Difference]: Finished difference. Result has 171 places, 145 transitions, 520 flow
[2024-03-12 01:33:40,009 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=520, PETRI_PLACES=171, PETRI_TRANSITIONS=145}
[2024-03-12 01:33:40,010 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 43 predicate places.
[2024-03-12 01:33:40,010 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 145 transitions, 520 flow
[2024-03-12 01:33:40,010 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 100.0) internal successors, (1200), 12 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:40,010 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:40,010 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:40,014 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-12 01:33:40,214 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:33:40,215 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:40,215 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:40,216 INFO  L85        PathProgramCache]: Analyzing trace with hash -455501539, now seen corresponding path program 1 times
[2024-03-12 01:33:40,216 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:40,216 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330075394]
[2024-03-12 01:33:40,216 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:40,216 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:40,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:40,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-12 01:33:40,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:40,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330075394]
[2024-03-12 01:33:40,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330075394] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:40,486 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:40,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:33:40,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242333270]
[2024-03-12 01:33:40,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:40,487 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:33:40,487 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:40,487 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:33:40,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:33:40,572 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 125
[2024-03-12 01:33:40,573 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 145 transitions, 520 flow. Second operand  has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:40,573 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:40,574 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 125
[2024-03-12 01:33:40,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:41,582 INFO  L124   PetriNetUnfolderBase]: 2334/8603 cut-off events.
[2024-03-12 01:33:41,582 INFO  L125   PetriNetUnfolderBase]: For 3825/4053 co-relation queries the response was YES.
[2024-03-12 01:33:41,613 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17385 conditions, 8603 events. 2334/8603 cut-off events. For 3825/4053 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 91411 event pairs, 950 based on Foata normal form. 0/7884 useless extension candidates. Maximal degree in co-relation 16744. Up to 1797 conditions per place. 
[2024-03-12 01:33:41,633 INFO  L140   encePairwiseOnDemand]: 119/125 looper letters, 55 selfloop transitions, 6 changer transitions 0/176 dead transitions.
[2024-03-12 01:33:41,633 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 176 transitions, 736 flow
[2024-03-12 01:33:41,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:33:41,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:33:41,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions.
[2024-03-12 01:33:41,635 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8333333333333334
[2024-03-12 01:33:41,635 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 625 transitions.
[2024-03-12 01:33:41,635 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 625 transitions.
[2024-03-12 01:33:41,635 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:41,635 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 625 transitions.
[2024-03-12 01:33:41,636 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:41,637 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:41,637 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:41,637 INFO  L175             Difference]: Start difference. First operand has 171 places, 145 transitions, 520 flow. Second operand 6 states and 625 transitions.
[2024-03-12 01:33:41,637 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 176 transitions, 736 flow
[2024-03-12 01:33:41,673 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 176 transitions, 682 flow, removed 3 selfloop flow, removed 17 redundant places.
[2024-03-12 01:33:41,675 INFO  L231             Difference]: Finished difference. Result has 158 places, 144 transitions, 476 flow
[2024-03-12 01:33:41,675 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=158, PETRI_TRANSITIONS=144}
[2024-03-12 01:33:41,676 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 30 predicate places.
[2024-03-12 01:33:41,676 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 144 transitions, 476 flow
[2024-03-12 01:33:41,676 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:41,676 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:41,676 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:41,676 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-12 01:33:41,676 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:41,677 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:41,677 INFO  L85        PathProgramCache]: Analyzing trace with hash -377896736, now seen corresponding path program 1 times
[2024-03-12 01:33:41,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:41,677 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813447745]
[2024-03-12 01:33:41,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:41,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:41,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:41,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2024-03-12 01:33:41,742 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:41,742 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813447745]
[2024-03-12 01:33:41,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813447745] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:33:41,743 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:33:41,743 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:33:41,743 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136654619]
[2024-03-12 01:33:41,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:33:41,744 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:33:41,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:41,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:33:41,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:33:41,773 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125
[2024-03-12 01:33:41,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 144 transitions, 476 flow. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:41,773 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:41,773 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125
[2024-03-12 01:33:41,773 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:42,785 INFO  L124   PetriNetUnfolderBase]: 1353/8906 cut-off events.
[2024-03-12 01:33:42,786 INFO  L125   PetriNetUnfolderBase]: For 5209/5230 co-relation queries the response was YES.
[2024-03-12 01:33:42,814 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16947 conditions, 8906 events. 1353/8906 cut-off events. For 5209/5230 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 106620 event pairs, 605 based on Foata normal form. 0/8360 useless extension candidates. Maximal degree in co-relation 16203. Up to 1591 conditions per place. 
[2024-03-12 01:33:42,826 INFO  L140   encePairwiseOnDemand]: 118/125 looper letters, 30 selfloop transitions, 9 changer transitions 1/157 dead transitions.
[2024-03-12 01:33:42,826 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 157 transitions, 610 flow
[2024-03-12 01:33:42,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:33:42,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:33:42,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions.
[2024-03-12 01:33:42,828 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8986666666666666
[2024-03-12 01:33:42,828 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 337 transitions.
[2024-03-12 01:33:42,828 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions.
[2024-03-12 01:33:42,828 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:42,828 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions.
[2024-03-12 01:33:42,829 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:42,830 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:42,830 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:42,830 INFO  L175             Difference]: Start difference. First operand has 158 places, 144 transitions, 476 flow. Second operand 3 states and 337 transitions.
[2024-03-12 01:33:42,830 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 157 transitions, 610 flow
[2024-03-12 01:33:42,887 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 157 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:33:42,888 INFO  L231             Difference]: Finished difference. Result has 157 places, 148 transitions, 540 flow
[2024-03-12 01:33:42,888 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=157, PETRI_TRANSITIONS=148}
[2024-03-12 01:33:42,889 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 29 predicate places.
[2024-03-12 01:33:42,889 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 148 transitions, 540 flow
[2024-03-12 01:33:42,889 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:42,889 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:42,889 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:42,889 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-12 01:33:42,889 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:42,890 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:42,890 INFO  L85        PathProgramCache]: Analyzing trace with hash -2123264483, now seen corresponding path program 1 times
[2024-03-12 01:33:42,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:42,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667227368]
[2024-03-12 01:33:42,890 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:42,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:42,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:43,002 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-12 01:33:43,002 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:33:43,002 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667227368]
[2024-03-12 01:33:43,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667227368] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:33:43,003 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514159173]
[2024-03-12 01:33:43,003 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:43,003 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:33:43,003 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:33:43,004 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:33:43,006 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-12 01:33:43,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:33:43,118 INFO  L262         TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-12 01:33:43,121 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:33:43,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-12 01:33:43,288 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:33:43,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-12 01:33:43,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [514159173] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:33:43,402 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:33:43,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12
[2024-03-12 01:33:43,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72284526]
[2024-03-12 01:33:43,402 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:33:43,403 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-03-12 01:33:43,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:33:43,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-03-12 01:33:43,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132
[2024-03-12 01:33:43,510 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125
[2024-03-12 01:33:43,511 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 148 transitions, 540 flow. Second operand  has 12 states, 12 states have (on average 100.33333333333333) internal successors, (1204), 12 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:43,511 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:33:43,511 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125
[2024-03-12 01:33:43,511 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:33:44,222 INFO  L124   PetriNetUnfolderBase]: 1050/4095 cut-off events.
[2024-03-12 01:33:44,222 INFO  L125   PetriNetUnfolderBase]: For 1793/1821 co-relation queries the response was YES.
[2024-03-12 01:33:44,234 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7677 conditions, 4095 events. 1050/4095 cut-off events. For 1793/1821 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 35282 event pairs, 84 based on Foata normal form. 128/4169 useless extension candidates. Maximal degree in co-relation 7031. Up to 518 conditions per place. 
[2024-03-12 01:33:44,241 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 88 selfloop transitions, 10 changer transitions 17/228 dead transitions.
[2024-03-12 01:33:44,241 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 228 transitions, 1000 flow
[2024-03-12 01:33:44,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 01:33:44,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 01:33:44,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1079 transitions.
[2024-03-12 01:33:44,242 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8632
[2024-03-12 01:33:44,243 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1079 transitions.
[2024-03-12 01:33:44,243 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1079 transitions.
[2024-03-12 01:33:44,244 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:33:44,244 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1079 transitions.
[2024-03-12 01:33:44,245 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 107.9) internal successors, (1079), 10 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:44,246 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:44,246 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:44,246 INFO  L175             Difference]: Start difference. First operand has 157 places, 148 transitions, 540 flow. Second operand 10 states and 1079 transitions.
[2024-03-12 01:33:44,246 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 228 transitions, 1000 flow
[2024-03-12 01:33:44,249 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 228 transitions, 982 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:33:44,251 INFO  L231             Difference]: Finished difference. Result has 167 places, 145 transitions, 540 flow
[2024-03-12 01:33:44,251 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=540, PETRI_PLACES=167, PETRI_TRANSITIONS=145}
[2024-03-12 01:33:44,252 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 39 predicate places.
[2024-03-12 01:33:44,252 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 145 transitions, 540 flow
[2024-03-12 01:33:44,252 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 100.33333333333333) internal successors, (1204), 12 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:33:44,252 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:33:44,252 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:44,260 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-12 01:33:44,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:33:44,454 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:33:44,455 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:33:44,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 186415000, now seen corresponding path program 1 times
[2024-03-12 01:33:44,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:33:44,456 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282037617]
[2024-03-12 01:33:44,456 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:33:44,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:33:44,492 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:33:44,492 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:33:44,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:33:44,533 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:33:44,533 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:33:44,534 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining)
[2024-03-12 01:33:44,534 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-03-12 01:33:44,534 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-03-12 01:33:44,534 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2024-03-12 01:33:44,534 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-03-12 01:33:44,534 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-03-12 01:33:44,534 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-03-12 01:33:44,534 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-03-12 01:33:44,534 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-12 01:33:44,534 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:33:44,538 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances
[2024-03-12 01:33:44,538 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-12 01:33:44,601 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,602 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,603 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,603 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,604 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,604 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,604 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,604 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,604 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,604 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,604 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,604 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,605 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,605 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,605 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,605 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:33:44,605 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,605 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,606 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,606 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,606 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,606 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,606 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,606 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,606 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,607 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,607 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,607 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,607 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,607 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,607 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,607 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,607 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
[2024-03-12 01:33:44,608 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,608 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,608 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,608 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,608 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,608 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,609 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,609 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,609 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,609 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,609 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,610 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,610 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,610 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,610 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,610 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,610 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,610 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,611 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,611 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:33:44,611 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,611 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,611 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,611 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,611 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,612 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,621 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.03 01:33:44 BasicIcfg
[2024-03-12 01:33:44,621 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-12 01:33:44,622 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-12 01:33:44,622 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-03-12 01:33:44,622 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-03-12 01:33:44,622 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:33:17" (3/4) ...
[2024-03-12 01:33:44,624 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-12 01:33:44,625 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-12 01:33:44,625 INFO  L158              Benchmark]: Toolchain (without parser) took 27701.26ms. Allocated memory was 144.7MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 96.5MB in the beginning and 750.0MB in the end (delta: -653.5MB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB.
[2024-03-12 01:33:44,625 INFO  L158              Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-12 01:33:44,626 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 304.89ms. Allocated memory is still 144.7MB. Free memory was 96.5MB in the beginning and 77.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-03-12 01:33:44,626 INFO  L158              Benchmark]: Boogie Procedure Inliner took 30.14ms. Allocated memory is still 144.7MB. Free memory was 77.2MB in the beginning and 75.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-12 01:33:44,626 INFO  L158              Benchmark]: Boogie Preprocessor took 19.67ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 73.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-12 01:33:44,626 INFO  L158              Benchmark]: RCFGBuilder took 329.32ms. Allocated memory is still 144.7MB. Free memory was 73.4MB in the beginning and 59.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-03-12 01:33:44,626 INFO  L158              Benchmark]: TraceAbstraction took 27009.42ms. Allocated memory was 144.7MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 58.8MB in the beginning and 750.0MB in the end (delta: -691.3MB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB.
[2024-03-12 01:33:44,627 INFO  L158              Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 3.8GB. Free memory is still 750.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-12 01:33:44,628 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 304.89ms. Allocated memory is still 144.7MB. Free memory was 96.5MB in the beginning and 77.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 30.14ms. Allocated memory is still 144.7MB. Free memory was 77.2MB in the beginning and 75.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 19.67ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 73.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 329.32ms. Allocated memory is still 144.7MB. Free memory was 73.4MB in the beginning and 59.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 27009.42ms. Allocated memory was 144.7MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 58.8MB in the beginning and 750.0MB in the end (delta: -691.3MB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB.
 * Witness Printer took 3.15ms. Allocated memory is still 3.8GB. Free memory is still 750.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - DataRaceFoundResult [Line: 678]: Data race detected
[2024-03-12 01:33:44,762 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,762 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,763 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,763 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,763 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,763 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,763 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,764 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,764 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,764 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,764 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,764 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,764 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,764 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,764 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,765 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:33:44,765 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,765 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,765 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,765 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,765 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,765 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,765 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,765 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,766 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,766 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,766 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,766 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,766 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,766 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,766 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,766 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,767 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,767 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
[2024-03-12 01:33:44,767 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,767 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,767 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,767 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,768 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,768 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,768 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,768 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,768 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,768 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,768 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,768 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,769 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,769 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,769 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,769 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,769 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,769 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,770 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:33:44,770 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,770 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,770 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,770 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,770 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,770 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,822 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,822 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,822 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,822 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:33:44,823 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,823 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,823 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,823 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,823 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,823 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,823 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,823 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,823 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,824 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,824 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,824 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:33:44,824 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,824 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,824 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,824 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,824 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,824 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,824 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,825 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,825 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,825 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,825 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,825 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,825 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,825 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,825 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,825 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:33:44,825 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
[2024-03-12 01:33:44,826 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,826 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,826 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,826 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,826 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,826 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,826 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,826 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,826 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,827 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,827 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,827 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,827 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,827 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,827 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,827 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,827 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-03-12 01:33:44,827 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,828 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-03-12 01:33:44,828 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:33:44,828 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,828 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,828 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,828 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:33:44,828 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:33:44,828 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
    Data race detected
The following path leads to a data race: 
[L674]               0  int data = 0;
        VAL             [data=0]
[L675]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
        VAL             [data=0, data_mutex={1:0}]
[L683]               0  int breads_total = 4;
        VAL             [breads_total=4, data=0, data_mutex={1:0}]
[L684]               0  pthread_t tids[4];
        VAL             [breads_total=4, data=0, data_mutex={1:0}, tids={13:0}]
[L685]               0  int i = 0;
        VAL             [breads_total=4, data=0, data_mutex={1:0}, i=0, tids={13:0}]
[L685]  COND TRUE    0  i < breads_total
        VAL             [breads_total=4, data=0, data_mutex={1:0}, i=0, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={13:0}]
[L685]  COND TRUE    0  i < breads_total
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={13:0}]
[L685]  COND TRUE    0  i < breads_total
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, tids={13:0}]
[L685]  COND TRUE    0  i < breads_total
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, tids={13:0}]
[L678]               1  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L678]               2  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L678]               3  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L680]               3  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, tids={13:0}]
[L685]  COND FALSE   0  !(i < breads_total)
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, tids={13:0}]
[L688]               0  int i = 0;
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={13:0}]
[L688]  COND TRUE    0  i < breads_total - 1
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={13:0}]
[L689]  EXPR         0  tids[i]
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={13:0}]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={13:0}]
[L680]               1  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L689]  FCALL, JOIN  1  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={13:0}]
[L688]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={13:0}]
[L680]               2  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L688]  COND TRUE    0  i < breads_total - 1
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={13:0}]
[L689]  EXPR         0  tids[i]
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={13:0}]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={13:0}]
[L689]  FCALL, JOIN  2  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={13:0}]
[L688]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={13:0}]
[L688]  COND TRUE    0  i < breads_total - 1
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={13:0}]
[L689]  EXPR         0  tids[i]
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={13:0}]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={13:0}]
[L689]  FCALL, JOIN  3  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={13:0}]
[L688]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, tids={13:0}]
[L688]  COND FALSE   0  !(i < breads_total - 1)
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, tids={13:0}]
[L678]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L691]               0  return data;
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, tids={13:0}]
[L678]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]

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

  - UnprovableResult [Line: 691]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 689]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 686]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 86 locations, 5 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: 0.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 14 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=2, InterpolantAutomatonStates: 7, 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.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 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, 103 locations, 6 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: 1.5s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 399 IncrementalHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 30 mSDtfsCounter, 399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=3, InterpolantAutomatonStates: 24, 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.4s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 450 SizeOfPredicates, 4 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6/9 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 3 thread instances
    CFG has 5 procedures, 120 locations, 7 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: 3.3s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 22 mSDtfsCounter, 543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=415occurred in iteration=5, InterpolantAutomatonStates: 30, 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.4s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 588 SizeOfPredicates, 4 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 31/34 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 4 thread instances
    CFG has 6 procedures, 137 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: 21.4s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1273 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1049 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2131 IncrementalHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 113 mSDtfsCounter, 2131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 410 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=12, InterpolantAutomatonStates: 82, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1076 NumberOfCodeBlocks, 1076 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1092 ConstructedInterpolants, 0 QuantifiedInterpolants, 3095 SizeOfPredicates, 26 NumberOfNonLiveVariables, 596 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 529/662 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-12 01:33:44,842 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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
