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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c31a54802b36069ad17933a6a18dd94a6af410d31d2cd906e0e916fed918b284
[2023-10-26 08:57:42,786 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-26 08:57:42,818 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-26 08:57:42,820 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-26 08:57:42,820 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-26 08:57:42,821 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-26 08:57:42,822 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2023-10-26 08:57:44,438 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-26 08:57:44,811 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-26 08:57:44,820 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2023-10-26 08:57:44,830 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/6229e3044/3e8c916569a944918ead0931afb4af7a/FLAGd51284109
[2023-10-26 08:57:44,866 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/6229e3044/3e8c916569a944918ead0931afb4af7a
[2023-10-26 08:57:44,868 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-26 08:57:44,882 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-26 08:57:44,883 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-26 08:57:44,883 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-26 08:57:44,886 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-26 08:57:44,886 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:57:44" (1/1) ...
[2023-10-26 08:57:44,888 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567d4542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:44, skipping insertion in model container
[2023-10-26 08:57:44,888 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:57:44" (1/1) ...
[2023-10-26 08:57:44,893 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-26 08:57:45,000 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-26 08:57:45,475 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:57:45,508 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-26 08:57:45,575 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:57:45,627 INFO  L208         MainTranslator]: Completed translation
[2023-10-26 08:57:45,636 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45 WrapperNode
[2023-10-26 08:57:45,636 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-26 08:57:45,638 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-26 08:57:45,638 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-26 08:57:45,638 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-26 08:57:45,644 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (1/1) ...
[2023-10-26 08:57:45,686 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (1/1) ...
[2023-10-26 08:57:45,704 INFO  L138                Inliner]: procedures = 157, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53
[2023-10-26 08:57:45,714 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-26 08:57:45,724 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-26 08:57:45,724 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-26 08:57:45,724 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-26 08:57:45,731 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (1/1) ...
[2023-10-26 08:57:45,736 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (1/1) ...
[2023-10-26 08:57:45,742 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (1/1) ...
[2023-10-26 08:57:45,743 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (1/1) ...
[2023-10-26 08:57:45,752 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (1/1) ...
[2023-10-26 08:57:45,767 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (1/1) ...
[2023-10-26 08:57:45,776 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (1/1) ...
[2023-10-26 08:57:45,777 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (1/1) ...
[2023-10-26 08:57:45,779 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-26 08:57:45,779 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-26 08:57:45,779 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-26 08:57:45,779 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-26 08:57:45,780 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (1/1) ...
[2023-10-26 08:57:45,784 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:57:45,813 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:57:45,831 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-26 08:57:45,866 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-26 08:57:45,889 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-26 08:57:45,889 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-26 08:57:45,890 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-26 08:57:45,890 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-26 08:57:45,890 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-26 08:57:45,890 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-26 08:57:45,890 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-26 08:57:45,890 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-26 08:57:45,890 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-26 08:57:45,891 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-26 08:57:45,891 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-26 08:57:45,892 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-26 08:57:46,079 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-26 08:57:46,105 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-26 08:57:46,365 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-26 08:57:46,369 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-26 08:57:46,395 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-26 08:57:46,397 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:57:46 BoogieIcfgContainer
[2023-10-26 08:57:46,397 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-26 08:57:46,398 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-26 08:57:46,398 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-26 08:57:46,401 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-26 08:57:46,411 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:57:44" (1/3) ...
[2023-10-26 08:57:46,412 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56449575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:57:46, skipping insertion in model container
[2023-10-26 08:57:46,412 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:57:45" (2/3) ...
[2023-10-26 08:57:46,412 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56449575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:57:46, skipping insertion in model container
[2023-10-26 08:57:46,412 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:57:46" (3/3) ...
[2023-10-26 08:57:46,414 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race.i
[2023-10-26 08:57:46,430 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-26 08:57:46,442 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-26 08:57:46,443 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2023-10-26 08:57:46,443 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-26 08:57:46,561 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-26 08:57:46,618 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 150 flow
[2023-10-26 08:57:46,702 INFO  L130       PetriNetUnfolder]: 5/97 cut-off events.
[2023-10-26 08:57:46,707 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:57:46,715 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 103 conditions, 97 events. 5/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2023-10-26 08:57:46,716 INFO  L82        GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 150 flow
[2023-10-26 08:57:46,721 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 150 flow
[2023-10-26 08:57:46,725 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:57:46,742 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 71 transitions, 150 flow
[2023-10-26 08:57:46,746 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 71 transitions, 150 flow
[2023-10-26 08:57:46,770 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 150 flow
[2023-10-26 08:57:46,817 INFO  L130       PetriNetUnfolder]: 5/97 cut-off events.
[2023-10-26 08:57:46,821 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:57:46,822 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 103 conditions, 97 events. 5/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2023-10-26 08:57:46,824 INFO  L119        LiptonReduction]: Number of co-enabled transitions 896
[2023-10-26 08:57:49,017 INFO  L134        LiptonReduction]: Checked pairs total: 1633
[2023-10-26 08:57:49,017 INFO  L136        LiptonReduction]: Total number of compositions: 57
[2023-10-26 08:57:49,053 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:57:49,059 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1702d3f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:57:49,059 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2023-10-26 08:57:49,061 INFO  L130       PetriNetUnfolder]: 0/5 cut-off events.
[2023-10-26 08:57:49,062 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:57:49,062 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:49,063 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-26 08:57:49,064 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-10-26 08:57:49,068 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:49,068 INFO  L85        PathProgramCache]: Analyzing trace with hash 260257, now seen corresponding path program 1 times
[2023-10-26 08:57:49,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:49,093 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759917794]
[2023-10-26 08:57:49,094 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:49,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:49,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:49,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:57:49,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:49,444 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759917794]
[2023-10-26 08:57:49,445 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759917794] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:57:49,445 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:57:49,445 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:57:49,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739357495]
[2023-10-26 08:57:49,447 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:57:49,453 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:57:49,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:49,490 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:57:49,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:57:49,535 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 128
[2023-10-26 08:57:49,541 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 44 flow. Second operand  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:49,554 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:49,555 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 128
[2023-10-26 08:57:49,556 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:49,610 INFO  L130       PetriNetUnfolder]: 12/52 cut-off events.
[2023-10-26 08:57:49,610 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:57:49,611 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100 conditions, 52 events. 12/52 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 144 event pairs, 5 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 72. Up to 36 conditions per place. 
[2023-10-26 08:57:49,612 INFO  L137   encePairwiseOnDemand]: 124/128 looper letters, 13 selfloop transitions, 2 changer transitions 0/20 dead transitions.
[2023-10-26 08:57:49,612 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 20 transitions, 78 flow
[2023-10-26 08:57:49,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:57:49,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:57:49,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions.
[2023-10-26 08:57:49,643 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5442708333333334
[2023-10-26 08:57:49,644 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 209 transitions.
[2023-10-26 08:57:49,644 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 209 transitions.
[2023-10-26 08:57:49,646 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:49,648 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 209 transitions.
[2023-10-26 08:57:49,653 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:49,671 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:49,671 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:49,673 INFO  L175             Difference]: Start difference. First operand has 20 places, 18 transitions, 44 flow. Second operand 3 states and 209 transitions.
[2023-10-26 08:57:49,674 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 20 transitions, 78 flow
[2023-10-26 08:57:49,675 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 78 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:57:49,677 INFO  L231             Difference]: Finished difference. Result has 22 places, 17 transitions, 50 flow
[2023-10-26 08:57:49,678 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=22, PETRI_TRANSITIONS=17}
[2023-10-26 08:57:49,681 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places.
[2023-10-26 08:57:49,681 INFO  L495      AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 50 flow
[2023-10-26 08:57:49,682 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:49,682 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:49,682 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-26 08:57:49,682 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-26 08:57:49,682 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)] ===
[2023-10-26 08:57:49,683 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:49,684 INFO  L85        PathProgramCache]: Analyzing trace with hash -826925151, now seen corresponding path program 1 times
[2023-10-26 08:57:49,684 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:49,685 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362210853]
[2023-10-26 08:57:49,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:49,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:49,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:49,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:57:49,791 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:49,792 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362210853]
[2023-10-26 08:57:49,792 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362210853] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:57:49,793 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:57:49,793 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:57:49,793 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890341896]
[2023-10-26 08:57:49,796 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:57:49,797 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:57:49,797 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:49,798 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:57:49,798 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:57:49,830 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 61 out of 128
[2023-10-26 08:57:49,831 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 50 flow. Second operand  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:49,831 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:49,831 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 128
[2023-10-26 08:57:49,831 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:49,913 INFO  L130       PetriNetUnfolder]: 20/71 cut-off events.
[2023-10-26 08:57:49,913 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:57:49,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 153 conditions, 71 events. 20/71 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 225 event pairs, 13 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 122. Up to 48 conditions per place. 
[2023-10-26 08:57:49,914 INFO  L137   encePairwiseOnDemand]: 124/128 looper letters, 17 selfloop transitions, 3 changer transitions 1/24 dead transitions.
[2023-10-26 08:57:49,915 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 111 flow
[2023-10-26 08:57:49,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:57:49,915 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:57:49,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions.
[2023-10-26 08:57:49,919 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5338541666666666
[2023-10-26 08:57:49,919 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 205 transitions.
[2023-10-26 08:57:49,919 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 205 transitions.
[2023-10-26 08:57:49,920 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:49,920 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 205 transitions.
[2023-10-26 08:57:49,921 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:49,923 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:49,937 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:49,938 INFO  L175             Difference]: Start difference. First operand has 22 places, 17 transitions, 50 flow. Second operand 3 states and 205 transitions.
[2023-10-26 08:57:49,938 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 111 flow
[2023-10-26 08:57:49,938 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 105 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 08:57:49,939 INFO  L231             Difference]: Finished difference. Result has 23 places, 19 transitions, 65 flow
[2023-10-26 08:57:49,939 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=23, PETRI_TRANSITIONS=19}
[2023-10-26 08:57:49,940 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places.
[2023-10-26 08:57:49,940 INFO  L495      AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow
[2023-10-26 08:57:49,941 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:49,941 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:49,941 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-10-26 08:57:49,941 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-26 08:57:49,942 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)] ===
[2023-10-26 08:57:49,942 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:49,942 INFO  L85        PathProgramCache]: Analyzing trace with hash -826926477, now seen corresponding path program 1 times
[2023-10-26 08:57:49,942 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:49,943 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052531415]
[2023-10-26 08:57:49,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:49,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:49,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:57:49,990 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:57:50,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:57:50,044 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:57:50,045 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:57:50,046 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining)
[2023-10-26 08:57:50,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining)
[2023-10-26 08:57:50,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining)
[2023-10-26 08:57:50,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining)
[2023-10-26 08:57:50,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining)
[2023-10-26 08:57:50,050 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-26 08:57:50,054 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-10-26 08:57:50,070 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:57:50,071 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-26 08:57:50,091 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-26 08:57:50,109 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 192 flow
[2023-10-26 08:57:50,145 INFO  L130       PetriNetUnfolder]: 10/173 cut-off events.
[2023-10-26 08:57:50,145 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:57:50,147 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 187 conditions, 173 events. 10/173 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 411 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. 
[2023-10-26 08:57:50,147 INFO  L82        GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 192 flow
[2023-10-26 08:57:50,149 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 88 places, 87 transitions, 192 flow
[2023-10-26 08:57:50,149 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:57:50,150 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 87 transitions, 192 flow
[2023-10-26 08:57:50,150 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 87 transitions, 192 flow
[2023-10-26 08:57:50,150 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 192 flow
[2023-10-26 08:57:50,182 INFO  L130       PetriNetUnfolder]: 10/173 cut-off events.
[2023-10-26 08:57:50,182 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:57:50,183 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 187 conditions, 173 events. 10/173 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 411 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. 
[2023-10-26 08:57:50,186 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2492
[2023-10-26 08:57:51,984 INFO  L134        LiptonReduction]: Checked pairs total: 5801
[2023-10-26 08:57:51,984 INFO  L136        LiptonReduction]: Total number of compositions: 60
[2023-10-26 08:57:51,985 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:57:51,986 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1702d3f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:57:51,986 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2023-10-26 08:57:51,987 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-10-26 08:57:51,987 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:57:51,988 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:51,988 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-26 08:57:51,988 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-10-26 08:57:51,988 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:51,988 INFO  L85        PathProgramCache]: Analyzing trace with hash 422210, now seen corresponding path program 1 times
[2023-10-26 08:57:51,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:51,988 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067253990]
[2023-10-26 08:57:51,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:51,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:52,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:52,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:57:52,063 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:52,063 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067253990]
[2023-10-26 08:57:52,063 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067253990] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:57:52,063 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:57:52,063 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:57:52,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780900571]
[2023-10-26 08:57:52,066 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:57:52,067 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:57:52,067 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:52,068 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:57:52,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:57:52,102 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 78 out of 147
[2023-10-26 08:57:52,103 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 78 flow. Second operand  has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 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)
[2023-10-26 08:57:52,103 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:52,103 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 147
[2023-10-26 08:57:52,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:52,289 INFO  L130       PetriNetUnfolder]: 457/901 cut-off events.
[2023-10-26 08:57:52,297 INFO  L131       PetriNetUnfolder]: For 36/36 co-relation queries the response was YES.
[2023-10-26 08:57:52,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 901 events. 457/901 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4583 event pairs, 205 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 286. Up to 787 conditions per place. 
[2023-10-26 08:57:52,301 INFO  L137   encePairwiseOnDemand]: 143/147 looper letters, 27 selfloop transitions, 2 changer transitions 0/36 dead transitions.
[2023-10-26 08:57:52,302 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 148 flow
[2023-10-26 08:57:52,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:57:52,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:57:52,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions.
[2023-10-26 08:57:52,309 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6009070294784581
[2023-10-26 08:57:52,310 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 265 transitions.
[2023-10-26 08:57:52,310 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions.
[2023-10-26 08:57:52,310 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:52,311 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions.
[2023-10-26 08:57:52,311 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:52,312 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:52,312 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:52,313 INFO  L175             Difference]: Start difference. First operand has 33 places, 30 transitions, 78 flow. Second operand 3 states and 265 transitions.
[2023-10-26 08:57:52,313 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 148 flow
[2023-10-26 08:57:52,314 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:57:52,314 INFO  L231             Difference]: Finished difference. Result has 35 places, 30 transitions, 88 flow
[2023-10-26 08:57:52,314 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=30}
[2023-10-26 08:57:52,315 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places.
[2023-10-26 08:57:52,331 INFO  L495      AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 88 flow
[2023-10-26 08:57:52,332 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 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)
[2023-10-26 08:57:52,332 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:52,332 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:57:52,332 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-26 08:57:52,332 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)] ===
[2023-10-26 08:57:52,333 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:52,333 INFO  L85        PathProgramCache]: Analyzing trace with hash -536914938, now seen corresponding path program 1 times
[2023-10-26 08:57:52,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:52,333 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358000998]
[2023-10-26 08:57:52,333 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:52,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:52,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:52,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:57:52,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:52,381 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358000998]
[2023-10-26 08:57:52,381 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358000998] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:57:52,381 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:57:52,381 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:57:52,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328196551]
[2023-10-26 08:57:52,382 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:57:52,382 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:57:52,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:52,382 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:57:52,383 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:57:52,397 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 74 out of 147
[2023-10-26 08:57:52,397 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 88 flow. Second operand  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:52,397 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:52,398 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 147
[2023-10-26 08:57:52,398 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:52,699 INFO  L130       PetriNetUnfolder]: 595/1131 cut-off events.
[2023-10-26 08:57:52,702 INFO  L131       PetriNetUnfolder]: For 148/148 co-relation queries the response was YES.
[2023-10-26 08:57:52,704 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 1131 events. 595/1131 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6140 event pairs, 379 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 2269. Up to 765 conditions per place. 
[2023-10-26 08:57:52,709 INFO  L137   encePairwiseOnDemand]: 141/147 looper letters, 36 selfloop transitions, 5 changer transitions 0/47 dead transitions.
[2023-10-26 08:57:52,709 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 219 flow
[2023-10-26 08:57:52,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:57:52,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:57:52,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions.
[2023-10-26 08:57:52,711 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5941043083900227
[2023-10-26 08:57:52,711 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 262 transitions.
[2023-10-26 08:57:52,711 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions.
[2023-10-26 08:57:52,711 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:52,711 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions.
[2023-10-26 08:57:52,712 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 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)
[2023-10-26 08:57:52,713 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:52,714 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:52,714 INFO  L175             Difference]: Start difference. First operand has 35 places, 30 transitions, 88 flow. Second operand 3 states and 262 transitions.
[2023-10-26 08:57:52,714 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 219 flow
[2023-10-26 08:57:52,715 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:57:52,716 INFO  L231             Difference]: Finished difference. Result has 38 places, 34 transitions, 124 flow
[2023-10-26 08:57:52,716 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=38, PETRI_TRANSITIONS=34}
[2023-10-26 08:57:52,718 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places.
[2023-10-26 08:57:52,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 124 flow
[2023-10-26 08:57:52,718 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:52,718 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:52,718 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:57:52,719 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-26 08:57:52,719 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)] ===
[2023-10-26 08:57:52,719 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:52,719 INFO  L85        PathProgramCache]: Analyzing trace with hash 421910286, now seen corresponding path program 1 times
[2023-10-26 08:57:52,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:52,720 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660009590]
[2023-10-26 08:57:52,720 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:52,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:52,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:52,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:57:52,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:52,812 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660009590]
[2023-10-26 08:57:52,812 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660009590] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:57:52,812 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:57:52,813 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:57:52,813 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644494764]
[2023-10-26 08:57:52,825 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:57:52,825 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-26 08:57:52,825 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:52,826 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-26 08:57:52,827 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-10-26 08:57:52,865 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 76 out of 147
[2023-10-26 08:57:52,866 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 124 flow. Second operand  has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 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)
[2023-10-26 08:57:52,866 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:52,866 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 147
[2023-10-26 08:57:52,867 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:53,029 INFO  L130       PetriNetUnfolder]: 397/789 cut-off events.
[2023-10-26 08:57:53,030 INFO  L131       PetriNetUnfolder]: For 466/480 co-relation queries the response was YES.
[2023-10-26 08:57:53,031 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 789 events. 397/789 cut-off events. For 466/480 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3804 event pairs, 204 based on Foata normal form. 50/823 useless extension candidates. Maximal degree in co-relation 727. Up to 442 conditions per place. 
[2023-10-26 08:57:53,048 INFO  L137   encePairwiseOnDemand]: 143/147 looper letters, 41 selfloop transitions, 3 changer transitions 0/51 dead transitions.
[2023-10-26 08:57:53,048 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 274 flow
[2023-10-26 08:57:53,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 08:57:53,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 08:57:53,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions.
[2023-10-26 08:57:53,049 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5799319727891157
[2023-10-26 08:57:53,049 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 341 transitions.
[2023-10-26 08:57:53,050 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 341 transitions.
[2023-10-26 08:57:53,050 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:53,056 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 341 transitions.
[2023-10-26 08:57:53,057 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:53,058 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:53,059 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:53,059 INFO  L175             Difference]: Start difference. First operand has 38 places, 34 transitions, 124 flow. Second operand 4 states and 341 transitions.
[2023-10-26 08:57:53,059 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 274 flow
[2023-10-26 08:57:53,063 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 08:57:53,064 INFO  L231             Difference]: Finished difference. Result has 40 places, 35 transitions, 130 flow
[2023-10-26 08:57:53,064 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=40, PETRI_TRANSITIONS=35}
[2023-10-26 08:57:53,067 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places.
[2023-10-26 08:57:53,068 INFO  L495      AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 130 flow
[2023-10-26 08:57:53,068 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 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)
[2023-10-26 08:57:53,068 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:53,068 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-10-26 08:57:53,068 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-26 08:57:53,069 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-10-26 08:57:53,069 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:53,069 INFO  L85        PathProgramCache]: Analyzing trace with hash -1843257085, now seen corresponding path program 1 times
[2023-10-26 08:57:53,069 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:53,069 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351385154]
[2023-10-26 08:57:53,069 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:53,070 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:53,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:57:53,105 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:57:53,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:57:53,138 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:57:53,138 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:57:53,139 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2023-10-26 08:57:53,139 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2023-10-26 08:57:53,142 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2023-10-26 08:57:53,143 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2023-10-26 08:57:53,143 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2023-10-26 08:57:53,143 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2023-10-26 08:57:53,144 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-26 08:57:53,144 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-10-26 08:57:53,145 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:57:53,145 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-26 08:57:53,176 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-26 08:57:53,181 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 105 places, 103 transitions, 236 flow
[2023-10-26 08:57:53,214 INFO  L130       PetriNetUnfolder]: 20/300 cut-off events.
[2023-10-26 08:57:53,224 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-26 08:57:53,225 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 328 conditions, 300 events. 20/300 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 916 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 181. Up to 16 conditions per place. 
[2023-10-26 08:57:53,225 INFO  L82        GeneralOperation]: Start removeDead. Operand has 105 places, 103 transitions, 236 flow
[2023-10-26 08:57:53,242 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 105 places, 103 transitions, 236 flow
[2023-10-26 08:57:53,242 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:57:53,242 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 103 transitions, 236 flow
[2023-10-26 08:57:53,242 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 103 transitions, 236 flow
[2023-10-26 08:57:53,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 105 places, 103 transitions, 236 flow
[2023-10-26 08:57:53,275 INFO  L130       PetriNetUnfolder]: 20/300 cut-off events.
[2023-10-26 08:57:53,276 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-26 08:57:53,276 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 328 conditions, 300 events. 20/300 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 916 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 181. Up to 16 conditions per place. 
[2023-10-26 08:57:53,284 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4452
[2023-10-26 08:57:55,112 INFO  L134        LiptonReduction]: Checked pairs total: 10175
[2023-10-26 08:57:55,113 INFO  L136        LiptonReduction]: Total number of compositions: 69
[2023-10-26 08:57:55,114 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:57:55,114 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1702d3f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:57:55,114 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-10-26 08:57:55,115 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-10-26 08:57:55,116 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:57:55,116 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:55,116 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-26 08:57:55,116 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-26 08:57:55,116 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:55,116 INFO  L85        PathProgramCache]: Analyzing trace with hash 608739, now seen corresponding path program 1 times
[2023-10-26 08:57:55,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:55,116 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196711356]
[2023-10-26 08:57:55,116 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:55,116 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:55,152 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:55,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:57:55,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:55,169 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196711356]
[2023-10-26 08:57:55,169 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196711356] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:57:55,169 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:57:55,169 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:57:55,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145927846]
[2023-10-26 08:57:55,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:57:55,170 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:57:55,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:55,170 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:57:55,170 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:57:55,188 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 172
[2023-10-26 08:57:55,188 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:55,188 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:55,188 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 172
[2023-10-26 08:57:55,189 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:55,847 INFO  L130       PetriNetUnfolder]: 2815/4983 cut-off events.
[2023-10-26 08:57:55,860 INFO  L131       PetriNetUnfolder]: For 394/394 co-relation queries the response was YES.
[2023-10-26 08:57:55,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9510 conditions, 4983 events. 2815/4983 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 32837 event pairs, 1785 based on Foata normal form. 0/4525 useless extension candidates. Maximal degree in co-relation 1298. Up to 4231 conditions per place. 
[2023-10-26 08:57:55,880 INFO  L137   encePairwiseOnDemand]: 168/172 looper letters, 30 selfloop transitions, 2 changer transitions 0/43 dead transitions.
[2023-10-26 08:57:55,901 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 180 flow
[2023-10-26 08:57:55,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:57:55,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:57:55,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions.
[2023-10-26 08:57:55,903 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5891472868217055
[2023-10-26 08:57:55,903 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 304 transitions.
[2023-10-26 08:57:55,903 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions.
[2023-10-26 08:57:55,903 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:55,903 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions.
[2023-10-26 08:57:55,904 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:55,905 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:55,906 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:55,906 INFO  L175             Difference]: Start difference. First operand has 42 places, 38 transitions, 106 flow. Second operand 3 states and 304 transitions.
[2023-10-26 08:57:55,906 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 180 flow
[2023-10-26 08:57:55,907 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:57:55,908 INFO  L231             Difference]: Finished difference. Result has 44 places, 38 transitions, 116 flow
[2023-10-26 08:57:55,908 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=38}
[2023-10-26 08:57:55,919 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2023-10-26 08:57:55,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 116 flow
[2023-10-26 08:57:55,919 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:55,920 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:55,920 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:57:55,920 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-26 08:57:55,920 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)] ===
[2023-10-26 08:57:55,920 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:55,920 INFO  L85        PathProgramCache]: Analyzing trace with hash 238525696, now seen corresponding path program 1 times
[2023-10-26 08:57:55,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:55,921 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046777707]
[2023-10-26 08:57:55,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:55,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:55,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:55,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:57:55,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:55,955 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046777707]
[2023-10-26 08:57:55,955 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046777707] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:57:55,955 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:57:55,955 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:57:55,955 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254571779]
[2023-10-26 08:57:55,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:57:55,956 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:57:55,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:55,956 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:57:55,956 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:57:55,979 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172
[2023-10-26 08:57:55,979 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 116 flow. Second operand  has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:55,979 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:55,979 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172
[2023-10-26 08:57:55,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:57,110 INFO  L130       PetriNetUnfolder]: 6067/9611 cut-off events.
[2023-10-26 08:57:57,124 INFO  L131       PetriNetUnfolder]: For 1266/1266 co-relation queries the response was YES.
[2023-10-26 08:57:57,132 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19591 conditions, 9611 events. 6067/9611 cut-off events. For 1266/1266 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 59756 event pairs, 4931 based on Foata normal form. 0/8786 useless extension candidates. Maximal degree in co-relation 19540. Up to 7918 conditions per place. 
[2023-10-26 08:57:57,203 INFO  L137   encePairwiseOnDemand]: 166/172 looper letters, 49 selfloop transitions, 5 changer transitions 0/61 dead transitions.
[2023-10-26 08:57:57,206 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 295 flow
[2023-10-26 08:57:57,207 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:57:57,207 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:57:57,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions.
[2023-10-26 08:57:57,208 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6085271317829457
[2023-10-26 08:57:57,211 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 314 transitions.
[2023-10-26 08:57:57,211 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions.
[2023-10-26 08:57:57,211 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:57,212 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions.
[2023-10-26 08:57:57,212 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 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)
[2023-10-26 08:57:57,213 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:57,213 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:57,213 INFO  L175             Difference]: Start difference. First operand has 44 places, 38 transitions, 116 flow. Second operand 3 states and 314 transitions.
[2023-10-26 08:57:57,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 295 flow
[2023-10-26 08:57:57,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:57:57,230 INFO  L231             Difference]: Finished difference. Result has 46 places, 42 transitions, 147 flow
[2023-10-26 08:57:57,230 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=46, PETRI_TRANSITIONS=42}
[2023-10-26 08:57:57,231 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2023-10-26 08:57:57,231 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 147 flow
[2023-10-26 08:57:57,232 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:57,232 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:57,232 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:57:57,232 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-26 08:57:57,232 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)] ===
[2023-10-26 08:57:57,232 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:57,233 INFO  L85        PathProgramCache]: Analyzing trace with hash -1336616655, now seen corresponding path program 1 times
[2023-10-26 08:57:57,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:57,233 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614913120]
[2023-10-26 08:57:57,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:57,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:57,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:57,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:57:57,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:57,288 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614913120]
[2023-10-26 08:57:57,290 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614913120] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:57:57,290 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:57:57,290 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:57:57,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911448650]
[2023-10-26 08:57:57,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:57:57,291 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-26 08:57:57,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:57,291 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-26 08:57:57,291 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-10-26 08:57:57,317 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 172
[2023-10-26 08:57:57,318 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 147 flow. Second operand  has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:57,318 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:57,318 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 172
[2023-10-26 08:57:57,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:58,084 INFO  L130       PetriNetUnfolder]: 3162/5514 cut-off events.
[2023-10-26 08:57:58,097 INFO  L131       PetriNetUnfolder]: For 1355/2003 co-relation queries the response was YES.
[2023-10-26 08:57:58,104 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12182 conditions, 5514 events. 3162/5514 cut-off events. For 1355/2003 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 36291 event pairs, 1811 based on Foata normal form. 532/5797 useless extension candidates. Maximal degree in co-relation 4425. Up to 2993 conditions per place. 
[2023-10-26 08:57:58,139 INFO  L137   encePairwiseOnDemand]: 168/172 looper letters, 44 selfloop transitions, 3 changer transitions 0/60 dead transitions.
[2023-10-26 08:57:58,140 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 291 flow
[2023-10-26 08:57:58,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 08:57:58,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 08:57:58,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions.
[2023-10-26 08:57:58,141 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5872093023255814
[2023-10-26 08:57:58,141 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 404 transitions.
[2023-10-26 08:57:58,141 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 404 transitions.
[2023-10-26 08:57:58,142 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:58,142 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 404 transitions.
[2023-10-26 08:57:58,143 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:58,143 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:58,144 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:58,144 INFO  L175             Difference]: Start difference. First operand has 46 places, 42 transitions, 147 flow. Second operand 4 states and 404 transitions.
[2023-10-26 08:57:58,144 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 291 flow
[2023-10-26 08:57:58,147 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:57:58,164 INFO  L231             Difference]: Finished difference. Result has 49 places, 43 transitions, 158 flow
[2023-10-26 08:57:58,164 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=43}
[2023-10-26 08:57:58,166 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places.
[2023-10-26 08:57:58,166 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 158 flow
[2023-10-26 08:57:58,167 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:58,168 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:58,168 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:57:58,168 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-26 08:57:58,168 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-26 08:57:58,168 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:58,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 205097922, now seen corresponding path program 1 times
[2023-10-26 08:57:58,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:58,169 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713545402]
[2023-10-26 08:57:58,169 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:58,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:58,179 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:58,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-26 08:57:58,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:58,211 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713545402]
[2023-10-26 08:57:58,211 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713545402] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:57:58,211 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:57:58,211 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:57:58,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457735457]
[2023-10-26 08:57:58,212 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:57:58,212 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:57:58,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:58,212 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:57:58,212 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:57:58,228 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172
[2023-10-26 08:57:58,229 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 158 flow. Second operand  has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:58,229 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:58,229 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172
[2023-10-26 08:57:58,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:59,540 INFO  L130       PetriNetUnfolder]: 5873/9526 cut-off events.
[2023-10-26 08:57:59,541 INFO  L131       PetriNetUnfolder]: For 4841/4966 co-relation queries the response was YES.
[2023-10-26 08:57:59,549 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22533 conditions, 9526 events. 5873/9526 cut-off events. For 4841/4966 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 60023 event pairs, 3788 based on Foata normal form. 0/9071 useless extension candidates. Maximal degree in co-relation 8932. Up to 6762 conditions per place. 
[2023-10-26 08:57:59,609 INFO  L137   encePairwiseOnDemand]: 165/172 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions.
[2023-10-26 08:57:59,609 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 377 flow
[2023-10-26 08:57:59,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:57:59,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:57:59,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions.
[2023-10-26 08:57:59,611 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6085271317829457
[2023-10-26 08:57:59,611 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 314 transitions.
[2023-10-26 08:57:59,611 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions.
[2023-10-26 08:57:59,611 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:59,611 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions.
[2023-10-26 08:57:59,612 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 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)
[2023-10-26 08:57:59,623 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:59,623 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:59,623 INFO  L175             Difference]: Start difference. First operand has 49 places, 43 transitions, 158 flow. Second operand 3 states and 314 transitions.
[2023-10-26 08:57:59,623 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 377 flow
[2023-10-26 08:57:59,633 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 08:57:59,650 INFO  L231             Difference]: Finished difference. Result has 51 places, 50 transitions, 234 flow
[2023-10-26 08:57:59,651 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=51, PETRI_TRANSITIONS=50}
[2023-10-26 08:57:59,651 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2023-10-26 08:57:59,653 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 234 flow
[2023-10-26 08:57:59,653 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:59,653 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:59,653 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:57:59,653 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-26 08:57:59,653 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)] ===
[2023-10-26 08:57:59,654 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:59,654 INFO  L85        PathProgramCache]: Analyzing trace with hash 778148188, now seen corresponding path program 1 times
[2023-10-26 08:57:59,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:59,656 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526651011]
[2023-10-26 08:57:59,656 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:59,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:59,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:59,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:57:59,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:59,757 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526651011]
[2023-10-26 08:57:59,757 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526651011] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:57:59,758 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:57:59,758 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:57:59,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666509605]
[2023-10-26 08:57:59,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:57:59,758 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:57:59,773 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:59,773 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:57:59,773 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:57:59,787 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 172
[2023-10-26 08:57:59,788 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 234 flow. Second operand  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:59,788 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:59,788 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 172
[2023-10-26 08:57:59,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:00,027 INFO  L130       PetriNetUnfolder]: 663/1671 cut-off events.
[2023-10-26 08:58:00,028 INFO  L131       PetriNetUnfolder]: For 1269/1279 co-relation queries the response was YES.
[2023-10-26 08:58:00,029 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 1671 events. 663/1671 cut-off events. For 1269/1279 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11341 event pairs, 162 based on Foata normal form. 312/1943 useless extension candidates. Maximal degree in co-relation 1621. Up to 1001 conditions per place. 
[2023-10-26 08:58:00,049 INFO  L137   encePairwiseOnDemand]: 166/172 looper letters, 40 selfloop transitions, 7 changer transitions 0/58 dead transitions.
[2023-10-26 08:58:00,049 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 347 flow
[2023-10-26 08:58:00,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:58:00,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:58:00,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions.
[2023-10-26 08:58:00,051 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5910852713178295
[2023-10-26 08:58:00,051 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 305 transitions.
[2023-10-26 08:58:00,051 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions.
[2023-10-26 08:58:00,051 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:00,051 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions.
[2023-10-26 08:58:00,052 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:00,053 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:00,053 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:00,053 INFO  L175             Difference]: Start difference. First operand has 51 places, 50 transitions, 234 flow. Second operand 3 states and 305 transitions.
[2023-10-26 08:58:00,053 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 347 flow
[2023-10-26 08:58:00,056 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 335 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-10-26 08:58:00,057 INFO  L231             Difference]: Finished difference. Result has 51 places, 44 transitions, 188 flow
[2023-10-26 08:58:00,057 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=51, PETRI_TRANSITIONS=44}
[2023-10-26 08:58:00,058 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2023-10-26 08:58:00,058 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 188 flow
[2023-10-26 08:58:00,058 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:00,059 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:00,059 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-10-26 08:58:00,059 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-26 08:58:00,059 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 4 more)] ===
[2023-10-26 08:58:00,059 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:00,059 INFO  L85        PathProgramCache]: Analyzing trace with hash -1624936462, now seen corresponding path program 1 times
[2023-10-26 08:58:00,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:00,060 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682880876]
[2023-10-26 08:58:00,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:00,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:00,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:58:00,080 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:58:00,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:58:00,109 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:58:00,109 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:58:00,110 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-10-26 08:58:00,110 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-10-26 08:58:00,110 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-10-26 08:58:00,110 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-10-26 08:58:00,110 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-10-26 08:58:00,110 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-10-26 08:58:00,111 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-10-26 08:58:00,111 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-26 08:58:00,111 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:00,111 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:58:00,111 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-10-26 08:58:00,160 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-10-26 08:58:00,163 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 122 places, 119 transitions, 282 flow
[2023-10-26 08:58:00,209 INFO  L130       PetriNetUnfolder]: 42/531 cut-off events.
[2023-10-26 08:58:00,223 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-10-26 08:58:00,225 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 586 conditions, 531 events. 42/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2085 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 320. Up to 32 conditions per place. 
[2023-10-26 08:58:00,225 INFO  L82        GeneralOperation]: Start removeDead. Operand has 122 places, 119 transitions, 282 flow
[2023-10-26 08:58:00,226 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 122 places, 119 transitions, 282 flow
[2023-10-26 08:58:00,226 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:58:00,226 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 119 transitions, 282 flow
[2023-10-26 08:58:00,227 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 119 transitions, 282 flow
[2023-10-26 08:58:00,227 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 122 places, 119 transitions, 282 flow
[2023-10-26 08:58:00,282 INFO  L130       PetriNetUnfolder]: 42/531 cut-off events.
[2023-10-26 08:58:00,297 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-10-26 08:58:00,298 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 586 conditions, 531 events. 42/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2085 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 320. Up to 32 conditions per place. 
[2023-10-26 08:58:00,306 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6888
[2023-10-26 08:58:02,253 INFO  L134        LiptonReduction]: Checked pairs total: 17351
[2023-10-26 08:58:02,253 INFO  L136        LiptonReduction]: Total number of compositions: 76
[2023-10-26 08:58:02,254 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:58:02,255 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1702d3f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:58:02,255 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-26 08:58:02,256 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-10-26 08:58:02,256 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:58:02,256 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:02,256 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-26 08:58:02,256 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-26 08:58:02,256 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:02,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 818201, now seen corresponding path program 1 times
[2023-10-26 08:58:02,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:02,256 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912229227]
[2023-10-26 08:58:02,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:02,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:02,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:02,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:58:02,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:02,313 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912229227]
[2023-10-26 08:58:02,313 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912229227] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:58:02,313 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:58:02,313 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:58:02,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277954780]
[2023-10-26 08:58:02,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:58:02,314 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:58:02,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:02,314 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:58:02,314 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:58:02,327 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 195
[2023-10-26 08:58:02,328 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 136 flow. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:02,328 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:02,328 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 195
[2023-10-26 08:58:02,328 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:05,841 INFO  L130       PetriNetUnfolder]: 26018/38924 cut-off events.
[2023-10-26 08:58:05,841 INFO  L131       PetriNetUnfolder]: For 3846/3846 co-relation queries the response was YES.
[2023-10-26 08:58:05,896 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76589 conditions, 38924 events. 26018/38924 cut-off events. For 3846/3846 co-relation queries the response was YES. Maximal size of possible extension queue 1210. Compared 273684 event pairs, 19152 based on Foata normal form. 0/35999 useless extension candidates. Maximal degree in co-relation 10917. Up to 35539 conditions per place. 
[2023-10-26 08:58:06,170 INFO  L137   encePairwiseOnDemand]: 191/195 looper letters, 37 selfloop transitions, 2 changer transitions 0/51 dead transitions.
[2023-10-26 08:58:06,185 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 224 flow
[2023-10-26 08:58:06,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:58:06,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:58:06,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions.
[2023-10-26 08:58:06,187 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6136752136752137
[2023-10-26 08:58:06,187 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 359 transitions.
[2023-10-26 08:58:06,187 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions.
[2023-10-26 08:58:06,187 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:06,187 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions.
[2023-10-26 08:58:06,188 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:06,189 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:06,189 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:06,189 INFO  L175             Difference]: Start difference. First operand has 51 places, 46 transitions, 136 flow. Second operand 3 states and 359 transitions.
[2023-10-26 08:58:06,189 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 224 flow
[2023-10-26 08:58:06,190 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:58:06,191 INFO  L231             Difference]: Finished difference. Result has 53 places, 46 transitions, 146 flow
[2023-10-26 08:58:06,191 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=46}
[2023-10-26 08:58:06,192 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places.
[2023-10-26 08:58:06,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 146 flow
[2023-10-26 08:58:06,192 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:06,192 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:06,192 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:06,193 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-26 08:58:06,193 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)] ===
[2023-10-26 08:58:06,193 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:06,193 INFO  L85        PathProgramCache]: Analyzing trace with hash 461890703, now seen corresponding path program 1 times
[2023-10-26 08:58:06,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:06,193 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881605930]
[2023-10-26 08:58:06,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:06,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:06,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:06,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:58:06,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:06,224 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881605930]
[2023-10-26 08:58:06,224 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881605930] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:58:06,224 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:58:06,224 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:58:06,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615731575]
[2023-10-26 08:58:06,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:58:06,225 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:58:06,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:06,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:58:06,225 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:58:06,256 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 195
[2023-10-26 08:58:06,257 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 146 flow. Second operand  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:06,257 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:06,257 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 195
[2023-10-26 08:58:06,257 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:13,419 INFO  L130       PetriNetUnfolder]: 63239/89865 cut-off events.
[2023-10-26 08:58:13,420 INFO  L131       PetriNetUnfolder]: For 12171/12171 co-relation queries the response was YES.
[2023-10-26 08:58:13,571 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 183282 conditions, 89865 events. 63239/89865 cut-off events. For 12171/12171 co-relation queries the response was YES. Maximal size of possible extension queue 2435. Compared 619750 event pairs, 44385 based on Foata normal form. 0/83611 useless extension candidates. Maximal degree in co-relation 183230. Up to 66785 conditions per place. 
[2023-10-26 08:58:14,081 INFO  L137   encePairwiseOnDemand]: 187/195 looper letters, 62 selfloop transitions, 7 changer transitions 0/77 dead transitions.
[2023-10-26 08:58:14,092 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 383 flow
[2023-10-26 08:58:14,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:58:14,093 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:58:14,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions.
[2023-10-26 08:58:14,095 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.629059829059829
[2023-10-26 08:58:14,095 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 368 transitions.
[2023-10-26 08:58:14,095 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions.
[2023-10-26 08:58:14,095 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:14,095 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions.
[2023-10-26 08:58:14,096 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:14,097 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:14,098 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:14,098 INFO  L175             Difference]: Start difference. First operand has 53 places, 46 transitions, 146 flow. Second operand 3 states and 368 transitions.
[2023-10-26 08:58:14,098 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 383 flow
[2023-10-26 08:58:14,104 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:58:14,107 INFO  L231             Difference]: Finished difference. Result has 56 places, 52 transitions, 198 flow
[2023-10-26 08:58:14,107 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=56, PETRI_TRANSITIONS=52}
[2023-10-26 08:58:14,107 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places.
[2023-10-26 08:58:14,107 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 198 flow
[2023-10-26 08:58:14,108 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:14,108 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:14,108 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:14,108 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-26 08:58:14,119 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)] ===
[2023-10-26 08:58:14,120 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:14,120 INFO  L85        PathProgramCache]: Analyzing trace with hash 1277334436, now seen corresponding path program 1 times
[2023-10-26 08:58:14,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:14,120 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467591634]
[2023-10-26 08:58:14,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:14,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:14,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:14,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:58:14,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:14,167 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467591634]
[2023-10-26 08:58:14,167 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467591634] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:58:14,167 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:58:14,168 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:58:14,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366601910]
[2023-10-26 08:58:14,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:58:14,170 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-26 08:58:14,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:14,170 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-26 08:58:14,170 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-10-26 08:58:14,200 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 195
[2023-10-26 08:58:14,201 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 198 flow. Second operand  has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:14,201 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:14,201 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 195
[2023-10-26 08:58:14,201 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:18,212 INFO  L130       PetriNetUnfolder]: 38334/57310 cut-off events.
[2023-10-26 08:58:18,213 INFO  L131       PetriNetUnfolder]: For 24745/30975 co-relation queries the response was YES.
[2023-10-26 08:58:18,307 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 133333 conditions, 57310 events. 38334/57310 cut-off events. For 24745/30975 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 426467 event pairs, 21787 based on Foata normal form. 3440/57900 useless extension candidates. Maximal degree in co-relation 40685. Up to 34292 conditions per place. 
[2023-10-26 08:58:18,478 INFO  L137   encePairwiseOnDemand]: 191/195 looper letters, 61 selfloop transitions, 3 changer transitions 0/78 dead transitions.
[2023-10-26 08:58:18,478 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 408 flow
[2023-10-26 08:58:18,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 08:58:18,479 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 08:58:18,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions.
[2023-10-26 08:58:18,480 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6064102564102564
[2023-10-26 08:58:18,480 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 473 transitions.
[2023-10-26 08:58:18,480 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions.
[2023-10-26 08:58:18,481 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:18,481 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions.
[2023-10-26 08:58:18,482 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:18,497 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:18,499 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:18,499 INFO  L175             Difference]: Start difference. First operand has 56 places, 52 transitions, 198 flow. Second operand 4 states and 473 transitions.
[2023-10-26 08:58:18,499 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 408 flow
[2023-10-26 08:58:18,626 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 08:58:18,628 INFO  L231             Difference]: Finished difference. Result has 58 places, 53 transitions, 200 flow
[2023-10-26 08:58:18,628 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=58, PETRI_TRANSITIONS=53}
[2023-10-26 08:58:18,629 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places.
[2023-10-26 08:58:18,629 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 200 flow
[2023-10-26 08:58:18,630 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:18,630 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:18,630 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:18,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-10-26 08:58:18,644 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-26 08:58:18,644 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:18,645 INFO  L85        PathProgramCache]: Analyzing trace with hash 422619653, now seen corresponding path program 1 times
[2023-10-26 08:58:18,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:18,645 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731315129]
[2023-10-26 08:58:18,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:18,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:18,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:18,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-26 08:58:18,694 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:18,694 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731315129]
[2023-10-26 08:58:18,695 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731315129] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:58:18,695 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:58:18,695 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:58:18,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107915928]
[2023-10-26 08:58:18,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:58:18,696 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:58:18,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:18,696 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:58:18,696 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:58:18,711 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 195
[2023-10-26 08:58:18,712 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 200 flow. Second operand  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:18,712 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:18,712 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 195
[2023-10-26 08:58:18,712 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:26,306 INFO  L130       PetriNetUnfolder]: 61761/89630 cut-off events.
[2023-10-26 08:58:26,306 INFO  L131       PetriNetUnfolder]: For 43426/44605 co-relation queries the response was YES.
[2023-10-26 08:58:26,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 214372 conditions, 89630 events. 61761/89630 cut-off events. For 43426/44605 co-relation queries the response was YES. Maximal size of possible extension queue 2204. Compared 635112 event pairs, 46546 based on Foata normal form. 0/85570 useless extension candidates. Maximal degree in co-relation 77115. Up to 75594 conditions per place. 
[2023-10-26 08:58:26,783 INFO  L137   encePairwiseOnDemand]: 188/195 looper letters, 68 selfloop transitions, 10 changer transitions 0/86 dead transitions.
[2023-10-26 08:58:26,784 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 483 flow
[2023-10-26 08:58:26,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:58:26,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:58:26,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions.
[2023-10-26 08:58:26,785 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6256410256410256
[2023-10-26 08:58:26,785 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 366 transitions.
[2023-10-26 08:58:26,786 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions.
[2023-10-26 08:58:26,786 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:26,786 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions.
[2023-10-26 08:58:26,787 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:26,788 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:26,788 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:26,788 INFO  L175             Difference]: Start difference. First operand has 58 places, 53 transitions, 200 flow. Second operand 3 states and 366 transitions.
[2023-10-26 08:58:26,788 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 483 flow
[2023-10-26 08:58:27,091 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 08:58:27,092 INFO  L231             Difference]: Finished difference. Result has 59 places, 61 transitions, 278 flow
[2023-10-26 08:58:27,092 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=59, PETRI_TRANSITIONS=61}
[2023-10-26 08:58:27,093 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places.
[2023-10-26 08:58:27,093 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 278 flow
[2023-10-26 08:58:27,093 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:27,093 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:27,093 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:27,094 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-10-26 08:58:27,094 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)] ===
[2023-10-26 08:58:27,094 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:27,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345369614, now seen corresponding path program 1 times
[2023-10-26 08:58:27,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:27,094 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113992133]
[2023-10-26 08:58:27,094 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:27,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:27,119 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:27,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:58:27,188 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:27,189 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113992133]
[2023-10-26 08:58:27,189 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113992133] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:58:27,189 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:58:27,189 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:58:27,189 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364249168]
[2023-10-26 08:58:27,189 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:58:27,189 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:58:27,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:27,190 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:58:27,190 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:58:27,205 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 195
[2023-10-26 08:58:27,221 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 278 flow. Second operand  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:27,221 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:27,221 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 195
[2023-10-26 08:58:27,222 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:27,706 INFO  L130       PetriNetUnfolder]: 2892/6733 cut-off events.
[2023-10-26 08:58:27,706 INFO  L131       PetriNetUnfolder]: For 5552/5590 co-relation queries the response was YES.
[2023-10-26 08:58:27,715 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17320 conditions, 6733 events. 2892/6733 cut-off events. For 5552/5590 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 57260 event pairs, 659 based on Foata normal form. 2073/8642 useless extension candidates. Maximal degree in co-relation 6273. Up to 4336 conditions per place. 
[2023-10-26 08:58:27,727 INFO  L137   encePairwiseOnDemand]: 187/195 looper letters, 47 selfloop transitions, 9 changer transitions 0/68 dead transitions.
[2023-10-26 08:58:27,727 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 410 flow
[2023-10-26 08:58:27,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:58:27,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:58:27,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions.
[2023-10-26 08:58:27,729 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6
[2023-10-26 08:58:27,729 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 351 transitions.
[2023-10-26 08:58:27,729 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions.
[2023-10-26 08:58:27,729 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:27,729 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions.
[2023-10-26 08:58:27,732 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:27,733 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:27,734 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:27,734 INFO  L175             Difference]: Start difference. First operand has 59 places, 61 transitions, 278 flow. Second operand 3 states and 351 transitions.
[2023-10-26 08:58:27,734 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 410 flow
[2023-10-26 08:58:27,745 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 403 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-26 08:58:27,762 INFO  L231             Difference]: Finished difference. Result has 60 places, 52 transitions, 226 flow
[2023-10-26 08:58:27,763 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=60, PETRI_TRANSITIONS=52}
[2023-10-26 08:58:27,763 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places.
[2023-10-26 08:58:27,763 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 226 flow
[2023-10-26 08:58:27,763 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:27,764 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:27,764 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:27,764 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-10-26 08:58:27,764 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)] ===
[2023-10-26 08:58:27,764 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:27,764 INFO  L85        PathProgramCache]: Analyzing trace with hash 1727818670, now seen corresponding path program 1 times
[2023-10-26 08:58:27,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:27,765 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966352379]
[2023-10-26 08:58:27,765 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:27,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:27,773 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:27,818 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-26 08:58:27,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:27,818 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966352379]
[2023-10-26 08:58:27,819 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966352379] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:58:27,819 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:58:27,819 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:58:27,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769470441]
[2023-10-26 08:58:27,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:58:27,819 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:58:27,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:27,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:58:27,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:58:27,838 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 195
[2023-10-26 08:58:27,838 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 226 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)
[2023-10-26 08:58:27,838 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:27,838 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 195
[2023-10-26 08:58:27,838 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:28,412 INFO  L130       PetriNetUnfolder]: 3391/7796 cut-off events.
[2023-10-26 08:58:28,412 INFO  L131       PetriNetUnfolder]: For 6336/6374 co-relation queries the response was YES.
[2023-10-26 08:58:28,422 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20996 conditions, 7796 events. 3391/7796 cut-off events. For 6336/6374 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 65692 event pairs, 3007 based on Foata normal form. 0/7409 useless extension candidates. Maximal degree in co-relation 5279. Up to 6329 conditions per place. 
[2023-10-26 08:58:28,435 INFO  L137   encePairwiseOnDemand]: 191/195 looper letters, 54 selfloop transitions, 3 changer transitions 0/65 dead transitions.
[2023-10-26 08:58:28,436 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 400 flow
[2023-10-26 08:58:28,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:58:28,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:58:28,437 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions.
[2023-10-26 08:58:28,437 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5982905982905983
[2023-10-26 08:58:28,437 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 350 transitions.
[2023-10-26 08:58:28,437 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions.
[2023-10-26 08:58:28,437 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:28,438 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions.
[2023-10-26 08:58:28,438 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 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)
[2023-10-26 08:58:28,439 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:28,439 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:28,439 INFO  L175             Difference]: Start difference. First operand has 60 places, 52 transitions, 226 flow. Second operand 3 states and 350 transitions.
[2023-10-26 08:58:28,439 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 400 flow
[2023-10-26 08:58:28,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:58:28,463 INFO  L231             Difference]: Finished difference. Result has 62 places, 54 transitions, 242 flow
[2023-10-26 08:58:28,463 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=62, PETRI_TRANSITIONS=54}
[2023-10-26 08:58:28,468 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places.
[2023-10-26 08:58:28,469 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 242 flow
[2023-10-26 08:58:28,469 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)
[2023-10-26 08:58:28,469 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:28,469 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:28,469 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-10-26 08:58:28,470 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-26 08:58:28,470 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:28,470 INFO  L85        PathProgramCache]: Analyzing trace with hash 948274906, now seen corresponding path program 1 times
[2023-10-26 08:58:28,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:28,470 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921887202]
[2023-10-26 08:58:28,470 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:28,471 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:28,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:28,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-26 08:58:28,524 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:28,524 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921887202]
[2023-10-26 08:58:28,524 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921887202] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:58:28,525 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:58:28,525 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:58:28,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550807257]
[2023-10-26 08:58:28,525 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:58:28,526 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:58:28,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:28,526 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:58:28,526 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:58:28,546 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 195
[2023-10-26 08:58:28,547 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 242 flow. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:28,547 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:28,547 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 195
[2023-10-26 08:58:28,547 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:29,167 INFO  L130       PetriNetUnfolder]: 4657/10054 cut-off events.
[2023-10-26 08:58:29,167 INFO  L131       PetriNetUnfolder]: For 8934/8991 co-relation queries the response was YES.
[2023-10-26 08:58:29,181 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27767 conditions, 10054 events. 4657/10054 cut-off events. For 8934/8991 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 83633 event pairs, 2809 based on Foata normal form. 0/9753 useless extension candidates. Maximal degree in co-relation 9817. Up to 6857 conditions per place. 
[2023-10-26 08:58:29,197 INFO  L137   encePairwiseOnDemand]: 188/195 looper letters, 60 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2023-10-26 08:58:29,197 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 460 flow
[2023-10-26 08:58:29,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:58:29,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:58:29,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2023-10-26 08:58:29,212 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6273504273504273
[2023-10-26 08:58:29,213 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2023-10-26 08:58:29,213 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2023-10-26 08:58:29,213 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:29,213 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2023-10-26 08:58:29,214 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:29,220 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:29,220 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:29,220 INFO  L175             Difference]: Start difference. First operand has 62 places, 54 transitions, 242 flow. Second operand 3 states and 367 transitions.
[2023-10-26 08:58:29,220 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 460 flow
[2023-10-26 08:58:29,241 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 451 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-26 08:58:29,242 INFO  L231             Difference]: Finished difference. Result has 65 places, 59 transitions, 311 flow
[2023-10-26 08:58:29,242 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=59}
[2023-10-26 08:58:29,243 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places.
[2023-10-26 08:58:29,243 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 311 flow
[2023-10-26 08:58:29,243 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:29,243 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:29,243 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:29,243 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-26 08:58:29,243 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 5 more)] ===
[2023-10-26 08:58:29,244 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:29,244 INFO  L85        PathProgramCache]: Analyzing trace with hash 441686513, now seen corresponding path program 1 times
[2023-10-26 08:58:29,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:29,244 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074318944]
[2023-10-26 08:58:29,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:29,244 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:29,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:29,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:58:29,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:29,371 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074318944]
[2023-10-26 08:58:29,371 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074318944] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:58:29,371 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801703820]
[2023-10-26 08:58:29,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:29,372 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:58:29,372 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:58:29,396 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:58:29,436 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-26 08:58:29,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:29,536 INFO  L263         TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-10-26 08:58:29,547 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:58:29,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:58:29,816 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:58:29,816 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [801703820] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:58:29,825 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-26 08:58:29,825 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11
[2023-10-26 08:58:29,825 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444902570]
[2023-10-26 08:58:29,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:58:29,826 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-10-26 08:58:29,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:29,826 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-10-26 08:58:29,826 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132
[2023-10-26 08:58:29,867 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 195
[2023-10-26 08:58:29,867 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 311 flow. Second operand  has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:29,867 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:29,881 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 195
[2023-10-26 08:58:29,881 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:30,865 INFO  L130       PetriNetUnfolder]: 3751/9031 cut-off events.
[2023-10-26 08:58:30,865 INFO  L131       PetriNetUnfolder]: For 9473/10229 co-relation queries the response was YES.
[2023-10-26 08:58:30,890 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25852 conditions, 9031 events. 3751/9031 cut-off events. For 9473/10229 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 80588 event pairs, 496 based on Foata normal form. 556/9451 useless extension candidates. Maximal degree in co-relation 11816. Up to 5598 conditions per place. 
[2023-10-26 08:58:30,900 INFO  L137   encePairwiseOnDemand]: 192/195 looper letters, 109 selfloop transitions, 5 changer transitions 10/139 dead transitions.
[2023-10-26 08:58:30,900 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 139 transitions, 899 flow
[2023-10-26 08:58:30,901 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-26 08:58:30,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-26 08:58:30,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions.
[2023-10-26 08:58:30,902 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6131868131868132
[2023-10-26 08:58:30,902 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 837 transitions.
[2023-10-26 08:58:30,902 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions.
[2023-10-26 08:58:30,903 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:30,903 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions.
[2023-10-26 08:58:30,904 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:30,926 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:30,926 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:30,926 INFO  L175             Difference]: Start difference. First operand has 65 places, 59 transitions, 311 flow. Second operand 7 states and 837 transitions.
[2023-10-26 08:58:30,927 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 139 transitions, 899 flow
[2023-10-26 08:58:30,959 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 139 transitions, 861 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-10-26 08:58:30,960 INFO  L231             Difference]: Finished difference. Result has 67 places, 60 transitions, 300 flow
[2023-10-26 08:58:30,961 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=67, PETRI_TRANSITIONS=60}
[2023-10-26 08:58:30,962 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places.
[2023-10-26 08:58:30,962 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 300 flow
[2023-10-26 08:58:30,962 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:30,962 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:30,963 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:30,978 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-26 08:58:31,167 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-10-26 08:58:31,167 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)] ===
[2023-10-26 08:58:31,168 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:31,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 446996961, now seen corresponding path program 1 times
[2023-10-26 08:58:31,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:31,168 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123816434]
[2023-10-26 08:58:31,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:31,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:31,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:31,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2023-10-26 08:58:31,208 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:31,208 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123816434]
[2023-10-26 08:58:31,208 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123816434] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:58:31,208 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:58:31,208 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:58:31,209 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840592272]
[2023-10-26 08:58:31,209 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:58:31,210 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:58:31,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:31,210 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:58:31,211 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:58:31,228 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 195
[2023-10-26 08:58:31,229 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:31,229 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:31,229 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 195
[2023-10-26 08:58:31,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:32,022 INFO  L130       PetriNetUnfolder]: 4370/10023 cut-off events.
[2023-10-26 08:58:32,023 INFO  L131       PetriNetUnfolder]: For 12467/12545 co-relation queries the response was YES.
[2023-10-26 08:58:32,037 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29616 conditions, 10023 events. 4370/10023 cut-off events. For 12467/12545 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 88390 event pairs, 3427 based on Foata normal form. 0/9748 useless extension candidates. Maximal degree in co-relation 6410. Up to 8591 conditions per place. 
[2023-10-26 08:58:32,050 INFO  L137   encePairwiseOnDemand]: 191/195 looper letters, 58 selfloop transitions, 4 changer transitions 1/71 dead transitions.
[2023-10-26 08:58:32,050 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 480 flow
[2023-10-26 08:58:32,051 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:58:32,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:58:32,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions.
[2023-10-26 08:58:32,052 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5948717948717949
[2023-10-26 08:58:32,052 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 348 transitions.
[2023-10-26 08:58:32,052 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions.
[2023-10-26 08:58:32,053 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:32,053 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions.
[2023-10-26 08:58:32,053 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:32,055 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:32,055 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:32,055 INFO  L175             Difference]: Start difference. First operand has 67 places, 60 transitions, 300 flow. Second operand 3 states and 348 transitions.
[2023-10-26 08:58:32,055 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 480 flow
[2023-10-26 08:58:32,066 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 08:58:32,067 INFO  L231             Difference]: Finished difference. Result has 68 places, 62 transitions, 329 flow
[2023-10-26 08:58:32,067 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=68, PETRI_TRANSITIONS=62}
[2023-10-26 08:58:32,067 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places.
[2023-10-26 08:58:32,077 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 329 flow
[2023-10-26 08:58:32,077 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:32,077 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:32,077 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:32,078 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-26 08:58:32,078 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-26 08:58:32,078 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:32,078 INFO  L85        PathProgramCache]: Analyzing trace with hash -1700190220, now seen corresponding path program 1 times
[2023-10-26 08:58:32,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:32,078 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875798793]
[2023-10-26 08:58:32,078 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:32,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:32,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:32,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:58:32,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:32,198 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875798793]
[2023-10-26 08:58:32,198 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875798793] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:58:32,198 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512019348]
[2023-10-26 08:58:32,199 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:32,199 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:58:32,199 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:58:32,201 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:58:32,249 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-26 08:58:32,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:32,337 INFO  L263         TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-10-26 08:58:32,338 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:58:32,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:58:32,453 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:58:32,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:58:32,509 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [512019348] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:58:32,509 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:58:32,509 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2023-10-26 08:58:32,511 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912141191]
[2023-10-26 08:58:32,511 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:58:32,512 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-26 08:58:32,512 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:32,512 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-26 08:58:32,512 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72
[2023-10-26 08:58:32,559 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 195
[2023-10-26 08:58:32,560 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 329 flow. Second operand  has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:32,560 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:32,560 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 195
[2023-10-26 08:58:32,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:33,182 INFO  L130       PetriNetUnfolder]: 3198/7514 cut-off events.
[2023-10-26 08:58:33,182 INFO  L131       PetriNetUnfolder]: For 9553/10123 co-relation queries the response was YES.
[2023-10-26 08:58:33,194 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21885 conditions, 7514 events. 3198/7514 cut-off events. For 9553/10123 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 64512 event pairs, 427 based on Foata normal form. 369/7645 useless extension candidates. Maximal degree in co-relation 7441. Up to 5705 conditions per place. 
[2023-10-26 08:58:33,204 INFO  L137   encePairwiseOnDemand]: 192/195 looper letters, 86 selfloop transitions, 5 changer transitions 0/106 dead transitions.
[2023-10-26 08:58:33,204 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 663 flow
[2023-10-26 08:58:33,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:58:33,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:58:33,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 701 transitions.
[2023-10-26 08:58:33,214 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5991452991452991
[2023-10-26 08:58:33,214 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 701 transitions.
[2023-10-26 08:58:33,214 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 701 transitions.
[2023-10-26 08:58:33,215 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:33,215 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 701 transitions.
[2023-10-26 08:58:33,223 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:33,228 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:33,228 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:33,228 INFO  L175             Difference]: Start difference. First operand has 68 places, 62 transitions, 329 flow. Second operand 6 states and 701 transitions.
[2023-10-26 08:58:33,228 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 663 flow
[2023-10-26 08:58:33,240 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 106 transitions, 645 flow, removed 6 selfloop flow, removed 1 redundant places.
[2023-10-26 08:58:33,242 INFO  L231             Difference]: Finished difference. Result has 75 places, 62 transitions, 335 flow
[2023-10-26 08:58:33,242 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=75, PETRI_TRANSITIONS=62}
[2023-10-26 08:58:33,242 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places.
[2023-10-26 08:58:33,242 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 335 flow
[2023-10-26 08:58:33,247 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:33,247 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:33,247 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:33,253 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-26 08:58:33,452 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:58:33,452 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-26 08:58:33,453 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:33,453 INFO  L85        PathProgramCache]: Analyzing trace with hash 1531619191, now seen corresponding path program 1 times
[2023-10-26 08:58:33,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:33,454 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923068572]
[2023-10-26 08:58:33,454 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:33,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:33,515 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:33,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2023-10-26 08:58:33,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:33,602 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923068572]
[2023-10-26 08:58:33,603 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923068572] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:58:33,603 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200252105]
[2023-10-26 08:58:33,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:33,603 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:58:33,603 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:58:33,618 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:58:33,671 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-26 08:58:33,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:33,763 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-26 08:58:33,765 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:58:33,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2023-10-26 08:58:33,846 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:58:33,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2023-10-26 08:58:33,914 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200252105] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:58:33,914 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:58:33,915 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2023-10-26 08:58:33,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081325018]
[2023-10-26 08:58:33,915 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:58:33,916 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-26 08:58:33,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:33,924 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-26 08:58:33,925 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72
[2023-10-26 08:58:34,037 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 195
[2023-10-26 08:58:34,038 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 335 flow. Second operand  has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:34,038 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:34,038 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 195
[2023-10-26 08:58:34,038 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:34,580 INFO  L130       PetriNetUnfolder]: 1799/3965 cut-off events.
[2023-10-26 08:58:34,580 INFO  L131       PetriNetUnfolder]: For 8622/9063 co-relation queries the response was YES.
[2023-10-26 08:58:34,587 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11391 conditions, 3965 events. 1799/3965 cut-off events. For 8622/9063 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 27205 event pairs, 407 based on Foata normal form. 591/4544 useless extension candidates. Maximal degree in co-relation 4865. Up to 1090 conditions per place. 
[2023-10-26 08:58:34,593 INFO  L137   encePairwiseOnDemand]: 190/195 looper letters, 99 selfloop transitions, 5 changer transitions 7/125 dead transitions.
[2023-10-26 08:58:34,593 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 125 transitions, 781 flow
[2023-10-26 08:58:34,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:58:34,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:58:34,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions.
[2023-10-26 08:58:34,595 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6128205128205129
[2023-10-26 08:58:34,595 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 717 transitions.
[2023-10-26 08:58:34,595 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions.
[2023-10-26 08:58:34,596 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:34,596 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions.
[2023-10-26 08:58:34,597 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:34,600 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:34,618 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:34,618 INFO  L175             Difference]: Start difference. First operand has 75 places, 62 transitions, 335 flow. Second operand 6 states and 717 transitions.
[2023-10-26 08:58:34,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 125 transitions, 781 flow
[2023-10-26 08:58:34,624 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 125 transitions, 771 flow, removed 0 selfloop flow, removed 5 redundant places.
[2023-10-26 08:58:34,625 INFO  L231             Difference]: Finished difference. Result has 78 places, 57 transitions, 343 flow
[2023-10-26 08:58:34,641 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=78, PETRI_TRANSITIONS=57}
[2023-10-26 08:58:34,642 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places.
[2023-10-26 08:58:34,642 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 343 flow
[2023-10-26 08:58:34,642 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:34,642 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:34,642 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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]
[2023-10-26 08:58:34,648 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-10-26 08:58:34,846 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2023-10-26 08:58:34,847 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-26 08:58:34,847 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:34,847 INFO  L85        PathProgramCache]: Analyzing trace with hash 577691794, now seen corresponding path program 1 times
[2023-10-26 08:58:34,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:34,848 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83409970]
[2023-10-26 08:58:34,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:34,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:34,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:58:34,936 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:58:34,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:58:35,007 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:58:35,021 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:58:35,021 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining)
[2023-10-26 08:58:35,022 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-10-26 08:58:35,022 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2023-10-26 08:58:35,022 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2023-10-26 08:58:35,022 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-10-26 08:58:35,022 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-10-26 08:58:35,022 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-10-26 08:58:35,022 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-10-26 08:58:35,023 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-10-26 08:58:35,023 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:35,026 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances
[2023-10-26 08:58:35,026 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-10-26 08:58:35,144 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:58:35 BasicIcfg
[2023-10-26 08:58:35,145 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-10-26 08:58:35,145 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-10-26 08:58:35,145 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-10-26 08:58:35,145 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-10-26 08:58:35,147 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:57:46" (3/4) ...
[2023-10-26 08:58:35,149 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-10-26 08:58:35,149 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-10-26 08:58:35,150 INFO  L158              Benchmark]: Toolchain (without parser) took 50267.76ms. Allocated memory was 44.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 14.6MB in the beginning and 515.5MB in the end (delta: -500.9MB). Peak memory consumption was 741.8MB. Max. memory is 15.6GB.
[2023-10-26 08:58:35,150 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 40.8MB. Free memory was 15.2MB in the beginning and 15.2MB in the end (delta: 31.8kB). Peak memory consumption was 31.8kB. Max. memory is 15.6GB.
[2023-10-26 08:58:35,152 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 753.59ms. Allocated memory is still 44.9MB. Free memory was 14.4MB in the beginning and 18.1MB in the end (delta: -3.7MB). Peak memory consumption was 3.6MB. Max. memory is 15.6GB.
[2023-10-26 08:58:35,152 INFO  L158              Benchmark]: Boogie Procedure Inliner took 76.77ms. Allocated memory is still 44.9MB. Free memory was 18.1MB in the beginning and 16.2MB in the end (delta: 1.9MB). Peak memory consumption was 1.9MB. Max. memory is 15.6GB.
[2023-10-26 08:58:35,152 INFO  L158              Benchmark]: Boogie Preprocessor took 54.72ms. Allocated memory is still 44.9MB. Free memory was 16.2MB in the beginning and 14.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.6MB. Max. memory is 15.6GB.
[2023-10-26 08:58:35,156 INFO  L158              Benchmark]: RCFGBuilder took 617.78ms. Allocated memory is still 44.9MB. Free memory was 14.6MB in the beginning and 14.5MB in the end (delta: 135.6kB). Peak memory consumption was 4.4MB. Max. memory is 15.6GB.
[2023-10-26 08:58:35,157 INFO  L158              Benchmark]: TraceAbstraction took 48746.58ms. Allocated memory was 44.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 13.8MB in the beginning and 515.5MB in the end (delta: -501.7MB). Peak memory consumption was 741.0MB. Max. memory is 15.6GB.
[2023-10-26 08:58:35,157 INFO  L158              Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 1.3GB. Free memory is still 515.5MB. There was no memory consumed. Max. memory is 15.6GB.
[2023-10-26 08:58:35,163 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14ms. Allocated memory is still 40.8MB. Free memory was 15.2MB in the beginning and 15.2MB in the end (delta: 31.8kB). Peak memory consumption was 31.8kB. Max. memory is 15.6GB.
 * CACSL2BoogieTranslator took 753.59ms. Allocated memory is still 44.9MB. Free memory was 14.4MB in the beginning and 18.1MB in the end (delta: -3.7MB). Peak memory consumption was 3.6MB. Max. memory is 15.6GB.
 * Boogie Procedure Inliner took 76.77ms. Allocated memory is still 44.9MB. Free memory was 18.1MB in the beginning and 16.2MB in the end (delta: 1.9MB). Peak memory consumption was 1.9MB. Max. memory is 15.6GB.
 * Boogie Preprocessor took 54.72ms. Allocated memory is still 44.9MB. Free memory was 16.2MB in the beginning and 14.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.6MB. Max. memory is 15.6GB.
 * RCFGBuilder took 617.78ms. Allocated memory is still 44.9MB. Free memory was 14.6MB in the beginning and 14.5MB in the end (delta: 135.6kB). Peak memory consumption was 4.4MB. Max. memory is 15.6GB.
 * TraceAbstraction took 48746.58ms. Allocated memory was 44.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 13.8MB in the beginning and 515.5MB in the end (delta: -501.7MB). Peak memory consumption was 741.0MB. Max. memory is 15.6GB.
 * Witness Printer took 4.17ms. Allocated memory is still 1.3GB. Free memory is still 515.5MB. There was no memory consumed. Max. memory is 15.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2.3s, 71 PlacesBefore, 20 PlacesAfterwards, 71 TransitionsBefore, 18 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 21 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 57 TotalNumberOfCompositions, 1633 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1004, independent: 917, independent conditional: 0, independent unconditional: 917, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 475, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1004, independent: 456, independent conditional: 0, independent unconditional: 456, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 475, unknown conditional: 0, unknown unconditional: 475] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.8s, 88 PlacesBefore, 33 PlacesAfterwards, 87 TransitionsBefore, 30 TransitionsAfterwards, 2492 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 60 TotalNumberOfCompositions, 5801 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3531, independent: 3364, independent conditional: 0, independent unconditional: 3364, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1320, independent: 1291, independent conditional: 0, independent unconditional: 1291, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3531, independent: 2073, independent conditional: 0, independent unconditional: 2073, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 1320, unknown conditional: 0, unknown unconditional: 1320] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.9s, 105 PlacesBefore, 42 PlacesAfterwards, 103 TransitionsBefore, 38 TransitionsAfterwards, 4452 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 69 TotalNumberOfCompositions, 10175 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5900, independent: 5702, independent conditional: 0, independent unconditional: 5702, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2314, independent: 2274, independent conditional: 0, independent unconditional: 2274, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5900, independent: 3428, independent conditional: 0, independent unconditional: 3428, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 2314, unknown conditional: 0, unknown unconditional: 2314] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 226, Positive conditional cache size: 0, Positive unconditional cache size: 226, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2.0s, 122 PlacesBefore, 51 PlacesAfterwards, 119 TransitionsBefore, 46 TransitionsAfterwards, 6888 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 76 TotalNumberOfCompositions, 17351 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8408, independent: 8146, independent conditional: 0, independent unconditional: 8146, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3461, independent: 3401, independent conditional: 0, independent unconditional: 3401, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8408, independent: 4745, independent conditional: 0, independent unconditional: 4745, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 3461, unknown conditional: 0, unknown unconditional: 3461] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 357, Positive conditional cache size: 0, Positive unconditional cache size: 357, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 678]: Data race detected
    Data race detected
The following path leads to a data race: 
[L674]               0  int data = 0;
[L675]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
[L683]               0  int threads_total = 4;
[L684]               0  pthread_t tids[4];
[L685]               0  int i = 0;
        VAL             [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=0, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=17, threads_total=4, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
[L678]               1  data = __VERIFIER_nondet_int()
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, arg={0:0}, data=-1, data = __VERIFIER_nondet_int()=28, data_mutex={1:0}, i=1, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=18, threads_total=4, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, arg={0:0}, data=-1, data = __VERIFIER_nondet_int()=28, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
[L680]               1  return ((void *)0);
[L678]               2  data = __VERIFIER_nondet_int()
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=19, threads_total=4, tids={13:0}]
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
[L680]               2  return ((void *)0);
[L678]               3  data = __VERIFIER_nondet_int()
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=20, threads_total=4, tids={13:0}]
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={13:0}]
[L680]               3  return ((void *)0);
[L678]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L685]  COND FALSE   0  !(i < threads_total)
[L688]               0  int i = 0;
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, i=4, threads_total=4, tids={13:0}]
[L688]  COND TRUE    0  i < threads_total - 1
[L689]  EXPR         0  tids[i]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=0, threads_total=4, tids={13:0}, tids[i]=17]
[L689]  FCALL, JOIN  1  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=0, threads_total=4, tids={13:0}, tids[i]=17]
[L688]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, i=4, threads_total=4, tids={13:0}]
[L688]  COND TRUE    0  i < threads_total - 1
[L689]  EXPR         0  tids[i]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=1, threads_total=4, tids={13:0}, tids[i]=18]
[L689]  FCALL, JOIN  2  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=1, threads_total=4, tids={13:0}, tids[i]=18]
[L688]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=2, threads_total=4, tids={13:0}]
[L688]  COND TRUE    0  i < threads_total - 1
[L689]  EXPR         0  tids[i]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=2, threads_total=4, tids={13:0}, tids[i]=19]
[L689]  FCALL, JOIN  3  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=2, threads_total=4, tids={13:0}, tids[i]=19]
[L688]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, i=4, threads_total=4, tids={13:0}]
[L688]  COND FALSE   0  !(i < threads_total - 1)
[L691]               0  return data;
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=26, data_mutex={1:0}, i=4, i=3, threads_total=4, tids={13:0}]
[L678]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=26, 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, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 84 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: 3.5s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 20 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 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, 99 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: 3.0s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 13 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=3, InterpolantAutomatonStates: 10, 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, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 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, 114 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: 6.9s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 2 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=4, InterpolantAutomatonStates: 16, 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.2s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 86 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5/5 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, 129 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: 34.9s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 962 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 712 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1648 IncrementalHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 56 mSDtfsCounter, 1648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=11, InterpolantAutomatonStates: 44, 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.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 918 SizeOfPredicates, 6 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 171/205 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!
[2023-10-26 08:58:35,349 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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