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


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


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic.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 f3484ad0f1e294af3db322ca579db3d6c2f84673739aeacc5aa23080bd63a5f2
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 15:22:05,285 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 15:22:05,287 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 15:22:05,346 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 15:22:05,346 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 15:22:05,349 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 15:22:05,350 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 15:22:05,352 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 15:22:05,353 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 15:22:05,357 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 15:22:05,358 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 15:22:05,359 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 15:22:05,359 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 15:22:05,361 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 15:22:05,362 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 15:22:05,378 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 15:22:05,380 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 15:22:05,380 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 15:22:05,381 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 15:22:05,385 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 15:22:05,386 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 15:22:05,387 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 15:22:05,388 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 15:22:05,388 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 15:22:05,394 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 15:22:05,394 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 15:22:05,395 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 15:22:05,396 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 15:22:05,396 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 15:22:05,396 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 15:22:05,397 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 15:22:05,398 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 15:22:05,399 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 15:22:05,400 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 15:22:05,400 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 15:22:05,400 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 15:22:05,401 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 15:22:05,402 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 15:22:05,402 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 15:22:05,403 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 15:22:05,403 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 15:22:05,417 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 15:22:05,453 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 15:22:05,454 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 15:22:05,454 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 15:22:05,454 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 15:22:05,455 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 15:22:05,455 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 15:22:05,456 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 15:22:05,456 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 15:22:05,456 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 15:22:05,456 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 15:22:05,457 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 15:22:05,457 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 15:22:05,457 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 15:22:05,457 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 15:22:05,457 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 15:22:05,458 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 15:22:05,458 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 15:22:05,458 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 15:22:05,458 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 15:22:05,458 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 15:22:05,458 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 15:22:05,459 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 15:22:05,459 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 15:22:05,459 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 15:22:05,459 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 15:22:05,459 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 15:22:05,459 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:22:05,460 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 15:22:05,460 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 15:22:05,460 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 15:22:05,460 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 15:22:05,460 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 15:22:05,461 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 15:22:05,461 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 15:22:05,461 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 15:22:05,461 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 15:22:05,461 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 15:22:05,462 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 -> f3484ad0f1e294af3db322ca579db3d6c2f84673739aeacc5aa23080bd63a5f2
[2023-10-25 15:22:05,831 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 15:22:05,852 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 15:22:05,854 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 15:22:05,855 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 15:22:05,855 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 15:22:05,856 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic.i
[2023-10-25 15:22:07,423 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 15:22:07,798 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 15:22:07,798 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic.i
[2023-10-25 15:22:07,821 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/057b513f7/470117bcdd7c4d68936d7b9be199c564/FLAGe0452d7b9
[2023-10-25 15:22:07,849 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/057b513f7/470117bcdd7c4d68936d7b9be199c564
[2023-10-25 15:22:07,851 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 15:22:07,853 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 15:22:07,855 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 15:22:07,855 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 15:22:07,857 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 15:22:07,858 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:22:07" (1/1) ...
[2023-10-25 15:22:07,859 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23dc5cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:07, skipping insertion in model container
[2023-10-25 15:22:07,859 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:22:07" (1/1) ...
[2023-10-25 15:22:07,877 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 15:22:07,944 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 15:22:08,185 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:22:08,516 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:22:08,540 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 15:22:08,572 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:22:08,604 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:22:08,700 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 15:22:08,700 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08 WrapperNode
[2023-10-25 15:22:08,700 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 15:22:08,701 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 15:22:08,701 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 15:22:08,701 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 15:22:08,706 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (1/1) ...
[2023-10-25 15:22:08,747 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (1/1) ...
[2023-10-25 15:22:08,795 INFO  L138                Inliner]: procedures = 269, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84
[2023-10-25 15:22:08,798 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 15:22:08,799 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 15:22:08,799 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 15:22:08,799 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 15:22:08,813 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (1/1) ...
[2023-10-25 15:22:08,813 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (1/1) ...
[2023-10-25 15:22:08,827 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (1/1) ...
[2023-10-25 15:22:08,828 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (1/1) ...
[2023-10-25 15:22:08,842 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (1/1) ...
[2023-10-25 15:22:08,849 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (1/1) ...
[2023-10-25 15:22:08,852 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (1/1) ...
[2023-10-25 15:22:08,862 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (1/1) ...
[2023-10-25 15:22:08,864 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 15:22:08,865 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 15:22:08,865 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 15:22:08,865 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 15:22:08,866 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (1/1) ...
[2023-10-25 15:22:08,870 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:22:08,903 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:22:08,919 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-25 15:22:08,946 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-25 15:22:08,965 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 15:22:08,965 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-25 15:22:08,965 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 15:22:08,967 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-25 15:22:08,967 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 15:22:08,968 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 15:22:08,968 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-25 15:22:08,968 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-25 15:22:08,968 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-25 15:22:08,968 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-25 15:22:08,968 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 15:22:08,968 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 15:22:08,969 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 15:22:08,969 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 15:22:08,970 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 15:22:09,179 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 15:22:09,181 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 15:22:09,579 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 15:22:09,586 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 15:22:09,605 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 15:22:09,608 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:22:09 BoogieIcfgContainer
[2023-10-25 15:22:09,608 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 15:22:09,610 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 15:22:09,610 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 15:22:09,613 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 15:22:09,613 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:22:07" (1/3) ...
[2023-10-25 15:22:09,614 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a404c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:22:09, skipping insertion in model container
[2023-10-25 15:22:09,615 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:22:08" (2/3) ...
[2023-10-25 15:22:09,615 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a404c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:22:09, skipping insertion in model container
[2023-10-25 15:22:09,616 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:22:09" (3/3) ...
[2023-10-25 15:22:09,617 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic.i
[2023-10-25 15:22:09,635 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 15:22:09,654 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 15:22:09,654 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2023-10-25 15:22:09,654 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 15:22:09,747 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-25 15:22:09,806 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 108 places, 109 transitions, 226 flow
[2023-10-25 15:22:09,924 INFO  L130       PetriNetUnfolder]: 6/158 cut-off events.
[2023-10-25 15:22:09,924 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:22:09,928 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164 conditions, 158 events. 6/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 302 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2023-10-25 15:22:09,928 INFO  L82        GeneralOperation]: Start removeDead. Operand has 108 places, 109 transitions, 226 flow
[2023-10-25 15:22:09,938 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 108 places, 109 transitions, 226 flow
[2023-10-25 15:22:09,942 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:22:09,978 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 109 transitions, 226 flow
[2023-10-25 15:22:09,984 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 109 transitions, 226 flow
[2023-10-25 15:22:09,985 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 108 places, 109 transitions, 226 flow
[2023-10-25 15:22:10,033 INFO  L130       PetriNetUnfolder]: 6/158 cut-off events.
[2023-10-25 15:22:10,033 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:22:10,034 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164 conditions, 158 events. 6/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 302 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2023-10-25 15:22:10,048 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1568
[2023-10-25 15:22:16,164 INFO  L134        LiptonReduction]: Checked pairs total: 2097
[2023-10-25 15:22:16,164 INFO  L136        LiptonReduction]: Total number of compositions: 105
[2023-10-25 15:22:16,184 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:22:16,204 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;@65ef982e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:22:16,205 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-25 15:22:16,206 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-10-25 15:22:16,207 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:22:16,207 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:16,208 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-25 15:22:16,208 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:22:16,215 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:16,215 INFO  L85        PathProgramCache]: Analyzing trace with hash 12504, now seen corresponding path program 1 times
[2023-10-25 15:22:16,222 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:16,233 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385779125]
[2023-10-25 15:22:16,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:16,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:16,389 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:16,508 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-25 15:22:16,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:16,509 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385779125]
[2023-10-25 15:22:16,509 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385779125] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:16,509 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:16,510 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-25 15:22:16,511 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846918681]
[2023-10-25 15:22:16,511 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:16,517 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:22:16,533 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:16,562 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:22:16,564 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:22:16,565 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 214
[2023-10-25 15:22:16,567 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 50 flow. Second operand  has 2 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:16,576 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:16,577 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 214
[2023-10-25 15:22:16,578 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:16,662 INFO  L130       PetriNetUnfolder]: 19/66 cut-off events.
[2023-10-25 15:22:16,662 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:22:16,662 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127 conditions, 66 events. 19/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 206 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 99. Up to 55 conditions per place. 
[2023-10-25 15:22:16,664 INFO  L137   encePairwiseOnDemand]: 210/214 looper letters, 13 selfloop transitions, 0 changer transitions 0/17 dead transitions.
[2023-10-25 15:22:16,664 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 17 transitions, 68 flow
[2023-10-25 15:22:16,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:22:16,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:22:16,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 225 transitions.
[2023-10-25 15:22:16,677 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5257009345794392
[2023-10-25 15:22:16,678 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 225 transitions.
[2023-10-25 15:22:16,678 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 225 transitions.
[2023-10-25 15:22:16,692 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:16,694 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 225 transitions.
[2023-10-25 15:22:16,699 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:16,703 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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-25 15:22:16,704 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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-25 15:22:16,705 INFO  L175             Difference]: Start difference. First operand has 23 places, 21 transitions, 50 flow. Second operand 2 states and 225 transitions.
[2023-10-25 15:22:16,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 17 transitions, 68 flow
[2023-10-25 15:22:16,712 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:22:16,713 INFO  L231             Difference]: Finished difference. Result has 20 places, 17 transitions, 42 flow
[2023-10-25 15:22:16,715 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=20, PETRI_TRANSITIONS=17}
[2023-10-25 15:22:16,731 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, -3 predicate places.
[2023-10-25 15:22:16,732 INFO  L495      AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 42 flow
[2023-10-25 15:22:16,732 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:16,733 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:16,733 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:22:16,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 15:22:16,734 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:22:16,736 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:16,737 INFO  L85        PathProgramCache]: Analyzing trace with hash 11981218, now seen corresponding path program 1 times
[2023-10-25 15:22:16,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:16,737 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115805557]
[2023-10-25 15:22:16,737 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:16,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:16,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:16,881 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-25 15:22:16,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:16,884 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115805557]
[2023-10-25 15:22:16,884 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115805557] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:16,885 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:16,885 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:22:16,885 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470919295]
[2023-10-25 15:22:16,885 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:16,886 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:22:16,886 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:16,887 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:22:16,887 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:22:16,915 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 214
[2023-10-25 15:22:16,916 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 42 flow. Second operand  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:16,916 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:16,916 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 214
[2023-10-25 15:22:16,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:16,993 INFO  L130       PetriNetUnfolder]: 24/81 cut-off events.
[2023-10-25 15:22:16,994 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:22:16,994 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 161 conditions, 81 events. 24/81 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 280 event pairs, 13 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 157. Up to 50 conditions per place. 
[2023-10-25 15:22:16,995 INFO  L137   encePairwiseOnDemand]: 210/214 looper letters, 14 selfloop transitions, 3 changer transitions 3/22 dead transitions.
[2023-10-25 15:22:16,995 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 92 flow
[2023-10-25 15:22:16,996 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:22:16,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:22:16,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions.
[2023-10-25 15:22:17,000 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5
[2023-10-25 15:22:17,001 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 321 transitions.
[2023-10-25 15:22:17,001 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions.
[2023-10-25 15:22:17,002 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:17,002 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions.
[2023-10-25 15:22:17,003 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:17,005 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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-25 15:22:17,006 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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-25 15:22:17,012 INFO  L175             Difference]: Start difference. First operand has 20 places, 17 transitions, 42 flow. Second operand 3 states and 321 transitions.
[2023-10-25 15:22:17,012 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 22 transitions, 92 flow
[2023-10-25 15:22:17,013 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:22:17,014 INFO  L231             Difference]: Finished difference. Result has 24 places, 17 transitions, 57 flow
[2023-10-25 15:22:17,014 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=24, PETRI_TRANSITIONS=17}
[2023-10-25 15:22:17,014 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, 1 predicate places.
[2023-10-25 15:22:17,015 INFO  L495      AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 57 flow
[2023-10-25 15:22:17,015 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:17,015 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:17,015 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-10-25 15:22:17,015 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 15:22:17,016 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:22:17,017 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:17,017 INFO  L85        PathProgramCache]: Analyzing trace with hash -1330178479, now seen corresponding path program 1 times
[2023-10-25 15:22:17,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:17,018 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876580477]
[2023-10-25 15:22:17,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:17,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:17,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:22:17,128 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:22:17,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:22:17,196 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:22:17,209 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:22:17,211 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2023-10-25 15:22:17,212 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-10-25 15:22:17,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2023-10-25 15:22:17,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2023-10-25 15:22:17,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-10-25 15:22:17,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-10-25 15:22:17,217 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-10-25 15:22:17,217 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-10-25 15:22:17,218 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 15:22:17,218 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-10-25 15:22:17,223 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:22:17,223 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 15:22:17,253 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-25 15:22:17,256 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 125 transitions, 268 flow
[2023-10-25 15:22:17,316 INFO  L130       PetriNetUnfolder]: 11/276 cut-off events.
[2023-10-25 15:22:17,316 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:22:17,318 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290 conditions, 276 events. 11/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 636 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. 
[2023-10-25 15:22:17,318 INFO  L82        GeneralOperation]: Start removeDead. Operand has 125 places, 125 transitions, 268 flow
[2023-10-25 15:22:17,319 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 125 places, 125 transitions, 268 flow
[2023-10-25 15:22:17,319 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:22:17,319 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 125 transitions, 268 flow
[2023-10-25 15:22:17,319 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 125 transitions, 268 flow
[2023-10-25 15:22:17,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 125 transitions, 268 flow
[2023-10-25 15:22:17,368 INFO  L130       PetriNetUnfolder]: 11/276 cut-off events.
[2023-10-25 15:22:17,369 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:22:17,370 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290 conditions, 276 events. 11/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 636 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. 
[2023-10-25 15:22:17,373 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3892
[2023-10-25 15:22:21,818 INFO  L134        LiptonReduction]: Checked pairs total: 7634
[2023-10-25 15:22:21,819 INFO  L136        LiptonReduction]: Total number of compositions: 107
[2023-10-25 15:22:21,820 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:22:21,821 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;@65ef982e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:22:21,821 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-10-25 15:22:21,823 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-10-25 15:22:21,823 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:22:21,832 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:21,833 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-25 15:22:21,833 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:22:21,833 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:21,833 INFO  L85        PathProgramCache]: Analyzing trace with hash 20441, now seen corresponding path program 1 times
[2023-10-25 15:22:21,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:21,834 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520635717]
[2023-10-25 15:22:21,834 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:21,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:21,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:21,867 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-25 15:22:21,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:21,870 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520635717]
[2023-10-25 15:22:21,871 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520635717] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:21,871 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:21,871 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-25 15:22:21,872 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190456934]
[2023-10-25 15:22:21,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:21,872 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:22:21,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:21,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:22:21,873 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:22:21,873 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 232
[2023-10-25 15:22:21,876 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 84 flow. Second operand  has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:21,876 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:21,877 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 232
[2023-10-25 15:22:21,877 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:22,154 INFO  L130       PetriNetUnfolder]: 378/759 cut-off events.
[2023-10-25 15:22:22,154 INFO  L131       PetriNetUnfolder]: For 38/38 co-relation queries the response was YES.
[2023-10-25 15:22:22,156 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 759 events. 378/759 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3813 event pairs, 371 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 519. Up to 666 conditions per place. 
[2023-10-25 15:22:22,160 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 21 selfloop transitions, 0 changer transitions 0/29 dead transitions.
[2023-10-25 15:22:22,160 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 118 flow
[2023-10-25 15:22:22,161 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:22:22,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:22:22,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions.
[2023-10-25 15:22:22,161 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5625
[2023-10-25 15:22:22,162 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 261 transitions.
[2023-10-25 15:22:22,162 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 261 transitions.
[2023-10-25 15:22:22,162 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:22,162 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 261 transitions.
[2023-10-25 15:22:22,163 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:22,164 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-25 15:22:22,164 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-25 15:22:22,164 INFO  L175             Difference]: Start difference. First operand has 36 places, 33 transitions, 84 flow. Second operand 2 states and 261 transitions.
[2023-10-25 15:22:22,164 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 118 flow
[2023-10-25 15:22:22,165 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:22:22,166 INFO  L231             Difference]: Finished difference. Result has 33 places, 29 transitions, 76 flow
[2023-10-25 15:22:22,166 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=29}
[2023-10-25 15:22:22,167 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places.
[2023-10-25 15:22:22,167 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 76 flow
[2023-10-25 15:22:22,167 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:22,167 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:22,167 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:22:22,167 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 15:22:22,168 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:22:22,168 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:22,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 19618577, now seen corresponding path program 1 times
[2023-10-25 15:22:22,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:22,168 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709815335]
[2023-10-25 15:22:22,169 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:22,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:22,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:22,219 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-25 15:22:22,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:22,220 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709815335]
[2023-10-25 15:22:22,220 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709815335] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:22,220 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:22,220 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:22:22,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700134864]
[2023-10-25 15:22:22,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:22,221 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:22:22,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:22,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:22:22,225 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:22:22,255 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 232
[2023-10-25 15:22:22,255 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 76 flow. Second operand  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:22,255 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:22,255 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 232
[2023-10-25 15:22:22,256 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:22,479 INFO  L130       PetriNetUnfolder]: 679/1281 cut-off events.
[2023-10-25 15:22:22,480 INFO  L131       PetriNetUnfolder]: For 42/42 co-relation queries the response was YES.
[2023-10-25 15:22:22,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2525 conditions, 1281 events. 679/1281 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6792 event pairs, 416 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 2520. Up to 850 conditions per place. 
[2023-10-25 15:22:22,487 INFO  L137   encePairwiseOnDemand]: 227/232 looper letters, 32 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2023-10-25 15:22:22,497 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 172 flow
[2023-10-25 15:22:22,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:22:22,497 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:22:22,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions.
[2023-10-25 15:22:22,498 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5402298850574713
[2023-10-25 15:22:22,498 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 376 transitions.
[2023-10-25 15:22:22,499 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions.
[2023-10-25 15:22:22,499 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:22,499 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions.
[2023-10-25 15:22:22,500 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:22,502 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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-25 15:22:22,502 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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-25 15:22:22,502 INFO  L175             Difference]: Start difference. First operand has 33 places, 29 transitions, 76 flow. Second operand 3 states and 376 transitions.
[2023-10-25 15:22:22,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 172 flow
[2023-10-25 15:22:22,504 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:22:22,505 INFO  L231             Difference]: Finished difference. Result has 37 places, 32 transitions, 106 flow
[2023-10-25 15:22:22,505 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=32}
[2023-10-25 15:22:22,507 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places.
[2023-10-25 15:22:22,507 INFO  L495      AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 106 flow
[2023-10-25 15:22:22,507 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:22,507 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:22,507 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:22:22,507 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 15:22:22,508 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:22:22,508 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:22,509 INFO  L85        PathProgramCache]: Analyzing trace with hash 1542766331, now seen corresponding path program 1 times
[2023-10-25 15:22:22,509 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:22,509 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328945498]
[2023-10-25 15:22:22,509 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:22,509 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:22,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:22,572 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-25 15:22:22,573 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:22,573 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328945498]
[2023-10-25 15:22:22,575 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328945498] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:22,575 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:22,575 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:22:22,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939738338]
[2023-10-25 15:22:22,576 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:22,576 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:22:22,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:22,577 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:22:22,577 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:22:22,591 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 232
[2023-10-25 15:22:22,592 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:22,597 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:22,597 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 232
[2023-10-25 15:22:22,597 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:22,870 INFO  L130       PetriNetUnfolder]: 739/1420 cut-off events.
[2023-10-25 15:22:22,871 INFO  L131       PetriNetUnfolder]: For 329/329 co-relation queries the response was YES.
[2023-10-25 15:22:22,873 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3150 conditions, 1420 events. 739/1420 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8161 event pairs, 430 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 3143. Up to 943 conditions per place. 
[2023-10-25 15:22:22,890 INFO  L137   encePairwiseOnDemand]: 226/232 looper letters, 35 selfloop transitions, 7 changer transitions 0/49 dead transitions.
[2023-10-25 15:22:22,890 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 242 flow
[2023-10-25 15:22:22,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:22:22,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:22:22,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions.
[2023-10-25 15:22:22,898 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5359195402298851
[2023-10-25 15:22:22,898 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 373 transitions.
[2023-10-25 15:22:22,898 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions.
[2023-10-25 15:22:22,898 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:22,898 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions.
[2023-10-25 15:22:22,899 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:22,900 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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-25 15:22:22,901 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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-25 15:22:22,901 INFO  L175             Difference]: Start difference. First operand has 37 places, 32 transitions, 106 flow. Second operand 3 states and 373 transitions.
[2023-10-25 15:22:22,901 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 242 flow
[2023-10-25 15:22:22,906 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:22:22,907 INFO  L231             Difference]: Finished difference. Result has 39 places, 37 transitions, 154 flow
[2023-10-25 15:22:22,907 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=39, PETRI_TRANSITIONS=37}
[2023-10-25 15:22:22,910 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places.
[2023-10-25 15:22:22,911 INFO  L495      AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 154 flow
[2023-10-25 15:22:22,911 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:22,911 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:22,911 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:22:22,912 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 15:22:22,914 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:22:22,914 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:22,914 INFO  L85        PathProgramCache]: Analyzing trace with hash 446003033, now seen corresponding path program 1 times
[2023-10-25 15:22:22,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:22,914 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978730305]
[2023-10-25 15:22:22,915 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:22,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:22,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:23,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:23,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:23,064 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978730305]
[2023-10-25 15:22:23,064 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978730305] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:22:23,064 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43015240]
[2023-10-25 15:22:23,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:23,065 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:22:23,065 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:22:23,074 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-25 15:22:23,097 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-25 15:22:23,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:23,199 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:22:23,201 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:22:23,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:23,315 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:22:23,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:23,367 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [43015240] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:22:23,367 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:22:23,367 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-25 15:22:23,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055813202]
[2023-10-25 15:22:23,367 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:22:23,368 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 15:22:23,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:23,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 15:22:23,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-25 15:22:23,540 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 232
[2023-10-25 15:22:23,541 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 154 flow. Second operand  has 9 states, 9 states have (on average 109.77777777777777) internal successors, (988), 9 states have internal predecessors, (988), 0 states have call successors, (0), 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-25 15:22:23,541 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:23,541 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 232
[2023-10-25 15:22:23,541 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:23,913 INFO  L130       PetriNetUnfolder]: 349/722 cut-off events.
[2023-10-25 15:22:23,914 INFO  L131       PetriNetUnfolder]: For 488/560 co-relation queries the response was YES.
[2023-10-25 15:22:23,914 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 722 events. 349/722 cut-off events. For 488/560 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3600 event pairs, 88 based on Foata normal form. 84/759 useless extension candidates. Maximal degree in co-relation 1757. Up to 373 conditions per place. 
[2023-10-25 15:22:23,916 INFO  L137   encePairwiseOnDemand]: 225/232 looper letters, 42 selfloop transitions, 6 changer transitions 15/73 dead transitions.
[2023-10-25 15:22:23,916 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 400 flow
[2023-10-25 15:22:23,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-25 15:22:23,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-25 15:22:23,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 918 transitions.
[2023-10-25 15:22:23,927 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.49461206896551724
[2023-10-25 15:22:23,928 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 918 transitions.
[2023-10-25 15:22:23,928 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 918 transitions.
[2023-10-25 15:22:23,930 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:23,931 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 918 transitions.
[2023-10-25 15:22:23,932 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 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-25 15:22:23,935 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 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-25 15:22:23,936 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 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-25 15:22:23,936 INFO  L175             Difference]: Start difference. First operand has 39 places, 37 transitions, 154 flow. Second operand 8 states and 918 transitions.
[2023-10-25 15:22:23,936 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 400 flow
[2023-10-25 15:22:23,938 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:22:23,939 INFO  L231             Difference]: Finished difference. Result has 48 places, 39 transitions, 174 flow
[2023-10-25 15:22:23,940 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=39}
[2023-10-25 15:22:23,941 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places.
[2023-10-25 15:22:23,948 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 174 flow
[2023-10-25 15:22:23,949 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 109.77777777777777) internal successors, (988), 9 states have internal predecessors, (988), 0 states have call successors, (0), 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-25 15:22:23,949 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:23,949 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:22:23,956 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-25 15:22:24,153 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:22:24,153 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:22:24,154 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:24,154 INFO  L85        PathProgramCache]: Analyzing trace with hash 1638080373, now seen corresponding path program 1 times
[2023-10-25 15:22:24,154 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:24,154 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281475879]
[2023-10-25 15:22:24,155 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:24,155 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:24,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:22:24,213 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:22:24,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:22:24,252 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:22:24,253 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:22:24,253 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-10-25 15:22:24,253 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-10-25 15:22:24,253 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-10-25 15:22:24,253 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-10-25 15:22:24,254 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-10-25 15:22:24,254 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-10-25 15:22:24,254 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-10-25 15:22:24,254 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-10-25 15:22:24,255 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-10-25 15:22:24,255 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-25 15:22:24,255 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-10-25 15:22:24,256 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:22:24,256 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-25 15:22:24,288 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-25 15:22:24,292 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 142 places, 141 transitions, 312 flow
[2023-10-25 15:22:24,357 INFO  L130       PetriNetUnfolder]: 21/479 cut-off events.
[2023-10-25 15:22:24,373 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-25 15:22:24,374 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 507 conditions, 479 events. 21/479 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1408 event pairs, 1 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 284. Up to 16 conditions per place. 
[2023-10-25 15:22:24,374 INFO  L82        GeneralOperation]: Start removeDead. Operand has 142 places, 141 transitions, 312 flow
[2023-10-25 15:22:24,376 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 142 places, 141 transitions, 312 flow
[2023-10-25 15:22:24,376 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:22:24,376 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 141 transitions, 312 flow
[2023-10-25 15:22:24,377 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 141 transitions, 312 flow
[2023-10-25 15:22:24,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 142 places, 141 transitions, 312 flow
[2023-10-25 15:22:24,433 INFO  L130       PetriNetUnfolder]: 21/479 cut-off events.
[2023-10-25 15:22:24,433 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-25 15:22:24,433 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 507 conditions, 479 events. 21/479 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1408 event pairs, 1 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 284. Up to 16 conditions per place. 
[2023-10-25 15:22:24,439 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6552
[2023-10-25 15:22:29,283 INFO  L134        LiptonReduction]: Checked pairs total: 15033
[2023-10-25 15:22:29,283 INFO  L136        LiptonReduction]: Total number of compositions: 117
[2023-10-25 15:22:29,285 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:22:29,285 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;@65ef982e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:22:29,285 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-10-25 15:22:29,286 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-10-25 15:22:29,286 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:22:29,286 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:29,286 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-25 15:22:29,286 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:22:29,286 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:29,286 INFO  L85        PathProgramCache]: Analyzing trace with hash 29208, now seen corresponding path program 1 times
[2023-10-25 15:22:29,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:29,287 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197798654]
[2023-10-25 15:22:29,287 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:29,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:29,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:29,316 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-25 15:22:29,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:29,317 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197798654]
[2023-10-25 15:22:29,317 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197798654] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:29,317 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:29,317 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-25 15:22:29,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929565634]
[2023-10-25 15:22:29,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:29,319 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:22:29,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:29,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:22:29,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:22:29,320 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 258
[2023-10-25 15:22:29,333 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 112 flow. Second operand  has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 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-25 15:22:29,333 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:29,334 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 258
[2023-10-25 15:22:29,334 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:30,302 INFO  L130       PetriNetUnfolder]: 4046/6908 cut-off events.
[2023-10-25 15:22:30,302 INFO  L131       PetriNetUnfolder]: For 523/523 co-relation queries the response was YES.
[2023-10-25 15:22:30,308 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13286 conditions, 6908 events. 4046/6908 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 44761 event pairs, 3989 based on Foata normal form. 0/6288 useless extension candidates. Maximal degree in co-relation 1715. Up to 6005 conditions per place. 
[2023-10-25 15:22:30,359 INFO  L137   encePairwiseOnDemand]: 254/258 looper letters, 28 selfloop transitions, 0 changer transitions 0/37 dead transitions.
[2023-10-25 15:22:30,359 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 160 flow
[2023-10-25 15:22:30,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:22:30,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:22:30,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions.
[2023-10-25 15:22:30,360 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5736434108527132
[2023-10-25 15:22:30,360 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 296 transitions.
[2023-10-25 15:22:30,361 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions.
[2023-10-25 15:22:30,361 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:30,361 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions.
[2023-10-25 15:22:30,362 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 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-25 15:22:30,363 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 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-25 15:22:30,363 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 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-25 15:22:30,363 INFO  L175             Difference]: Start difference. First operand has 45 places, 41 transitions, 112 flow. Second operand 2 states and 296 transitions.
[2023-10-25 15:22:30,363 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 160 flow
[2023-10-25 15:22:30,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:22:30,364 INFO  L231             Difference]: Finished difference. Result has 42 places, 37 transitions, 104 flow
[2023-10-25 15:22:30,365 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=37}
[2023-10-25 15:22:30,365 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places.
[2023-10-25 15:22:30,367 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 104 flow
[2023-10-25 15:22:30,367 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 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-25 15:22:30,367 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:30,368 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:22:30,368 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-25 15:22:30,368 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:22:30,368 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:30,368 INFO  L85        PathProgramCache]: Analyzing trace with hash 28047818, now seen corresponding path program 1 times
[2023-10-25 15:22:30,368 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:30,368 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128857706]
[2023-10-25 15:22:30,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:30,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:30,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:30,398 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-25 15:22:30,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:30,398 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128857706]
[2023-10-25 15:22:30,399 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128857706] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:30,399 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:30,399 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:22:30,399 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962323480]
[2023-10-25 15:22:30,399 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:30,400 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:22:30,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:30,408 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:22:30,409 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:22:30,421 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 258
[2023-10-25 15:22:30,422 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 104 flow. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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-25 15:22:30,422 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:30,422 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 258
[2023-10-25 15:22:30,422 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:31,765 INFO  L130       PetriNetUnfolder]: 7618/11966 cut-off events.
[2023-10-25 15:22:31,769 INFO  L131       PetriNetUnfolder]: For 565/565 co-relation queries the response was YES.
[2023-10-25 15:22:31,786 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23707 conditions, 11966 events. 7618/11966 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 74599 event pairs, 4897 based on Foata normal form. 0/11078 useless extension candidates. Maximal degree in co-relation 23701. Up to 8281 conditions per place. 
[2023-10-25 15:22:31,851 INFO  L137   encePairwiseOnDemand]: 252/258 looper letters, 43 selfloop transitions, 5 changer transitions 0/54 dead transitions.
[2023-10-25 15:22:31,865 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 234 flow
[2023-10-25 15:22:31,866 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:22:31,866 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:22:31,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions.
[2023-10-25 15:22:31,867 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5516795865633075
[2023-10-25 15:22:31,867 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 427 transitions.
[2023-10-25 15:22:31,867 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions.
[2023-10-25 15:22:31,867 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:31,867 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions.
[2023-10-25 15:22:31,868 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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-25 15:22:31,869 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-25 15:22:31,869 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-25 15:22:31,870 INFO  L175             Difference]: Start difference. First operand has 42 places, 37 transitions, 104 flow. Second operand 3 states and 427 transitions.
[2023-10-25 15:22:31,870 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 234 flow
[2023-10-25 15:22:31,881 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:22:31,881 INFO  L231             Difference]: Finished difference. Result has 46 places, 41 transitions, 142 flow
[2023-10-25 15:22:31,882 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=41}
[2023-10-25 15:22:31,883 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places.
[2023-10-25 15:22:31,883 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 142 flow
[2023-10-25 15:22:31,883 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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-25 15:22:31,883 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:31,883 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:22:31,883 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-25 15:22:31,884 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:22:31,884 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:31,884 INFO  L85        PathProgramCache]: Analyzing trace with hash -561427542, now seen corresponding path program 1 times
[2023-10-25 15:22:31,884 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:31,884 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576005541]
[2023-10-25 15:22:31,884 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:31,886 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:31,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:31,920 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-25 15:22:31,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:31,921 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576005541]
[2023-10-25 15:22:31,921 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576005541] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:31,921 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:31,921 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:22:31,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819261963]
[2023-10-25 15:22:31,922 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:31,922 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:22:31,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:31,922 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:22:31,922 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:22:31,950 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 258
[2023-10-25 15:22:31,951 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 142 flow. Second operand  has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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-25 15:22:31,951 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:31,951 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 258
[2023-10-25 15:22:31,951 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:33,713 INFO  L130       PetriNetUnfolder]: 9026/14329 cut-off events.
[2023-10-25 15:22:33,729 INFO  L131       PetriNetUnfolder]: For 3704/3704 co-relation queries the response was YES.
[2023-10-25 15:22:33,743 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32011 conditions, 14329 events. 9026/14329 cut-off events. For 3704/3704 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 96129 event pairs, 5597 based on Foata normal form. 0/13293 useless extension candidates. Maximal degree in co-relation 32003. Up to 10164 conditions per place. 
[2023-10-25 15:22:33,815 INFO  L137   encePairwiseOnDemand]: 251/258 looper letters, 49 selfloop transitions, 9 changer transitions 0/66 dead transitions.
[2023-10-25 15:22:33,829 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 342 flow
[2023-10-25 15:22:33,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:22:33,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:22:33,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions.
[2023-10-25 15:22:33,836 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5503875968992248
[2023-10-25 15:22:33,836 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 426 transitions.
[2023-10-25 15:22:33,836 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions.
[2023-10-25 15:22:33,837 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:33,837 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions.
[2023-10-25 15:22:33,837 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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-25 15:22:33,838 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-25 15:22:33,839 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-25 15:22:33,839 INFO  L175             Difference]: Start difference. First operand has 46 places, 41 transitions, 142 flow. Second operand 3 states and 426 transitions.
[2023-10-25 15:22:33,839 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 342 flow
[2023-10-25 15:22:33,934 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:22:33,936 INFO  L231             Difference]: Finished difference. Result has 48 places, 48 transitions, 208 flow
[2023-10-25 15:22:33,936 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=48}
[2023-10-25 15:22:33,937 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2023-10-25 15:22:33,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 208 flow
[2023-10-25 15:22:33,944 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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-25 15:22:33,945 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:33,945 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:22:33,945 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 15:22:33,945 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:22:33,946 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:33,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 1236224548, now seen corresponding path program 1 times
[2023-10-25 15:22:33,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:33,947 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757108699]
[2023-10-25 15:22:33,947 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:33,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:33,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:34,005 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-25 15:22:34,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:34,006 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757108699]
[2023-10-25 15:22:34,006 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757108699] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:34,006 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:34,006 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:22:34,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862314503]
[2023-10-25 15:22:34,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:34,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:22:34,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:34,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:22:34,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:22:34,020 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 258
[2023-10-25 15:22:34,021 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 208 flow. Second operand  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-25 15:22:34,033 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:34,033 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 258
[2023-10-25 15:22:34,033 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:35,867 INFO  L130       PetriNetUnfolder]: 10424/16453 cut-off events.
[2023-10-25 15:22:35,867 INFO  L131       PetriNetUnfolder]: For 11988/12245 co-relation queries the response was YES.
[2023-10-25 15:22:35,897 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42592 conditions, 16453 events. 10424/16453 cut-off events. For 11988/12245 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 111846 event pairs, 6862 based on Foata normal form. 0/15065 useless extension candidates. Maximal degree in co-relation 42583. Up to 13676 conditions per place. 
[2023-10-25 15:22:36,016 INFO  L137   encePairwiseOnDemand]: 252/258 looper letters, 54 selfloop transitions, 13 changer transitions 0/75 dead transitions.
[2023-10-25 15:22:36,030 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 461 flow
[2023-10-25 15:22:36,030 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:22:36,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:22:36,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions.
[2023-10-25 15:22:36,031 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5478036175710594
[2023-10-25 15:22:36,031 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 424 transitions.
[2023-10-25 15:22:36,031 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions.
[2023-10-25 15:22:36,032 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:36,032 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions.
[2023-10-25 15:22:36,032 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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-25 15:22:36,033 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-25 15:22:36,034 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-25 15:22:36,034 INFO  L175             Difference]: Start difference. First operand has 48 places, 48 transitions, 208 flow. Second operand 3 states and 424 transitions.
[2023-10-25 15:22:36,034 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 461 flow
[2023-10-25 15:22:36,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:22:36,193 INFO  L231             Difference]: Finished difference. Result has 49 places, 57 transitions, 299 flow
[2023-10-25 15:22:36,193 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=49, PETRI_TRANSITIONS=57}
[2023-10-25 15:22:36,194 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places.
[2023-10-25 15:22:36,194 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 57 transitions, 299 flow
[2023-10-25 15:22:36,194 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-25 15:22:36,194 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:36,195 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:22:36,195 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-25 15:22:36,195 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:22:36,195 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:36,195 INFO  L85        PathProgramCache]: Analyzing trace with hash -142466151, now seen corresponding path program 1 times
[2023-10-25 15:22:36,195 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:36,195 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501970551]
[2023-10-25 15:22:36,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:36,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:36,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:36,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:36,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:36,302 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501970551]
[2023-10-25 15:22:36,302 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501970551] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:22:36,303 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934390110]
[2023-10-25 15:22:36,303 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:36,303 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:22:36,303 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:22:36,304 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-25 15:22:36,363 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-25 15:22:36,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:36,454 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:22:36,455 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:22:36,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:36,493 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:22:36,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:36,518 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [934390110] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:22:36,518 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:22:36,518 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-25 15:22:36,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387113187]
[2023-10-25 15:22:36,518 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:22:36,518 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 15:22:36,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:36,519 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 15:22:36,519 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-25 15:22:36,651 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 258
[2023-10-25 15:22:36,652 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 57 transitions, 299 flow. Second operand  has 9 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 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-25 15:22:36,652 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:36,652 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 258
[2023-10-25 15:22:36,652 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:37,687 INFO  L130       PetriNetUnfolder]: 5484/9134 cut-off events.
[2023-10-25 15:22:37,688 INFO  L131       PetriNetUnfolder]: For 9939/10494 co-relation queries the response was YES.
[2023-10-25 15:22:37,697 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24006 conditions, 9134 events. 5484/9134 cut-off events. For 9939/10494 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 59645 event pairs, 1935 based on Foata normal form. 465/9078 useless extension candidates. Maximal degree in co-relation 23996. Up to 4991 conditions per place. 
[2023-10-25 15:22:37,758 INFO  L137   encePairwiseOnDemand]: 251/258 looper letters, 83 selfloop transitions, 7 changer transitions 4/110 dead transitions.
[2023-10-25 15:22:37,758 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 110 transitions, 691 flow
[2023-10-25 15:22:37,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-25 15:22:37,759 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-25 15:22:37,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1049 transitions.
[2023-10-25 15:22:37,764 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5082364341085271
[2023-10-25 15:22:37,764 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1049 transitions.
[2023-10-25 15:22:37,764 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1049 transitions.
[2023-10-25 15:22:37,765 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:37,765 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1049 transitions.
[2023-10-25 15:22:37,771 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 131.125) internal successors, (1049), 8 states have internal predecessors, (1049), 0 states have call successors, (0), 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-25 15:22:37,773 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 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-25 15:22:37,789 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 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-25 15:22:37,789 INFO  L175             Difference]: Start difference. First operand has 49 places, 57 transitions, 299 flow. Second operand 8 states and 1049 transitions.
[2023-10-25 15:22:37,789 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 110 transitions, 691 flow
[2023-10-25 15:22:37,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 110 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:22:37,803 INFO  L231             Difference]: Finished difference. Result has 59 places, 60 transitions, 327 flow
[2023-10-25 15:22:37,803 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=59, PETRI_TRANSITIONS=60}
[2023-10-25 15:22:37,803 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places.
[2023-10-25 15:22:37,807 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 327 flow
[2023-10-25 15:22:37,808 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 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-25 15:22:37,808 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:37,808 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:22:37,823 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-25 15:22:38,012 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:22:38,012 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:22:38,013 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:38,013 INFO  L85        PathProgramCache]: Analyzing trace with hash -966485159, now seen corresponding path program 1 times
[2023-10-25 15:22:38,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:38,013 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065028018]
[2023-10-25 15:22:38,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:38,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:38,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:38,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:38,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:38,164 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065028018]
[2023-10-25 15:22:38,164 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065028018] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:38,164 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:38,164 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:22:38,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813123748]
[2023-10-25 15:22:38,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:38,166 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:22:38,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:38,166 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:22:38,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:22:38,180 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 258
[2023-10-25 15:22:38,181 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 327 flow. Second operand  has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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-25 15:22:38,181 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:38,181 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 258
[2023-10-25 15:22:38,181 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:38,508 INFO  L130       PetriNetUnfolder]: 857/2028 cut-off events.
[2023-10-25 15:22:38,521 INFO  L131       PetriNetUnfolder]: For 2448/2458 co-relation queries the response was YES.
[2023-10-25 15:22:38,524 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6098 conditions, 2028 events. 857/2028 cut-off events. For 2448/2458 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 14090 event pairs, 171 based on Foata normal form. 412/2388 useless extension candidates. Maximal degree in co-relation 6084. Up to 1380 conditions per place. 
[2023-10-25 15:22:38,527 INFO  L137   encePairwiseOnDemand]: 252/258 looper letters, 47 selfloop transitions, 7 changer transitions 0/65 dead transitions.
[2023-10-25 15:22:38,539 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 438 flow
[2023-10-25 15:22:38,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:22:38,539 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:22:38,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions.
[2023-10-25 15:22:38,541 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5400516795865633
[2023-10-25 15:22:38,541 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 418 transitions.
[2023-10-25 15:22:38,541 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions.
[2023-10-25 15:22:38,541 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:38,541 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions.
[2023-10-25 15:22:38,542 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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-25 15:22:38,543 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-25 15:22:38,543 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-25 15:22:38,543 INFO  L175             Difference]: Start difference. First operand has 59 places, 60 transitions, 327 flow. Second operand 3 states and 418 transitions.
[2023-10-25 15:22:38,543 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 438 flow
[2023-10-25 15:22:38,547 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 429 flow, removed 4 selfloop flow, removed 1 redundant places.
[2023-10-25 15:22:38,549 INFO  L231             Difference]: Finished difference. Result has 59 places, 50 transitions, 252 flow
[2023-10-25 15:22:38,549 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=59, PETRI_TRANSITIONS=50}
[2023-10-25 15:22:38,550 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places.
[2023-10-25 15:22:38,550 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 252 flow
[2023-10-25 15:22:38,550 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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-25 15:22:38,550 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:38,551 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-10-25 15:22:38,551 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-25 15:22:38,551 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:22:38,551 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:38,551 INFO  L85        PathProgramCache]: Analyzing trace with hash 1439577314, now seen corresponding path program 1 times
[2023-10-25 15:22:38,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:38,551 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19809708]
[2023-10-25 15:22:38,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:38,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:38,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:22:38,615 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:22:38,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:22:38,656 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:22:38,657 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:22:38,657 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining)
[2023-10-25 15:22:38,657 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2023-10-25 15:22:38,657 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2023-10-25 15:22:38,657 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining)
[2023-10-25 15:22:38,658 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2023-10-25 15:22:38,658 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2023-10-25 15:22:38,658 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2023-10-25 15:22:38,658 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2023-10-25 15:22:38,658 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2023-10-25 15:22:38,658 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2023-10-25 15:22:38,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-25 15:22:38,659 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:22:38,659 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:22:38,659 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-10-25 15:22:38,695 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-10-25 15:22:38,697 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 157 transitions, 358 flow
[2023-10-25 15:22:38,806 INFO  L130       PetriNetUnfolder]: 43/854 cut-off events.
[2023-10-25 15:22:38,819 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-10-25 15:22:38,822 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 909 conditions, 854 events. 43/854 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3381 event pairs, 6 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 499. Up to 32 conditions per place. 
[2023-10-25 15:22:38,822 INFO  L82        GeneralOperation]: Start removeDead. Operand has 159 places, 157 transitions, 358 flow
[2023-10-25 15:22:38,824 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 159 places, 157 transitions, 358 flow
[2023-10-25 15:22:38,824 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:22:38,825 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 157 transitions, 358 flow
[2023-10-25 15:22:38,825 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 157 transitions, 358 flow
[2023-10-25 15:22:38,825 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 157 transitions, 358 flow
[2023-10-25 15:22:38,927 INFO  L130       PetriNetUnfolder]: 43/854 cut-off events.
[2023-10-25 15:22:38,927 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-10-25 15:22:38,929 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 909 conditions, 854 events. 43/854 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3381 event pairs, 6 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 499. Up to 32 conditions per place. 
[2023-10-25 15:22:38,959 INFO  L119        LiptonReduction]: Number of co-enabled transitions 9688
[2023-10-25 15:22:42,987 INFO  L134        LiptonReduction]: Checked pairs total: 22671
[2023-10-25 15:22:42,987 INFO  L136        LiptonReduction]: Total number of compositions: 124
[2023-10-25 15:22:42,989 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:22:42,989 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;@65ef982e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:22:42,989 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-10-25 15:22:42,990 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-10-25 15:22:42,990 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:22:42,990 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:42,990 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-25 15:22:42,990 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:22:42,990 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:42,990 INFO  L85        PathProgramCache]: Analyzing trace with hash 38714, now seen corresponding path program 1 times
[2023-10-25 15:22:42,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:42,990 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879642653]
[2023-10-25 15:22:42,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:42,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:43,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:43,023 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-25 15:22:43,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:43,024 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879642653]
[2023-10-25 15:22:43,024 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879642653] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:43,024 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:43,024 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-25 15:22:43,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339552387]
[2023-10-25 15:22:43,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:43,025 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:22:43,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:43,025 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:22:43,025 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:22:43,026 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 281
[2023-10-25 15:22:43,026 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:43,026 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:43,026 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 281
[2023-10-25 15:22:43,026 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:47,732 INFO  L130       PetriNetUnfolder]: 36913/53898 cut-off events.
[2023-10-25 15:22:47,732 INFO  L131       PetriNetUnfolder]: For 5118/5118 co-relation queries the response was YES.
[2023-10-25 15:22:47,809 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106656 conditions, 53898 events. 36913/53898 cut-off events. For 5118/5118 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 370457 event pairs, 36570 based on Foata normal form. 0/49990 useless extension candidates. Maximal degree in co-relation 15264. Up to 50011 conditions per place. 
[2023-10-25 15:22:48,152 INFO  L137   encePairwiseOnDemand]: 277/281 looper letters, 35 selfloop transitions, 0 changer transitions 0/45 dead transitions.
[2023-10-25 15:22:48,152 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 204 flow
[2023-10-25 15:22:48,153 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:22:48,153 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:22:48,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 331 transitions.
[2023-10-25 15:22:48,154 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5889679715302492
[2023-10-25 15:22:48,154 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 331 transitions.
[2023-10-25 15:22:48,155 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 331 transitions.
[2023-10-25 15:22:48,155 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:48,155 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 331 transitions.
[2023-10-25 15:22:48,155 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 0 states have call successors, (0), 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-25 15:22:48,159 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 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-25 15:22:48,159 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 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-25 15:22:48,159 INFO  L175             Difference]: Start difference. First operand has 54 places, 49 transitions, 142 flow. Second operand 2 states and 331 transitions.
[2023-10-25 15:22:48,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 204 flow
[2023-10-25 15:22:48,161 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:22:48,161 INFO  L231             Difference]: Finished difference. Result has 51 places, 45 transitions, 134 flow
[2023-10-25 15:22:48,161 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=51, PETRI_TRANSITIONS=45}
[2023-10-25 15:22:48,163 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places.
[2023-10-25 15:22:48,163 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 134 flow
[2023-10-25 15:22:48,163 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:48,163 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:48,163 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:22:48,163 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-10-25 15:22:48,169 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:22:48,170 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:48,170 INFO  L85        PathProgramCache]: Analyzing trace with hash 37188535, now seen corresponding path program 1 times
[2023-10-25 15:22:48,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:48,171 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217736960]
[2023-10-25 15:22:48,171 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:48,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:48,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:48,206 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-25 15:22:48,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:48,206 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217736960]
[2023-10-25 15:22:48,207 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217736960] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:48,207 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:48,207 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:22:48,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951620737]
[2023-10-25 15:22:48,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:48,222 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:22:48,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:48,222 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:22:48,222 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:22:48,238 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 139 out of 281
[2023-10-25 15:22:48,239 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 134 flow. Second operand  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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-25 15:22:48,239 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:48,239 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 281
[2023-10-25 15:22:48,239 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:22:56,479 INFO  L130       PetriNetUnfolder]: 73069/103628 cut-off events.
[2023-10-25 15:22:56,479 INFO  L131       PetriNetUnfolder]: For 5920/5920 co-relation queries the response was YES.
[2023-10-25 15:22:56,628 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 206250 conditions, 103628 events. 73069/103628 cut-off events. For 5920/5920 co-relation queries the response was YES. Maximal size of possible extension queue 2410. Compared 705793 event pairs, 48108 based on Foata normal form. 0/97521 useless extension candidates. Maximal degree in co-relation 206243. Up to 73612 conditions per place. 
[2023-10-25 15:22:56,927 INFO  L137   encePairwiseOnDemand]: 274/281 looper letters, 54 selfloop transitions, 6 changer transitions 0/67 dead transitions.
[2023-10-25 15:22:56,928 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 298 flow
[2023-10-25 15:22:56,928 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:22:56,928 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:22:56,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions.
[2023-10-25 15:22:56,930 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5670225385527876
[2023-10-25 15:22:56,931 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 478 transitions.
[2023-10-25 15:22:56,931 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions.
[2023-10-25 15:22:56,931 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:22:56,931 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions.
[2023-10-25 15:22:56,934 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 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-25 15:22:56,945 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-25 15:22:56,945 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-25 15:22:56,945 INFO  L175             Difference]: Start difference. First operand has 51 places, 45 transitions, 134 flow. Second operand 3 states and 478 transitions.
[2023-10-25 15:22:56,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 298 flow
[2023-10-25 15:22:56,948 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:22:56,949 INFO  L231             Difference]: Finished difference. Result has 55 places, 50 transitions, 180 flow
[2023-10-25 15:22:56,949 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=50}
[2023-10-25 15:22:56,949 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places.
[2023-10-25 15:22:56,949 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 180 flow
[2023-10-25 15:22:56,950 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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-25 15:22:56,950 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:56,950 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:22:56,950 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-10-25 15:22:56,950 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:22:56,950 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:56,951 INFO  L85        PathProgramCache]: Analyzing trace with hash 1222044967, now seen corresponding path program 1 times
[2023-10-25 15:22:56,951 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:56,951 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316413565]
[2023-10-25 15:22:56,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:56,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:56,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:57,015 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-25 15:22:57,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:57,016 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316413565]
[2023-10-25 15:22:57,016 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316413565] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:22:57,016 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:22:57,016 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:22:57,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828475185]
[2023-10-25 15:22:57,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:22:57,017 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:22:57,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:57,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:22:57,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:22:57,050 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 281
[2023-10-25 15:22:57,050 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 180 flow. Second operand  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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-25 15:22:57,050 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:57,050 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 281
[2023-10-25 15:22:57,050 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:23:06,437 INFO  L130       PetriNetUnfolder]: 89848/128539 cut-off events.
[2023-10-25 15:23:06,438 INFO  L131       PetriNetUnfolder]: For 36910/36910 co-relation queries the response was YES.
[2023-10-25 15:23:06,690 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 289520 conditions, 128539 events. 89848/128539 cut-off events. For 36910/36910 co-relation queries the response was YES. Maximal size of possible extension queue 3583. Compared 938505 event pairs, 58046 based on Foata normal form. 0/120610 useless extension candidates. Maximal degree in co-relation 289511. Up to 95069 conditions per place. 
[2023-10-25 15:23:07,243 INFO  L137   encePairwiseOnDemand]: 273/281 looper letters, 63 selfloop transitions, 11 changer transitions 0/83 dead transitions.
[2023-10-25 15:23:07,243 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 446 flow
[2023-10-25 15:23:07,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:23:07,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:23:07,245 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions.
[2023-10-25 15:23:07,245 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5682087781731909
[2023-10-25 15:23:07,245 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 479 transitions.
[2023-10-25 15:23:07,245 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions.
[2023-10-25 15:23:07,246 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:23:07,246 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions.
[2023-10-25 15:23:07,247 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 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-25 15:23:07,249 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-25 15:23:07,250 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-25 15:23:07,250 INFO  L175             Difference]: Start difference. First operand has 55 places, 50 transitions, 180 flow. Second operand 3 states and 479 transitions.
[2023-10-25 15:23:07,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 446 flow
[2023-10-25 15:23:10,066 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:23:10,068 INFO  L231             Difference]: Finished difference. Result has 57 places, 59 transitions, 264 flow
[2023-10-25 15:23:10,068 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=57, PETRI_TRANSITIONS=59}
[2023-10-25 15:23:10,069 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places.
[2023-10-25 15:23:10,069 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 264 flow
[2023-10-25 15:23:10,070 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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-25 15:23:10,070 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:23:10,070 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:23:10,070 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-10-25 15:23:10,070 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:23:10,071 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:23:10,071 INFO  L85        PathProgramCache]: Analyzing trace with hash 1278256598, now seen corresponding path program 1 times
[2023-10-25 15:23:10,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:23:10,071 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38198837]
[2023-10-25 15:23:10,071 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:23:10,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:23:10,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:23:10,204 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:23:10,205 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:23:10,205 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38198837]
[2023-10-25 15:23:10,205 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38198837] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:23:10,206 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002842842]
[2023-10-25 15:23:10,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:23:10,206 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:23:10,206 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:23:10,216 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-25 15:23:10,239 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-25 15:23:10,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:23:10,308 INFO  L263         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:23:10,309 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:23:10,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:23:10,346 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:23:10,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:23:10,387 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002842842] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:23:10,387 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:23:10,388 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-25 15:23:10,388 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096356897]
[2023-10-25 15:23:10,388 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:23:10,388 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 15:23:10,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:23:10,393 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 15:23:10,394 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-25 15:23:10,544 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 281
[2023-10-25 15:23:10,545 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 264 flow. Second operand  has 9 states, 9 states have (on average 137.77777777777777) internal successors, (1240), 9 states have internal predecessors, (1240), 0 states have call successors, (0), 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-25 15:23:10,545 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:23:10,545 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 281
[2023-10-25 15:23:10,545 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:23:16,477 INFO  L130       PetriNetUnfolder]: 51238/76185 cut-off events.
[2023-10-25 15:23:16,477 INFO  L131       PetriNetUnfolder]: For 54858/60427 co-relation queries the response was YES.
[2023-10-25 15:23:16,627 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 191019 conditions, 76185 events. 51238/76185 cut-off events. For 54858/60427 co-relation queries the response was YES. Maximal size of possible extension queue 1814. Compared 561630 event pairs, 22099 based on Foata normal form. 4007/76533 useless extension candidates. Maximal degree in co-relation 191009. Up to 45050 conditions per place. 
[2023-10-25 15:23:17,015 INFO  L137   encePairwiseOnDemand]: 274/281 looper letters, 100 selfloop transitions, 7 changer transitions 4/123 dead transitions.
[2023-10-25 15:23:17,015 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 123 transitions, 720 flow
[2023-10-25 15:23:17,016 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-25 15:23:17,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-25 15:23:17,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1178 transitions.
[2023-10-25 15:23:17,039 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5240213523131673
[2023-10-25 15:23:17,039 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1178 transitions.
[2023-10-25 15:23:17,039 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1178 transitions.
[2023-10-25 15:23:17,040 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:23:17,040 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1178 transitions.
[2023-10-25 15:23:17,042 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 147.25) internal successors, (1178), 8 states have internal predecessors, (1178), 0 states have call successors, (0), 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-25 15:23:17,044 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 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-25 15:23:17,044 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 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-25 15:23:17,044 INFO  L175             Difference]: Start difference. First operand has 57 places, 59 transitions, 264 flow. Second operand 8 states and 1178 transitions.
[2023-10-25 15:23:17,045 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 123 transitions, 720 flow
[2023-10-25 15:23:17,195 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 123 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:23:17,196 INFO  L231             Difference]: Finished difference. Result has 66 places, 63 transitions, 287 flow
[2023-10-25 15:23:17,197 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=66, PETRI_TRANSITIONS=63}
[2023-10-25 15:23:17,198 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places.
[2023-10-25 15:23:17,198 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 287 flow
[2023-10-25 15:23:17,198 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 137.77777777777777) internal successors, (1240), 9 states have internal predecessors, (1240), 0 states have call successors, (0), 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-25 15:23:17,198 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:23:17,198 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:23:17,205 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-25 15:23:17,403 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:23:17,403 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:23:17,404 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:23:17,404 INFO  L85        PathProgramCache]: Analyzing trace with hash -1582132255, now seen corresponding path program 1 times
[2023-10-25 15:23:17,405 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:23:17,405 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766184923]
[2023-10-25 15:23:17,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:23:17,406 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:23:17,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:23:17,477 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-25 15:23:17,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:23:17,477 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766184923]
[2023-10-25 15:23:17,478 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766184923] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:23:17,478 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:23:17,478 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:23:17,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725163953]
[2023-10-25 15:23:17,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:23:17,478 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:23:17,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:23:17,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:23:17,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:23:17,496 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 281
[2023-10-25 15:23:17,497 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 287 flow. Second operand  has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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-25 15:23:17,497 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:23:17,497 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 281
[2023-10-25 15:23:17,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:23:26,691 INFO  L130       PetriNetUnfolder]: 70172/102651 cut-off events.
[2023-10-25 15:23:26,700 INFO  L131       PetriNetUnfolder]: For 75817/77383 co-relation queries the response was YES.
[2023-10-25 15:23:26,938 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 272681 conditions, 102651 events. 70172/102651 cut-off events. For 75817/77383 co-relation queries the response was YES. Maximal size of possible extension queue 2254. Compared 744421 event pairs, 51048 based on Foata normal form. 4/98039 useless extension candidates. Maximal degree in co-relation 272667. Up to 86637 conditions per place. 
[2023-10-25 15:23:27,267 INFO  L137   encePairwiseOnDemand]: 274/281 looper letters, 76 selfloop transitions, 17 changer transitions 0/102 dead transitions.
[2023-10-25 15:23:27,267 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 656 flow
[2023-10-25 15:23:27,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:23:27,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:23:27,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions.
[2023-10-25 15:23:27,269 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5658362989323843
[2023-10-25 15:23:27,269 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 477 transitions.
[2023-10-25 15:23:27,269 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions.
[2023-10-25 15:23:27,269 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:23:27,269 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions.
[2023-10-25 15:23:27,270 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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-25 15:23:27,272 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-25 15:23:27,272 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-25 15:23:27,273 INFO  L175             Difference]: Start difference. First operand has 66 places, 63 transitions, 287 flow. Second operand 3 states and 477 transitions.
[2023-10-25 15:23:27,273 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 656 flow
[2023-10-25 15:23:27,457 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 651 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-25 15:23:27,459 INFO  L231             Difference]: Finished difference. Result has 67 places, 76 transitions, 441 flow
[2023-10-25 15:23:27,459 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=67, PETRI_TRANSITIONS=76}
[2023-10-25 15:23:27,459 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places.
[2023-10-25 15:23:27,459 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 76 transitions, 441 flow
[2023-10-25 15:23:27,460 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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-25 15:23:27,460 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:23:27,460 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:23:27,460 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-25 15:23:27,460 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:23:27,460 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:23:27,460 INFO  L85        PathProgramCache]: Analyzing trace with hash -76611823, now seen corresponding path program 1 times
[2023-10-25 15:23:27,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:23:27,461 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851904405]
[2023-10-25 15:23:27,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:23:27,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:23:27,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:23:27,587 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:23:27,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:23:27,590 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851904405]
[2023-10-25 15:23:27,590 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851904405] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:23:27,590 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:23:27,590 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:23:27,591 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135782108]
[2023-10-25 15:23:27,591 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:23:27,592 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:23:27,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:23:27,592 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:23:27,592 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:23:27,622 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 281
[2023-10-25 15:23:27,622 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 76 transitions, 441 flow. Second operand  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 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-25 15:23:27,622 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:23:27,622 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 281
[2023-10-25 15:23:27,622 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:23:28,516 INFO  L130       PetriNetUnfolder]: 3849/8671 cut-off events.
[2023-10-25 15:23:28,516 INFO  L131       PetriNetUnfolder]: For 11118/11156 co-relation queries the response was YES.
[2023-10-25 15:23:28,527 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25393 conditions, 8671 events. 3849/8671 cut-off events. For 11118/11156 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 75970 event pairs, 761 based on Foata normal form. 2851/11218 useless extension candidates. Maximal degree in co-relation 25378. Up to 6051 conditions per place. 
[2023-10-25 15:23:28,546 INFO  L137   encePairwiseOnDemand]: 273/281 looper letters, 55 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2023-10-25 15:23:28,546 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 517 flow
[2023-10-25 15:23:28,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:23:28,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:23:28,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions.
[2023-10-25 15:23:28,561 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5504151838671412
[2023-10-25 15:23:28,562 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 464 transitions.
[2023-10-25 15:23:28,562 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions.
[2023-10-25 15:23:28,562 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:23:28,577 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions.
[2023-10-25 15:23:28,578 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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-25 15:23:28,580 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-25 15:23:28,581 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-25 15:23:28,581 INFO  L175             Difference]: Start difference. First operand has 67 places, 76 transitions, 441 flow. Second operand 3 states and 464 transitions.
[2023-10-25 15:23:28,581 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 517 flow
[2023-10-25 15:23:28,609 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 509 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-25 15:23:28,610 INFO  L231             Difference]: Finished difference. Result has 68 places, 59 transitions, 300 flow
[2023-10-25 15:23:28,611 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=68, PETRI_TRANSITIONS=59}
[2023-10-25 15:23:28,612 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places.
[2023-10-25 15:23:28,612 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 300 flow
[2023-10-25 15:23:28,612 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 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-25 15:23:28,612 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:23:28,612 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:23:28,612 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-10-25 15:23:28,612 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:23:28,613 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:23:28,613 INFO  L85        PathProgramCache]: Analyzing trace with hash -227430121, now seen corresponding path program 1 times
[2023-10-25 15:23:28,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:23:28,613 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278640077]
[2023-10-25 15:23:28,613 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:23:28,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:23:28,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:23:28,674 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-25 15:23:28,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:23:28,674 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278640077]
[2023-10-25 15:23:28,675 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278640077] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:23:28,675 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:23:28,675 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:23:28,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042067628]
[2023-10-25 15:23:28,675 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:23:28,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:23:28,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:23:28,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:23:28,677 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:23:28,711 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 281
[2023-10-25 15:23:28,711 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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-25 15:23:28,711 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:23:28,711 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 281
[2023-10-25 15:23:28,712 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:23:29,513 INFO  L130       PetriNetUnfolder]: 4013/9119 cut-off events.
[2023-10-25 15:23:29,513 INFO  L131       PetriNetUnfolder]: For 11263/11301 co-relation queries the response was YES.
[2023-10-25 15:23:29,527 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28141 conditions, 9119 events. 4013/9119 cut-off events. For 11263/11301 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 79200 event pairs, 3200 based on Foata normal form. 0/8895 useless extension candidates. Maximal degree in co-relation 28126. Up to 7676 conditions per place. 
[2023-10-25 15:23:29,542 INFO  L137   encePairwiseOnDemand]: 277/281 looper letters, 60 selfloop transitions, 4 changer transitions 0/73 dead transitions.
[2023-10-25 15:23:29,542 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 502 flow
[2023-10-25 15:23:29,542 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:23:29,542 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:23:29,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions.
[2023-10-25 15:23:29,561 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5468564650059312
[2023-10-25 15:23:29,561 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 461 transitions.
[2023-10-25 15:23:29,561 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions.
[2023-10-25 15:23:29,561 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:23:29,561 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions.
[2023-10-25 15:23:29,562 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 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-25 15:23:29,563 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-25 15:23:29,564 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-25 15:23:29,564 INFO  L175             Difference]: Start difference. First operand has 68 places, 59 transitions, 300 flow. Second operand 3 states and 461 transitions.
[2023-10-25 15:23:29,564 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 502 flow
[2023-10-25 15:23:29,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:23:29,582 INFO  L231             Difference]: Finished difference. Result has 70 places, 61 transitions, 321 flow
[2023-10-25 15:23:29,582 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=70, PETRI_TRANSITIONS=61}
[2023-10-25 15:23:29,583 INFO  L288   CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places.
[2023-10-25 15:23:29,583 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 321 flow
[2023-10-25 15:23:29,584 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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-25 15:23:29,584 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:23:29,584 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:23:29,584 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-25 15:23:29,584 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 15:23:29,585 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:23:29,585 INFO  L85        PathProgramCache]: Analyzing trace with hash -1054392775, now seen corresponding path program 1 times
[2023-10-25 15:23:29,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:23:29,586 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819678989]
[2023-10-25 15:23:29,586 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:23:29,586 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:23:29,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:23:29,644 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:23:29,679 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:23:29,687 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:23:29,688 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:23:29,688 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-10-25 15:23:29,688 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-10-25 15:23:29,688 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-10-25 15:23:29,688 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-10-25 15:23:29,689 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-10-25 15:23:29,689 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-10-25 15:23:29,689 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-10-25 15:23:29,689 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-10-25 15:23:29,689 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-10-25 15:23:29,689 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-10-25 15:23:29,689 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-10-25 15:23:29,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-10-25 15:23:29,700 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:23:29,701 WARN  L233   ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:23:29,701 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances.
[2023-10-25 15:23:29,737 INFO  L144    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2023-10-25 15:23:29,738 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 176 places, 173 transitions, 406 flow
[2023-10-25 15:23:29,946 INFO  L130       PetriNetUnfolder]: 93/1577 cut-off events.
[2023-10-25 15:23:29,946 INFO  L131       PetriNetUnfolder]: For 110/110 co-relation queries the response was YES.
[2023-10-25 15:23:29,952 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 1577 events. 93/1577 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8092 event pairs, 23 based on Foata normal form. 0/1361 useless extension candidates. Maximal degree in co-relation 899. Up to 80 conditions per place. 
[2023-10-25 15:23:29,952 INFO  L82        GeneralOperation]: Start removeDead. Operand has 176 places, 173 transitions, 406 flow
[2023-10-25 15:23:29,982 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 176 places, 173 transitions, 406 flow
[2023-10-25 15:23:29,982 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:23:29,983 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 173 transitions, 406 flow
[2023-10-25 15:23:29,983 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 173 transitions, 406 flow
[2023-10-25 15:23:29,983 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 176 places, 173 transitions, 406 flow
[2023-10-25 15:23:30,207 INFO  L130       PetriNetUnfolder]: 93/1577 cut-off events.
[2023-10-25 15:23:30,207 INFO  L131       PetriNetUnfolder]: For 110/110 co-relation queries the response was YES.
[2023-10-25 15:23:30,211 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 1577 events. 93/1577 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8092 event pairs, 23 based on Foata normal form. 0/1361 useless extension candidates. Maximal degree in co-relation 899. Up to 80 conditions per place. 
[2023-10-25 15:23:30,257 INFO  L119        LiptonReduction]: Number of co-enabled transitions 13300
[2023-10-25 15:23:34,015 INFO  L134        LiptonReduction]: Checked pairs total: 31168
[2023-10-25 15:23:34,015 INFO  L136        LiptonReduction]: Total number of compositions: 132
[2023-10-25 15:23:34,016 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:23:34,017 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;@65ef982e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:23:34,017 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2023-10-25 15:23:34,017 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-10-25 15:23:34,017 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:23:34,017 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:23:34,017 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-25 15:23:34,018 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-25 15:23:34,018 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:23:34,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 48984, now seen corresponding path program 1 times
[2023-10-25 15:23:34,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:23:34,018 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981028291]
[2023-10-25 15:23:34,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:23:34,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:23:34,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:23:34,041 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-25 15:23:34,041 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:23:34,041 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981028291]
[2023-10-25 15:23:34,042 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981028291] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:23:34,042 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:23:34,042 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-25 15:23:34,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511621669]
[2023-10-25 15:23:34,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:23:34,042 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:23:34,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:23:34,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:23:34,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:23:34,058 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 305
[2023-10-25 15:23:34,058 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 174 flow. Second operand  has 2 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 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-25 15:23:34,058 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:23:34,058 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 305
[2023-10-25 15:23:34,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:24:04,382 INFO  L130       PetriNetUnfolder]: 225238/312306 cut-off events.
[2023-10-25 15:24:04,382 INFO  L131       PetriNetUnfolder]: For 35552/35552 co-relation queries the response was YES.
[2023-10-25 15:24:05,123 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 618981 conditions, 312306 events. 225238/312306 cut-off events. For 35552/35552 co-relation queries the response was YES. Maximal size of possible extension queue 7571. Compared 2372227 event pairs, 223425 based on Foata normal form. 0/293021 useless extension candidates. Maximal degree in co-relation 90999. Up to 289966 conditions per place. 
[2023-10-25 15:24:06,346 INFO  L137   encePairwiseOnDemand]: 301/305 looper letters, 40 selfloop transitions, 0 changer transitions 0/53 dead transitions.
[2023-10-25 15:24:06,346 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 246 flow
[2023-10-25 15:24:06,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:24:06,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:24:06,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 364 transitions.
[2023-10-25 15:24:06,348 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5967213114754099
[2023-10-25 15:24:06,348 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 364 transitions.
[2023-10-25 15:24:06,348 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 364 transitions.
[2023-10-25 15:24:06,348 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:24:06,349 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 364 transitions.
[2023-10-25 15:24:06,364 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 182.0) internal successors, (364), 2 states have internal predecessors, (364), 0 states have call successors, (0), 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-25 15:24:06,365 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 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-25 15:24:06,365 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 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-25 15:24:06,365 INFO  L175             Difference]: Start difference. First operand has 63 places, 57 transitions, 174 flow. Second operand 2 states and 364 transitions.
[2023-10-25 15:24:06,365 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 246 flow
[2023-10-25 15:24:06,370 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:24:06,375 INFO  L231             Difference]: Finished difference. Result has 60 places, 53 transitions, 166 flow
[2023-10-25 15:24:06,375 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=60, PETRI_TRANSITIONS=53}
[2023-10-25 15:24:06,376 INFO  L288   CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places.
[2023-10-25 15:24:06,376 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 166 flow
[2023-10-25 15:24:06,380 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 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-25 15:24:06,381 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:06,381 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:24:06,381 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-10-25 15:24:06,381 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-25 15:24:06,381 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:06,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 47069276, now seen corresponding path program 1 times
[2023-10-25 15:24:06,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:06,382 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593692276]
[2023-10-25 15:24:06,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:06,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:06,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:06,418 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-25 15:24:06,419 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:06,419 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593692276]
[2023-10-25 15:24:06,420 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593692276] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:24:06,420 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:24:06,420 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:24:06,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069606657]
[2023-10-25 15:24:06,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:24:06,421 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:24:06,421 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:24:06,421 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:24:06,422 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:24:06,454 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 152 out of 305
[2023-10-25 15:24:06,455 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 166 flow. Second operand  has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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-25 15:24:06,455 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:24:06,455 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 305
[2023-10-25 15:24:06,455 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
