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


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 012c6ae43b2e350f359f7e3c984c7ae78befabaf58043c4d043bdbd9937b27d7
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 22:56:55,581 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 22:56:55,582 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 22:56:55,602 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 22:56:55,602 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 22:56:55,603 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 22:56:55,604 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 22:56:55,605 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 22:56:55,606 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 22:56:55,606 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 22:56:55,607 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 22:56:55,608 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 22:56:55,608 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 22:56:55,609 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 22:56:55,610 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 22:56:55,610 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 22:56:55,611 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 22:56:55,612 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 22:56:55,613 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 22:56:55,614 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 22:56:55,615 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 22:56:55,616 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 22:56:55,616 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 22:56:55,617 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 22:56:55,619 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 22:56:55,620 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 22:56:55,620 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 22:56:55,620 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 22:56:55,621 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 22:56:55,621 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 22:56:55,622 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 22:56:55,622 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 22:56:55,623 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 22:56:55,623 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 22:56:55,624 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 22:56:55,624 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 22:56:55,625 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 22:56:55,625 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 22:56:55,625 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 22:56:55,626 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 22:56:55,626 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 22:56:55,627 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 22:56:55,641 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 22:56:55,641 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 22:56:55,641 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 22:56:55,641 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 22:56:55,642 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 22:56:55,642 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 22:56:55,642 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 22:56:55,643 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 22:56:55,643 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 22:56:55,643 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 22:56:55,643 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 22:56:55,643 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 22:56:55,644 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 22:56:55,644 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 22:56:55,644 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 22:56:55,644 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 22:56:55,644 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 22:56:55,644 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 22:56:55,645 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 22:56:55,645 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 22:56:55,645 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 22:56:55,645 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 22:56:55,645 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 22:56:55,646 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 22:56:55,646 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 22:56:55,646 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 22:56:55,646 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:56:55,646 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 22:56:55,646 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 22:56:55,647 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 22:56:55,647 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 22:56:55,647 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 22:56:55,647 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 22:56:55,647 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 22:56:55,648 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 22:56:55,648 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 22:56:55,648 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 22:56:55,648 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 -> 012c6ae43b2e350f359f7e3c984c7ae78befabaf58043c4d043bdbd9937b27d7
[2024-03-11 22:56:55,825 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 22:56:55,841 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 22:56:55,843 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 22:56:55,844 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 22:56:55,844 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 22:56:55,845 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2024-03-11 22:56:56,829 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 22:56:57,037 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 22:56:57,038 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2024-03-11 22:56:57,047 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/fe7682049/6ab1fc5971b64fbcb5ae3ae88e07d825/FLAGa504e382d
[2024-03-11 22:56:57,060 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/fe7682049/6ab1fc5971b64fbcb5ae3ae88e07d825
[2024-03-11 22:56:57,062 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 22:56:57,063 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 22:56:57,064 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 22:56:57,064 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 22:56:57,067 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 22:56:57,067 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,068 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112308c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57, skipping insertion in model container
[2024-03-11 22:56:57,068 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,074 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 22:56:57,099 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 22:56:57,290 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:56:57,299 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 22:56:57,328 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:56:57,351 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 22:56:57,351 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57 WrapperNode
[2024-03-11 22:56:57,351 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 22:56:57,352 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 22:56:57,352 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 22:56:57,352 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 22:56:57,357 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,368 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,383 INFO  L138                Inliner]: procedures = 157, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53
[2024-03-11 22:56:57,383 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 22:56:57,384 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 22:56:57,384 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 22:56:57,384 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 22:56:57,390 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,390 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,393 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,393 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,398 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,400 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,401 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,402 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,404 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 22:56:57,404 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 22:56:57,405 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 22:56:57,405 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 22:56:57,406 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (1/1) ...
[2024-03-11 22:56:57,411 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:56:57,418 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:56:57,428 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-11 22:56:57,430 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-11 22:56:57,456 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 22:56:57,457 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 22:56:57,457 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-11 22:56:57,457 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-11 22:56:57,458 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 22:56:57,458 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 22:56:57,458 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-11 22:56:57,458 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 22:56:57,459 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 22:56:57,459 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 22:56:57,459 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 22:56:57,461 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 22:56:57,586 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 22:56:57,587 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 22:56:57,695 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 22:56:57,701 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 22:56:57,701 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 22:56:57,702 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:56:57 BoogieIcfgContainer
[2024-03-11 22:56:57,703 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 22:56:57,704 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 22:56:57,704 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 22:56:57,707 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 22:56:57,707 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 10:56:57" (1/3) ...
[2024-03-11 22:56:57,707 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a61294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:56:57, skipping insertion in model container
[2024-03-11 22:56:57,707 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:56:57" (2/3) ...
[2024-03-11 22:56:57,708 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a61294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:56:57, skipping insertion in model container
[2024-03-11 22:56:57,708 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:56:57" (3/3) ...
[2024-03-11 22:56:57,709 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race.i
[2024-03-11 22:56:57,715 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 22:56:57,722 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 22:56:57,723 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-03-11 22:56:57,723 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 22:56:57,758 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 22:56:57,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 150 flow
[2024-03-11 22:56:57,827 INFO  L130       PetriNetUnfolder]: 5/97 cut-off events.
[2024-03-11 22:56:57,827 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:56:57,831 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 103 conditions, 97 events. 5/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2024-03-11 22:56:57,831 INFO  L82        GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 150 flow
[2024-03-11 22:56:57,834 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 150 flow
[2024-03-11 22:56:57,837 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:56:57,844 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 71 transitions, 150 flow
[2024-03-11 22:56:57,846 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 71 transitions, 150 flow
[2024-03-11 22:56:57,846 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 150 flow
[2024-03-11 22:56:57,864 INFO  L130       PetriNetUnfolder]: 5/97 cut-off events.
[2024-03-11 22:56:57,864 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:56:57,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 103 conditions, 97 events. 5/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2024-03-11 22:56:57,865 INFO  L119        LiptonReduction]: Number of co-enabled transitions 896
[2024-03-11 22:56:59,373 INFO  L134        LiptonReduction]: Checked pairs total: 1633
[2024-03-11 22:56:59,373 INFO  L136        LiptonReduction]: Total number of compositions: 57
[2024-03-11 22:56:59,385 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:56:59,390 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;@7e2e5389, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:56:59,391 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-03-11 22:56:59,393 INFO  L130       PetriNetUnfolder]: 0/5 cut-off events.
[2024-03-11 22:56:59,393 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:56:59,393 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:56:59,394 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-03-11 22:56:59,394 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-11 22:56:59,398 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:56:59,398 INFO  L85        PathProgramCache]: Analyzing trace with hash 260257, now seen corresponding path program 1 times
[2024-03-11 22:56:59,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:56:59,405 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632828805]
[2024-03-11 22:56:59,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:56:59,405 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:56:59,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:56:59,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:56:59,560 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:56:59,561 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632828805]
[2024-03-11 22:56:59,561 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632828805] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:56:59,561 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:56:59,562 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:56:59,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960608470]
[2024-03-11 22:56:59,563 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:56:59,569 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:56:59,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:56:59,584 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:56:59,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:56:59,619 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 128
[2024-03-11 22:56:59,622 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 44 flow. Second operand  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:59,623 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:56:59,623 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 128
[2024-03-11 22:56:59,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:56:59,662 INFO  L130       PetriNetUnfolder]: 12/52 cut-off events.
[2024-03-11 22:56:59,662 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:56:59,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100 conditions, 52 events. 12/52 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 144 event pairs, 5 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 72. Up to 36 conditions per place. 
[2024-03-11 22:56:59,664 INFO  L137   encePairwiseOnDemand]: 124/128 looper letters, 13 selfloop transitions, 2 changer transitions 0/20 dead transitions.
[2024-03-11 22:56:59,664 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 20 transitions, 78 flow
[2024-03-11 22:56:59,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:56:59,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:56:59,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions.
[2024-03-11 22:56:59,674 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5442708333333334
[2024-03-11 22:56:59,675 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 209 transitions.
[2024-03-11 22:56:59,675 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 209 transitions.
[2024-03-11 22:56:59,676 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:56:59,678 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 209 transitions.
[2024-03-11 22:56:59,680 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:59,683 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:59,684 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:59,685 INFO  L175             Difference]: Start difference. First operand has 20 places, 18 transitions, 44 flow. Second operand 3 states and 209 transitions.
[2024-03-11 22:56:59,686 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 20 transitions, 78 flow
[2024-03-11 22:56:59,687 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 78 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:56:59,689 INFO  L231             Difference]: Finished difference. Result has 22 places, 17 transitions, 50 flow
[2024-03-11 22:56:59,690 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=22, PETRI_TRANSITIONS=17}
[2024-03-11 22:56:59,693 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places.
[2024-03-11 22:56:59,694 INFO  L495      AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 50 flow
[2024-03-11 22:56:59,694 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:59,694 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:56:59,694 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 22:56:59,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 22:56:59,695 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-11 22:56:59,695 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:56:59,695 INFO  L85        PathProgramCache]: Analyzing trace with hash -826925151, now seen corresponding path program 1 times
[2024-03-11 22:56:59,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:56:59,696 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981130562]
[2024-03-11 22:56:59,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:56:59,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:56:59,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:56:59,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:56:59,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:56:59,734 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981130562]
[2024-03-11 22:56:59,734 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981130562] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:56:59,734 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:56:59,735 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:56:59,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935898079]
[2024-03-11 22:56:59,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:56:59,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:56:59,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:56:59,737 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:56:59,737 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:56:59,750 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 61 out of 128
[2024-03-11 22:56:59,750 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 50 flow. Second operand  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:59,750 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:56:59,751 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 128
[2024-03-11 22:56:59,751 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:56:59,798 INFO  L130       PetriNetUnfolder]: 20/71 cut-off events.
[2024-03-11 22:56:59,799 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:56:59,799 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 153 conditions, 71 events. 20/71 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 225 event pairs, 13 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 122. Up to 48 conditions per place. 
[2024-03-11 22:56:59,799 INFO  L137   encePairwiseOnDemand]: 124/128 looper letters, 17 selfloop transitions, 3 changer transitions 1/24 dead transitions.
[2024-03-11 22:56:59,800 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 111 flow
[2024-03-11 22:56:59,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:56:59,800 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:56:59,801 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions.
[2024-03-11 22:56:59,802 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5338541666666666
[2024-03-11 22:56:59,802 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 205 transitions.
[2024-03-11 22:56:59,802 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 205 transitions.
[2024-03-11 22:56:59,803 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:56:59,803 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 205 transitions.
[2024-03-11 22:56:59,804 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:59,805 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:59,805 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:59,805 INFO  L175             Difference]: Start difference. First operand has 22 places, 17 transitions, 50 flow. Second operand 3 states and 205 transitions.
[2024-03-11 22:56:59,805 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 111 flow
[2024-03-11 22:56:59,806 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 105 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:56:59,806 INFO  L231             Difference]: Finished difference. Result has 23 places, 19 transitions, 65 flow
[2024-03-11 22:56:59,807 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=23, PETRI_TRANSITIONS=19}
[2024-03-11 22:56:59,807 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places.
[2024-03-11 22:56:59,808 INFO  L495      AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow
[2024-03-11 22:56:59,808 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:59,808 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:56:59,808 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2024-03-11 22:56:59,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 22:56:59,808 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-11 22:56:59,809 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:56:59,809 INFO  L85        PathProgramCache]: Analyzing trace with hash -826926477, now seen corresponding path program 1 times
[2024-03-11 22:56:59,809 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:56:59,809 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195393205]
[2024-03-11 22:56:59,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:56:59,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:56:59,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:56:59,826 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:56:59,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:56:59,849 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:56:59,850 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:56:59,850 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining)
[2024-03-11 22:56:59,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining)
[2024-03-11 22:56:59,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining)
[2024-03-11 22:56:59,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining)
[2024-03-11 22:56:59,853 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining)
[2024-03-11 22:56:59,853 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 22:56:59,853 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-03-11 22:56:59,855 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:56:59,855 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 22:56:59,869 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 22:56:59,871 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 192 flow
[2024-03-11 22:56:59,887 INFO  L130       PetriNetUnfolder]: 10/173 cut-off events.
[2024-03-11 22:56:59,887 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:56:59,887 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 187 conditions, 173 events. 10/173 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 411 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. 
[2024-03-11 22:56:59,888 INFO  L82        GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 192 flow
[2024-03-11 22:56:59,889 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 88 places, 87 transitions, 192 flow
[2024-03-11 22:56:59,890 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:56:59,890 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 87 transitions, 192 flow
[2024-03-11 22:56:59,891 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 87 transitions, 192 flow
[2024-03-11 22:56:59,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 192 flow
[2024-03-11 22:56:59,911 INFO  L130       PetriNetUnfolder]: 10/173 cut-off events.
[2024-03-11 22:56:59,911 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:56:59,912 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 187 conditions, 173 events. 10/173 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 411 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. 
[2024-03-11 22:56:59,914 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2492
[2024-03-11 22:57:01,096 INFO  L134        LiptonReduction]: Checked pairs total: 5801
[2024-03-11 22:57:01,096 INFO  L136        LiptonReduction]: Total number of compositions: 60
[2024-03-11 22:57:01,098 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:57:01,099 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;@7e2e5389, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:57:01,099 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-03-11 22:57:01,100 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2024-03-11 22:57:01,100 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:57:01,100 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:01,101 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-03-11 22:57:01,101 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-11 22:57:01,101 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:01,101 INFO  L85        PathProgramCache]: Analyzing trace with hash 422210, now seen corresponding path program 1 times
[2024-03-11 22:57:01,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:01,102 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038631597]
[2024-03-11 22:57:01,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:01,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:01,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:01,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:57:01,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:01,141 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038631597]
[2024-03-11 22:57:01,142 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038631597] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:01,142 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:01,142 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:57:01,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959903287]
[2024-03-11 22:57:01,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:01,143 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:01,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:01,143 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:01,143 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:01,169 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 78 out of 147
[2024-03-11 22:57:01,170 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 78 flow. Second operand  has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,171 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:01,171 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 147
[2024-03-11 22:57:01,171 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:01,271 INFO  L130       PetriNetUnfolder]: 457/901 cut-off events.
[2024-03-11 22:57:01,271 INFO  L131       PetriNetUnfolder]: For 36/36 co-relation queries the response was YES.
[2024-03-11 22:57:01,273 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 901 events. 457/901 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4583 event pairs, 205 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 286. Up to 787 conditions per place. 
[2024-03-11 22:57:01,276 INFO  L137   encePairwiseOnDemand]: 143/147 looper letters, 27 selfloop transitions, 2 changer transitions 0/36 dead transitions.
[2024-03-11 22:57:01,276 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 148 flow
[2024-03-11 22:57:01,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:01,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:01,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions.
[2024-03-11 22:57:01,278 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6009070294784581
[2024-03-11 22:57:01,279 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 265 transitions.
[2024-03-11 22:57:01,279 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions.
[2024-03-11 22:57:01,279 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:01,279 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions.
[2024-03-11 22:57:01,280 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,281 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,282 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,282 INFO  L175             Difference]: Start difference. First operand has 33 places, 30 transitions, 78 flow. Second operand 3 states and 265 transitions.
[2024-03-11 22:57:01,282 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 148 flow
[2024-03-11 22:57:01,283 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:57:01,283 INFO  L231             Difference]: Finished difference. Result has 35 places, 30 transitions, 88 flow
[2024-03-11 22:57:01,284 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=30}
[2024-03-11 22:57:01,284 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places.
[2024-03-11 22:57:01,285 INFO  L495      AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 88 flow
[2024-03-11 22:57:01,285 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,285 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:01,285 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:01,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 22:57:01,285 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-11 22:57:01,286 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:01,286 INFO  L85        PathProgramCache]: Analyzing trace with hash -536914938, now seen corresponding path program 1 times
[2024-03-11 22:57:01,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:01,286 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245729496]
[2024-03-11 22:57:01,286 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:01,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:01,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:01,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:57:01,314 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:01,315 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245729496]
[2024-03-11 22:57:01,315 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245729496] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:01,315 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:01,315 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:57:01,315 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35296038]
[2024-03-11 22:57:01,316 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:01,316 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:01,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:01,316 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:01,317 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:01,330 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 74 out of 147
[2024-03-11 22:57:01,331 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 88 flow. Second operand  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,331 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:01,331 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 147
[2024-03-11 22:57:01,331 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:01,459 INFO  L130       PetriNetUnfolder]: 595/1131 cut-off events.
[2024-03-11 22:57:01,459 INFO  L131       PetriNetUnfolder]: For 148/148 co-relation queries the response was YES.
[2024-03-11 22:57:01,461 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 1131 events. 595/1131 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6140 event pairs, 379 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 2269. Up to 765 conditions per place. 
[2024-03-11 22:57:01,465 INFO  L137   encePairwiseOnDemand]: 141/147 looper letters, 36 selfloop transitions, 5 changer transitions 0/47 dead transitions.
[2024-03-11 22:57:01,465 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 219 flow
[2024-03-11 22:57:01,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:01,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:01,467 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions.
[2024-03-11 22:57:01,467 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5941043083900227
[2024-03-11 22:57:01,467 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 262 transitions.
[2024-03-11 22:57:01,467 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions.
[2024-03-11 22:57:01,468 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:01,468 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions.
[2024-03-11 22:57:01,469 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,470 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,470 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,470 INFO  L175             Difference]: Start difference. First operand has 35 places, 30 transitions, 88 flow. Second operand 3 states and 262 transitions.
[2024-03-11 22:57:01,471 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 219 flow
[2024-03-11 22:57:01,472 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:57:01,472 INFO  L231             Difference]: Finished difference. Result has 38 places, 34 transitions, 124 flow
[2024-03-11 22:57:01,473 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=38, PETRI_TRANSITIONS=34}
[2024-03-11 22:57:01,473 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places.
[2024-03-11 22:57:01,473 INFO  L495      AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 124 flow
[2024-03-11 22:57:01,474 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,474 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:01,474 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:01,474 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 22:57:01,474 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-11 22:57:01,475 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:01,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 421910286, now seen corresponding path program 1 times
[2024-03-11 22:57:01,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:01,475 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163134938]
[2024-03-11 22:57:01,475 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:01,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:01,486 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:01,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:57:01,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:01,529 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163134938]
[2024-03-11 22:57:01,529 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163134938] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:01,529 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:01,529 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:57:01,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871925605]
[2024-03-11 22:57:01,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:01,530 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:57:01,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:01,530 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:57:01,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:57:01,557 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 76 out of 147
[2024-03-11 22:57:01,558 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 124 flow. Second operand  has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,558 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:01,558 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 147
[2024-03-11 22:57:01,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:01,662 INFO  L130       PetriNetUnfolder]: 397/789 cut-off events.
[2024-03-11 22:57:01,662 INFO  L131       PetriNetUnfolder]: For 466/480 co-relation queries the response was YES.
[2024-03-11 22:57:01,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 789 events. 397/789 cut-off events. For 466/480 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3804 event pairs, 204 based on Foata normal form. 50/823 useless extension candidates. Maximal degree in co-relation 727. Up to 442 conditions per place. 
[2024-03-11 22:57:01,666 INFO  L137   encePairwiseOnDemand]: 143/147 looper letters, 41 selfloop transitions, 3 changer transitions 0/51 dead transitions.
[2024-03-11 22:57:01,666 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 274 flow
[2024-03-11 22:57:01,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:57:01,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:57:01,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions.
[2024-03-11 22:57:01,668 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5799319727891157
[2024-03-11 22:57:01,668 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 341 transitions.
[2024-03-11 22:57:01,668 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 341 transitions.
[2024-03-11 22:57:01,668 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:01,668 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 341 transitions.
[2024-03-11 22:57:01,669 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,670 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,671 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,671 INFO  L175             Difference]: Start difference. First operand has 38 places, 34 transitions, 124 flow. Second operand 4 states and 341 transitions.
[2024-03-11 22:57:01,671 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 274 flow
[2024-03-11 22:57:01,673 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:57:01,674 INFO  L231             Difference]: Finished difference. Result has 40 places, 35 transitions, 130 flow
[2024-03-11 22:57:01,674 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=40, PETRI_TRANSITIONS=35}
[2024-03-11 22:57:01,675 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places.
[2024-03-11 22:57:01,675 INFO  L495      AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 130 flow
[2024-03-11 22:57:01,675 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:01,675 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:01,675 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2024-03-11 22:57:01,676 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 22:57:01,676 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-11 22:57:01,676 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:01,676 INFO  L85        PathProgramCache]: Analyzing trace with hash -1843257085, now seen corresponding path program 1 times
[2024-03-11 22:57:01,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:01,677 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264711403]
[2024-03-11 22:57:01,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:01,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:01,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:57:01,695 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:57:01,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:57:01,705 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:57:01,705 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:57:01,706 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2024-03-11 22:57:01,706 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2024-03-11 22:57:01,706 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2024-03-11 22:57:01,706 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2024-03-11 22:57:01,706 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2024-03-11 22:57:01,707 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2024-03-11 22:57:01,707 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 22:57:01,707 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-11 22:57:01,708 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:57:01,708 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-11 22:57:01,721 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-11 22:57:01,723 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 105 places, 103 transitions, 236 flow
[2024-03-11 22:57:01,740 INFO  L130       PetriNetUnfolder]: 20/300 cut-off events.
[2024-03-11 22:57:01,740 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-03-11 22:57:01,741 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 328 conditions, 300 events. 20/300 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 916 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 181. Up to 16 conditions per place. 
[2024-03-11 22:57:01,741 INFO  L82        GeneralOperation]: Start removeDead. Operand has 105 places, 103 transitions, 236 flow
[2024-03-11 22:57:01,742 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 105 places, 103 transitions, 236 flow
[2024-03-11 22:57:01,742 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:57:01,742 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 103 transitions, 236 flow
[2024-03-11 22:57:01,742 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 103 transitions, 236 flow
[2024-03-11 22:57:01,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 105 places, 103 transitions, 236 flow
[2024-03-11 22:57:01,764 INFO  L130       PetriNetUnfolder]: 20/300 cut-off events.
[2024-03-11 22:57:01,764 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-03-11 22:57:01,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 328 conditions, 300 events. 20/300 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 916 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 181. Up to 16 conditions per place. 
[2024-03-11 22:57:01,768 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4452
[2024-03-11 22:57:03,019 INFO  L134        LiptonReduction]: Checked pairs total: 10175
[2024-03-11 22:57:03,019 INFO  L136        LiptonReduction]: Total number of compositions: 69
[2024-03-11 22:57:03,020 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:57:03,021 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;@7e2e5389, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:57:03,021 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-11 22:57:03,022 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2024-03-11 22:57:03,022 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:57:03,022 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:03,023 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-03-11 22:57:03,023 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:57:03,023 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:03,023 INFO  L85        PathProgramCache]: Analyzing trace with hash 608739, now seen corresponding path program 1 times
[2024-03-11 22:57:03,023 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:03,024 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508472861]
[2024-03-11 22:57:03,024 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:03,024 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:03,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:03,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:57:03,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:03,043 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508472861]
[2024-03-11 22:57:03,043 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508472861] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:03,044 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:03,044 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:57:03,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507769180]
[2024-03-11 22:57:03,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:03,045 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:03,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:03,045 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:03,046 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:03,057 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 172
[2024-03-11 22:57:03,058 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:03,058 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:03,058 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 172
[2024-03-11 22:57:03,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:03,357 INFO  L130       PetriNetUnfolder]: 2815/4983 cut-off events.
[2024-03-11 22:57:03,357 INFO  L131       PetriNetUnfolder]: For 394/394 co-relation queries the response was YES.
[2024-03-11 22:57:03,378 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9510 conditions, 4983 events. 2815/4983 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 32837 event pairs, 1785 based on Foata normal form. 0/4525 useless extension candidates. Maximal degree in co-relation 1298. Up to 4231 conditions per place. 
[2024-03-11 22:57:03,399 INFO  L137   encePairwiseOnDemand]: 168/172 looper letters, 30 selfloop transitions, 2 changer transitions 0/43 dead transitions.
[2024-03-11 22:57:03,399 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 180 flow
[2024-03-11 22:57:03,400 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:03,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:03,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions.
[2024-03-11 22:57:03,401 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5891472868217055
[2024-03-11 22:57:03,401 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 304 transitions.
[2024-03-11 22:57:03,401 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions.
[2024-03-11 22:57:03,401 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:03,401 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions.
[2024-03-11 22:57:03,402 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:03,403 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:03,404 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:03,404 INFO  L175             Difference]: Start difference. First operand has 42 places, 38 transitions, 106 flow. Second operand 3 states and 304 transitions.
[2024-03-11 22:57:03,404 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 180 flow
[2024-03-11 22:57:03,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:57:03,406 INFO  L231             Difference]: Finished difference. Result has 44 places, 38 transitions, 116 flow
[2024-03-11 22:57:03,406 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=38}
[2024-03-11 22:57:03,406 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2024-03-11 22:57:03,407 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 116 flow
[2024-03-11 22:57:03,407 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:03,407 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:03,407 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:03,407 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-11 22:57:03,408 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:57:03,408 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:03,408 INFO  L85        PathProgramCache]: Analyzing trace with hash 238525696, now seen corresponding path program 1 times
[2024-03-11 22:57:03,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:03,408 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117894551]
[2024-03-11 22:57:03,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:03,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:03,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:03,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:57:03,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:03,428 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117894551]
[2024-03-11 22:57:03,428 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117894551] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:03,428 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:03,428 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:57:03,428 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404835423]
[2024-03-11 22:57:03,429 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:03,429 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:03,429 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:03,429 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:03,430 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:03,445 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172
[2024-03-11 22:57:03,446 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 116 flow. Second operand  has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:03,446 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:03,446 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172
[2024-03-11 22:57:03,446 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:04,107 INFO  L130       PetriNetUnfolder]: 6067/9611 cut-off events.
[2024-03-11 22:57:04,107 INFO  L131       PetriNetUnfolder]: For 1266/1266 co-relation queries the response was YES.
[2024-03-11 22:57:04,114 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19591 conditions, 9611 events. 6067/9611 cut-off events. For 1266/1266 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 59756 event pairs, 4931 based on Foata normal form. 0/8786 useless extension candidates. Maximal degree in co-relation 19540. Up to 7918 conditions per place. 
[2024-03-11 22:57:04,143 INFO  L137   encePairwiseOnDemand]: 166/172 looper letters, 49 selfloop transitions, 5 changer transitions 0/61 dead transitions.
[2024-03-11 22:57:04,144 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 295 flow
[2024-03-11 22:57:04,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:04,144 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:04,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions.
[2024-03-11 22:57:04,145 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6085271317829457
[2024-03-11 22:57:04,145 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 314 transitions.
[2024-03-11 22:57:04,146 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions.
[2024-03-11 22:57:04,146 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:04,146 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions.
[2024-03-11 22:57:04,147 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:04,147 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:04,148 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:04,148 INFO  L175             Difference]: Start difference. First operand has 44 places, 38 transitions, 116 flow. Second operand 3 states and 314 transitions.
[2024-03-11 22:57:04,148 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 295 flow
[2024-03-11 22:57:04,149 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:57:04,150 INFO  L231             Difference]: Finished difference. Result has 46 places, 42 transitions, 147 flow
[2024-03-11 22:57:04,150 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=46, PETRI_TRANSITIONS=42}
[2024-03-11 22:57:04,151 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2024-03-11 22:57:04,151 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 147 flow
[2024-03-11 22:57:04,151 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:04,151 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:04,151 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:04,151 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-11 22:57:04,152 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:57:04,152 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:04,152 INFO  L85        PathProgramCache]: Analyzing trace with hash -1336616655, now seen corresponding path program 1 times
[2024-03-11 22:57:04,152 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:04,152 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944661813]
[2024-03-11 22:57:04,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:04,153 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:04,158 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:04,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:57:04,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:04,182 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944661813]
[2024-03-11 22:57:04,182 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944661813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:04,182 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:04,182 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:57:04,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018676682]
[2024-03-11 22:57:04,182 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:04,183 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:57:04,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:04,183 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:57:04,183 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:57:04,206 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 172
[2024-03-11 22:57:04,206 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 147 flow. Second operand  has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:04,206 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:04,207 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 172
[2024-03-11 22:57:04,207 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:04,561 INFO  L130       PetriNetUnfolder]: 3162/5514 cut-off events.
[2024-03-11 22:57:04,561 INFO  L131       PetriNetUnfolder]: For 1355/2003 co-relation queries the response was YES.
[2024-03-11 22:57:04,600 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12182 conditions, 5514 events. 3162/5514 cut-off events. For 1355/2003 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 36291 event pairs, 1811 based on Foata normal form. 532/5797 useless extension candidates. Maximal degree in co-relation 4425. Up to 2993 conditions per place. 
[2024-03-11 22:57:04,614 INFO  L137   encePairwiseOnDemand]: 168/172 looper letters, 44 selfloop transitions, 3 changer transitions 0/60 dead transitions.
[2024-03-11 22:57:04,614 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 291 flow
[2024-03-11 22:57:04,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:57:04,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:57:04,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions.
[2024-03-11 22:57:04,616 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5872093023255814
[2024-03-11 22:57:04,616 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 404 transitions.
[2024-03-11 22:57:04,616 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 404 transitions.
[2024-03-11 22:57:04,617 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:04,617 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 404 transitions.
[2024-03-11 22:57:04,618 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:04,619 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:04,619 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:04,619 INFO  L175             Difference]: Start difference. First operand has 46 places, 42 transitions, 147 flow. Second operand 4 states and 404 transitions.
[2024-03-11 22:57:04,619 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 291 flow
[2024-03-11 22:57:04,622 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:57:04,623 INFO  L231             Difference]: Finished difference. Result has 49 places, 43 transitions, 158 flow
[2024-03-11 22:57:04,623 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=43}
[2024-03-11 22:57:04,623 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places.
[2024-03-11 22:57:04,623 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 158 flow
[2024-03-11 22:57:04,624 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:04,624 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:04,624 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:04,624 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-11 22:57:04,624 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:57:04,624 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:04,624 INFO  L85        PathProgramCache]: Analyzing trace with hash 205097922, now seen corresponding path program 1 times
[2024-03-11 22:57:04,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:04,625 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722252405]
[2024-03-11 22:57:04,625 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:04,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:04,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:04,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 22:57:04,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:04,645 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722252405]
[2024-03-11 22:57:04,645 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722252405] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:04,645 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:04,645 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:57:04,645 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012242930]
[2024-03-11 22:57:04,645 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:04,646 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:04,646 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:04,646 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:04,646 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:04,664 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172
[2024-03-11 22:57:04,664 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 158 flow. Second operand  has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:04,664 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:04,664 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172
[2024-03-11 22:57:04,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:05,236 INFO  L130       PetriNetUnfolder]: 5873/9526 cut-off events.
[2024-03-11 22:57:05,236 INFO  L131       PetriNetUnfolder]: For 4841/4966 co-relation queries the response was YES.
[2024-03-11 22:57:05,247 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22533 conditions, 9526 events. 5873/9526 cut-off events. For 4841/4966 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 60023 event pairs, 3788 based on Foata normal form. 0/9071 useless extension candidates. Maximal degree in co-relation 8932. Up to 6762 conditions per place. 
[2024-03-11 22:57:05,275 INFO  L137   encePairwiseOnDemand]: 165/172 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions.
[2024-03-11 22:57:05,275 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 377 flow
[2024-03-11 22:57:05,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:05,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:05,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions.
[2024-03-11 22:57:05,277 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6085271317829457
[2024-03-11 22:57:05,277 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 314 transitions.
[2024-03-11 22:57:05,277 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions.
[2024-03-11 22:57:05,277 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:05,277 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions.
[2024-03-11 22:57:05,278 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:05,279 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:05,279 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:05,279 INFO  L175             Difference]: Start difference. First operand has 49 places, 43 transitions, 158 flow. Second operand 3 states and 314 transitions.
[2024-03-11 22:57:05,279 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 377 flow
[2024-03-11 22:57:05,287 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:57:05,288 INFO  L231             Difference]: Finished difference. Result has 51 places, 50 transitions, 234 flow
[2024-03-11 22:57:05,288 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=51, PETRI_TRANSITIONS=50}
[2024-03-11 22:57:05,289 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2024-03-11 22:57:05,289 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 234 flow
[2024-03-11 22:57:05,289 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:05,289 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:05,289 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:05,289 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-11 22:57:05,289 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:57:05,290 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:05,290 INFO  L85        PathProgramCache]: Analyzing trace with hash 778148188, now seen corresponding path program 1 times
[2024-03-11 22:57:05,290 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:05,290 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827011296]
[2024-03-11 22:57:05,290 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:05,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:05,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:05,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:57:05,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:05,343 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827011296]
[2024-03-11 22:57:05,343 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827011296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:05,344 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:05,344 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:57:05,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336423267]
[2024-03-11 22:57:05,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:05,344 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:05,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:05,344 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:05,345 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:05,366 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 172
[2024-03-11 22:57:05,366 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 234 flow. Second operand  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:05,366 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:05,366 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 172
[2024-03-11 22:57:05,366 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:05,550 INFO  L130       PetriNetUnfolder]: 663/1671 cut-off events.
[2024-03-11 22:57:05,550 INFO  L131       PetriNetUnfolder]: For 1269/1279 co-relation queries the response was YES.
[2024-03-11 22:57:05,552 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 1671 events. 663/1671 cut-off events. For 1269/1279 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11341 event pairs, 162 based on Foata normal form. 312/1943 useless extension candidates. Maximal degree in co-relation 1621. Up to 1001 conditions per place. 
[2024-03-11 22:57:05,555 INFO  L137   encePairwiseOnDemand]: 166/172 looper letters, 40 selfloop transitions, 7 changer transitions 0/58 dead transitions.
[2024-03-11 22:57:05,555 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 347 flow
[2024-03-11 22:57:05,556 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:05,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:05,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions.
[2024-03-11 22:57:05,557 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5910852713178295
[2024-03-11 22:57:05,557 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 305 transitions.
[2024-03-11 22:57:05,557 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions.
[2024-03-11 22:57:05,557 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:05,557 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions.
[2024-03-11 22:57:05,558 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:05,558 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:05,559 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:05,559 INFO  L175             Difference]: Start difference. First operand has 51 places, 50 transitions, 234 flow. Second operand 3 states and 305 transitions.
[2024-03-11 22:57:05,559 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 347 flow
[2024-03-11 22:57:05,561 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 335 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-11 22:57:05,562 INFO  L231             Difference]: Finished difference. Result has 51 places, 44 transitions, 188 flow
[2024-03-11 22:57:05,562 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=51, PETRI_TRANSITIONS=44}
[2024-03-11 22:57:05,563 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2024-03-11 22:57:05,563 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 188 flow
[2024-03-11 22:57:05,563 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:05,563 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:05,563 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2024-03-11 22:57:05,563 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-11 22:57:05,563 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-11 22:57:05,564 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:05,564 INFO  L85        PathProgramCache]: Analyzing trace with hash -1624936462, now seen corresponding path program 1 times
[2024-03-11 22:57:05,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:05,564 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143320750]
[2024-03-11 22:57:05,564 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:05,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:05,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:57:05,574 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:57:05,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:57:05,584 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:57:05,584 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:57:05,584 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-11 22:57:05,584 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-11 22:57:05,584 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-11 22:57:05,584 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-11 22:57:05,584 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-11 22:57:05,585 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-11 22:57:05,585 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-11 22:57:05,585 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-11 22:57:05,585 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:05,585 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:57:05,585 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-11 22:57:05,598 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-03-11 22:57:05,600 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 122 places, 119 transitions, 282 flow
[2024-03-11 22:57:05,631 INFO  L130       PetriNetUnfolder]: 42/531 cut-off events.
[2024-03-11 22:57:05,631 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2024-03-11 22:57:05,632 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 586 conditions, 531 events. 42/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2085 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 320. Up to 32 conditions per place. 
[2024-03-11 22:57:05,633 INFO  L82        GeneralOperation]: Start removeDead. Operand has 122 places, 119 transitions, 282 flow
[2024-03-11 22:57:05,634 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 122 places, 119 transitions, 282 flow
[2024-03-11 22:57:05,634 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:57:05,634 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 119 transitions, 282 flow
[2024-03-11 22:57:05,634 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 119 transitions, 282 flow
[2024-03-11 22:57:05,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 122 places, 119 transitions, 282 flow
[2024-03-11 22:57:05,666 INFO  L130       PetriNetUnfolder]: 42/531 cut-off events.
[2024-03-11 22:57:05,666 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2024-03-11 22:57:05,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 586 conditions, 531 events. 42/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2085 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 320. Up to 32 conditions per place. 
[2024-03-11 22:57:05,676 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6888
[2024-03-11 22:57:07,008 INFO  L134        LiptonReduction]: Checked pairs total: 17351
[2024-03-11 22:57:07,008 INFO  L136        LiptonReduction]: Total number of compositions: 76
[2024-03-11 22:57:07,009 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:57:07,009 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;@7e2e5389, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:57:07,009 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-11 22:57:07,010 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2024-03-11 22:57:07,010 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:57:07,010 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:07,010 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-03-11 22:57:07,010 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:07,010 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:07,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 818201, now seen corresponding path program 1 times
[2024-03-11 22:57:07,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:07,011 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589453268]
[2024-03-11 22:57:07,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:07,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:07,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:07,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:57:07,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:07,029 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589453268]
[2024-03-11 22:57:07,029 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589453268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:07,029 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:07,029 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:57:07,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886898185]
[2024-03-11 22:57:07,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:07,030 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:07,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:07,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:07,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:07,043 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 195
[2024-03-11 22:57:07,043 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 136 flow. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:07,043 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:07,043 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 195
[2024-03-11 22:57:07,043 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:09,094 INFO  L130       PetriNetUnfolder]: 26018/38924 cut-off events.
[2024-03-11 22:57:09,095 INFO  L131       PetriNetUnfolder]: For 3846/3846 co-relation queries the response was YES.
[2024-03-11 22:57:09,131 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76589 conditions, 38924 events. 26018/38924 cut-off events. For 3846/3846 co-relation queries the response was YES. Maximal size of possible extension queue 1210. Compared 273684 event pairs, 19152 based on Foata normal form. 0/35999 useless extension candidates. Maximal degree in co-relation 10917. Up to 35539 conditions per place. 
[2024-03-11 22:57:09,239 INFO  L137   encePairwiseOnDemand]: 191/195 looper letters, 37 selfloop transitions, 2 changer transitions 0/51 dead transitions.
[2024-03-11 22:57:09,239 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 224 flow
[2024-03-11 22:57:09,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:09,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:09,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions.
[2024-03-11 22:57:09,241 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6136752136752137
[2024-03-11 22:57:09,241 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 359 transitions.
[2024-03-11 22:57:09,241 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions.
[2024-03-11 22:57:09,241 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:09,241 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions.
[2024-03-11 22:57:09,242 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:09,243 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:09,243 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:09,243 INFO  L175             Difference]: Start difference. First operand has 51 places, 46 transitions, 136 flow. Second operand 3 states and 359 transitions.
[2024-03-11 22:57:09,243 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 224 flow
[2024-03-11 22:57:09,244 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:57:09,245 INFO  L231             Difference]: Finished difference. Result has 53 places, 46 transitions, 146 flow
[2024-03-11 22:57:09,245 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=46}
[2024-03-11 22:57:09,246 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places.
[2024-03-11 22:57:09,246 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 146 flow
[2024-03-11 22:57:09,246 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:09,246 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:09,246 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:09,246 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-11 22:57:09,246 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:09,247 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:09,247 INFO  L85        PathProgramCache]: Analyzing trace with hash 461890703, now seen corresponding path program 1 times
[2024-03-11 22:57:09,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:09,247 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165669419]
[2024-03-11 22:57:09,247 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:09,247 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:09,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:09,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:57:09,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:09,263 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165669419]
[2024-03-11 22:57:09,263 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165669419] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:09,263 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:09,263 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:57:09,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566319158]
[2024-03-11 22:57:09,263 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:09,263 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:09,264 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:09,264 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:09,264 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:09,283 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 195
[2024-03-11 22:57:09,284 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 146 flow. Second operand  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:09,284 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:09,284 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 195
[2024-03-11 22:57:09,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:13,906 INFO  L130       PetriNetUnfolder]: 63239/89865 cut-off events.
[2024-03-11 22:57:13,907 INFO  L131       PetriNetUnfolder]: For 12171/12171 co-relation queries the response was YES.
[2024-03-11 22:57:14,022 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 183282 conditions, 89865 events. 63239/89865 cut-off events. For 12171/12171 co-relation queries the response was YES. Maximal size of possible extension queue 2435. Compared 619750 event pairs, 44385 based on Foata normal form. 0/83611 useless extension candidates. Maximal degree in co-relation 183230. Up to 66785 conditions per place. 
[2024-03-11 22:57:14,298 INFO  L137   encePairwiseOnDemand]: 187/195 looper letters, 62 selfloop transitions, 7 changer transitions 0/77 dead transitions.
[2024-03-11 22:57:14,298 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 383 flow
[2024-03-11 22:57:14,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:14,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:14,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions.
[2024-03-11 22:57:14,300 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.629059829059829
[2024-03-11 22:57:14,301 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 368 transitions.
[2024-03-11 22:57:14,301 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions.
[2024-03-11 22:57:14,301 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:14,301 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions.
[2024-03-11 22:57:14,302 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:14,303 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:14,303 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:14,303 INFO  L175             Difference]: Start difference. First operand has 53 places, 46 transitions, 146 flow. Second operand 3 states and 368 transitions.
[2024-03-11 22:57:14,303 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 383 flow
[2024-03-11 22:57:14,305 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:57:14,306 INFO  L231             Difference]: Finished difference. Result has 56 places, 52 transitions, 198 flow
[2024-03-11 22:57:14,306 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=56, PETRI_TRANSITIONS=52}
[2024-03-11 22:57:14,307 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places.
[2024-03-11 22:57:14,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 198 flow
[2024-03-11 22:57:14,307 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:14,307 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:14,307 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:14,307 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-11 22:57:14,307 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:14,308 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:14,308 INFO  L85        PathProgramCache]: Analyzing trace with hash 1277334436, now seen corresponding path program 1 times
[2024-03-11 22:57:14,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:14,308 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048555384]
[2024-03-11 22:57:14,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:14,308 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:14,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:14,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:57:14,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:14,342 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048555384]
[2024-03-11 22:57:14,342 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048555384] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:14,342 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:14,342 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:57:14,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795242623]
[2024-03-11 22:57:14,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:14,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:57:14,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:14,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:57:14,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:57:14,371 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 195
[2024-03-11 22:57:14,371 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 198 flow. Second operand  has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:14,371 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:14,372 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 195
[2024-03-11 22:57:14,372 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:17,707 INFO  L130       PetriNetUnfolder]: 38334/57310 cut-off events.
[2024-03-11 22:57:17,708 INFO  L131       PetriNetUnfolder]: For 24745/30975 co-relation queries the response was YES.
[2024-03-11 22:57:17,783 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 133333 conditions, 57310 events. 38334/57310 cut-off events. For 24745/30975 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 426467 event pairs, 21787 based on Foata normal form. 3440/57900 useless extension candidates. Maximal degree in co-relation 40685. Up to 34292 conditions per place. 
[2024-03-11 22:57:17,953 INFO  L137   encePairwiseOnDemand]: 191/195 looper letters, 61 selfloop transitions, 3 changer transitions 0/78 dead transitions.
[2024-03-11 22:57:17,954 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 408 flow
[2024-03-11 22:57:17,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:57:17,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:57:17,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions.
[2024-03-11 22:57:17,955 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6064102564102564
[2024-03-11 22:57:17,956 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 473 transitions.
[2024-03-11 22:57:17,956 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions.
[2024-03-11 22:57:17,956 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:17,956 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions.
[2024-03-11 22:57:17,957 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:17,958 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:17,958 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:17,958 INFO  L175             Difference]: Start difference. First operand has 56 places, 52 transitions, 198 flow. Second operand 4 states and 473 transitions.
[2024-03-11 22:57:17,958 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 408 flow
[2024-03-11 22:57:18,012 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:57:18,013 INFO  L231             Difference]: Finished difference. Result has 58 places, 53 transitions, 200 flow
[2024-03-11 22:57:18,013 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=58, PETRI_TRANSITIONS=53}
[2024-03-11 22:57:18,013 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places.
[2024-03-11 22:57:18,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 200 flow
[2024-03-11 22:57:18,014 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:18,014 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:18,014 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:18,014 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-11 22:57:18,014 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:18,014 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:18,014 INFO  L85        PathProgramCache]: Analyzing trace with hash 422619653, now seen corresponding path program 1 times
[2024-03-11 22:57:18,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:18,014 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470585129]
[2024-03-11 22:57:18,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:18,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:18,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:18,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 22:57:18,035 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:18,035 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470585129]
[2024-03-11 22:57:18,035 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470585129] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:18,035 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:18,035 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:57:18,035 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548685173]
[2024-03-11 22:57:18,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:18,035 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:18,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:18,036 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:18,036 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:18,054 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 195
[2024-03-11 22:57:18,054 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 200 flow. Second operand  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:18,054 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:18,054 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 195
[2024-03-11 22:57:18,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:23,221 INFO  L130       PetriNetUnfolder]: 61761/89630 cut-off events.
[2024-03-11 22:57:23,221 INFO  L131       PetriNetUnfolder]: For 43426/44605 co-relation queries the response was YES.
[2024-03-11 22:57:23,342 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 214372 conditions, 89630 events. 61761/89630 cut-off events. For 43426/44605 co-relation queries the response was YES. Maximal size of possible extension queue 2204. Compared 635112 event pairs, 46546 based on Foata normal form. 0/85570 useless extension candidates. Maximal degree in co-relation 77115. Up to 75594 conditions per place. 
[2024-03-11 22:57:23,600 INFO  L137   encePairwiseOnDemand]: 188/195 looper letters, 68 selfloop transitions, 10 changer transitions 0/86 dead transitions.
[2024-03-11 22:57:23,600 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 483 flow
[2024-03-11 22:57:23,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:23,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:23,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions.
[2024-03-11 22:57:23,602 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6256410256410256
[2024-03-11 22:57:23,602 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 366 transitions.
[2024-03-11 22:57:23,602 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions.
[2024-03-11 22:57:23,603 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:23,603 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions.
[2024-03-11 22:57:23,603 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:23,604 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:23,604 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:23,604 INFO  L175             Difference]: Start difference. First operand has 58 places, 53 transitions, 200 flow. Second operand 3 states and 366 transitions.
[2024-03-11 22:57:23,604 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 483 flow
[2024-03-11 22:57:23,812 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:57:23,813 INFO  L231             Difference]: Finished difference. Result has 59 places, 61 transitions, 278 flow
[2024-03-11 22:57:23,814 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=59, PETRI_TRANSITIONS=61}
[2024-03-11 22:57:23,814 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places.
[2024-03-11 22:57:23,814 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 278 flow
[2024-03-11 22:57:23,814 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:23,814 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:23,814 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:23,815 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-11 22:57:23,815 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:23,815 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:23,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345369614, now seen corresponding path program 1 times
[2024-03-11 22:57:23,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:23,815 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620032382]
[2024-03-11 22:57:23,815 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:23,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:23,822 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:23,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:57:23,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:23,850 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620032382]
[2024-03-11 22:57:23,850 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620032382] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:23,850 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:23,850 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:57:23,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886081931]
[2024-03-11 22:57:23,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:23,850 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:23,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:23,851 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:23,851 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:23,875 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 195
[2024-03-11 22:57:23,875 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 278 flow. Second operand  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:23,875 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:23,876 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 195
[2024-03-11 22:57:23,876 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:24,316 INFO  L130       PetriNetUnfolder]: 2892/6733 cut-off events.
[2024-03-11 22:57:24,316 INFO  L131       PetriNetUnfolder]: For 5552/5590 co-relation queries the response was YES.
[2024-03-11 22:57:24,325 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17320 conditions, 6733 events. 2892/6733 cut-off events. For 5552/5590 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 57260 event pairs, 659 based on Foata normal form. 2073/8642 useless extension candidates. Maximal degree in co-relation 6273. Up to 4336 conditions per place. 
[2024-03-11 22:57:24,337 INFO  L137   encePairwiseOnDemand]: 187/195 looper letters, 47 selfloop transitions, 9 changer transitions 0/68 dead transitions.
[2024-03-11 22:57:24,337 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 410 flow
[2024-03-11 22:57:24,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:24,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:24,339 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions.
[2024-03-11 22:57:24,339 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6
[2024-03-11 22:57:24,339 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 351 transitions.
[2024-03-11 22:57:24,339 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions.
[2024-03-11 22:57:24,340 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:24,340 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions.
[2024-03-11 22:57:24,340 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:24,341 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:24,341 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:24,341 INFO  L175             Difference]: Start difference. First operand has 59 places, 61 transitions, 278 flow. Second operand 3 states and 351 transitions.
[2024-03-11 22:57:24,341 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 410 flow
[2024-03-11 22:57:24,351 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 403 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-03-11 22:57:24,352 INFO  L231             Difference]: Finished difference. Result has 60 places, 52 transitions, 226 flow
[2024-03-11 22:57:24,352 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=60, PETRI_TRANSITIONS=52}
[2024-03-11 22:57:24,352 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places.
[2024-03-11 22:57:24,352 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 226 flow
[2024-03-11 22:57:24,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:24,353 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:24,353 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:24,353 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-11 22:57:24,353 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:24,353 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:24,353 INFO  L85        PathProgramCache]: Analyzing trace with hash 1727818670, now seen corresponding path program 1 times
[2024-03-11 22:57:24,353 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:24,353 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833936835]
[2024-03-11 22:57:24,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:24,354 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:24,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:24,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-03-11 22:57:24,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:24,372 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833936835]
[2024-03-11 22:57:24,372 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833936835] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:24,372 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:24,372 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:57:24,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229961502]
[2024-03-11 22:57:24,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:24,373 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:24,373 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:24,373 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:24,373 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:24,400 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 195
[2024-03-11 22:57:24,400 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 226 flow. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:24,401 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:24,401 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 195
[2024-03-11 22:57:24,401 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:24,872 INFO  L130       PetriNetUnfolder]: 3391/7796 cut-off events.
[2024-03-11 22:57:24,873 INFO  L131       PetriNetUnfolder]: For 6336/6374 co-relation queries the response was YES.
[2024-03-11 22:57:24,884 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20996 conditions, 7796 events. 3391/7796 cut-off events. For 6336/6374 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 65692 event pairs, 3007 based on Foata normal form. 0/7409 useless extension candidates. Maximal degree in co-relation 5279. Up to 6329 conditions per place. 
[2024-03-11 22:57:24,900 INFO  L137   encePairwiseOnDemand]: 191/195 looper letters, 54 selfloop transitions, 3 changer transitions 0/65 dead transitions.
[2024-03-11 22:57:24,900 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 400 flow
[2024-03-11 22:57:24,901 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:24,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:24,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions.
[2024-03-11 22:57:24,902 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5982905982905983
[2024-03-11 22:57:24,902 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 350 transitions.
[2024-03-11 22:57:24,902 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions.
[2024-03-11 22:57:24,902 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:24,902 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions.
[2024-03-11 22:57:24,903 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:24,904 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:24,904 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:24,904 INFO  L175             Difference]: Start difference. First operand has 60 places, 52 transitions, 226 flow. Second operand 3 states and 350 transitions.
[2024-03-11 22:57:24,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 400 flow
[2024-03-11 22:57:24,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:57:24,911 INFO  L231             Difference]: Finished difference. Result has 62 places, 54 transitions, 242 flow
[2024-03-11 22:57:24,911 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=62, PETRI_TRANSITIONS=54}
[2024-03-11 22:57:24,912 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places.
[2024-03-11 22:57:24,912 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 242 flow
[2024-03-11 22:57:24,912 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:24,912 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:24,912 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:24,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-11 22:57:24,913 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:24,913 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:24,913 INFO  L85        PathProgramCache]: Analyzing trace with hash 948274906, now seen corresponding path program 1 times
[2024-03-11 22:57:24,913 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:24,913 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408080374]
[2024-03-11 22:57:24,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:24,913 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:24,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:24,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 22:57:24,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:24,958 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408080374]
[2024-03-11 22:57:24,958 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408080374] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:24,958 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:24,958 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:57:24,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856784512]
[2024-03-11 22:57:24,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:24,959 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:24,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:24,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:24,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:24,982 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 195
[2024-03-11 22:57:24,983 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 242 flow. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:24,983 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:24,983 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 195
[2024-03-11 22:57:24,983 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:25,721 INFO  L130       PetriNetUnfolder]: 4657/10054 cut-off events.
[2024-03-11 22:57:25,722 INFO  L131       PetriNetUnfolder]: For 8934/8991 co-relation queries the response was YES.
[2024-03-11 22:57:25,737 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27767 conditions, 10054 events. 4657/10054 cut-off events. For 8934/8991 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 83633 event pairs, 2809 based on Foata normal form. 0/9753 useless extension candidates. Maximal degree in co-relation 9817. Up to 6857 conditions per place. 
[2024-03-11 22:57:25,755 INFO  L137   encePairwiseOnDemand]: 188/195 looper letters, 60 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2024-03-11 22:57:25,755 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 460 flow
[2024-03-11 22:57:25,756 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:25,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:25,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2024-03-11 22:57:25,757 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6273504273504273
[2024-03-11 22:57:25,757 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2024-03-11 22:57:25,757 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2024-03-11 22:57:25,757 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:25,757 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2024-03-11 22:57:25,758 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:25,758 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:25,759 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:25,759 INFO  L175             Difference]: Start difference. First operand has 62 places, 54 transitions, 242 flow. Second operand 3 states and 367 transitions.
[2024-03-11 22:57:25,759 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 460 flow
[2024-03-11 22:57:25,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 451 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-03-11 22:57:25,768 INFO  L231             Difference]: Finished difference. Result has 65 places, 59 transitions, 311 flow
[2024-03-11 22:57:25,768 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=59}
[2024-03-11 22:57:25,769 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places.
[2024-03-11 22:57:25,769 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 311 flow
[2024-03-11 22:57:25,769 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:25,769 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:25,769 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:25,769 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-03-11 22:57:25,769 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:25,769 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:25,769 INFO  L85        PathProgramCache]: Analyzing trace with hash 441686513, now seen corresponding path program 1 times
[2024-03-11 22:57:25,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:25,770 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589687009]
[2024-03-11 22:57:25,770 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:25,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:25,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:25,831 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:57:25,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:25,831 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589687009]
[2024-03-11 22:57:25,831 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589687009] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:57:25,831 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099503788]
[2024-03-11 22:57:25,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:25,832 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:57:25,832 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:57:25,834 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)
[2024-03-11 22:57:25,849 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
[2024-03-11 22:57:25,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:25,936 INFO  L263         TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core
[2024-03-11 22:57:25,939 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:57:26,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:57:26,071 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-11 22:57:26,071 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099503788] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:26,071 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-11 22:57:26,071 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11
[2024-03-11 22:57:26,071 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409731064]
[2024-03-11 22:57:26,071 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:26,072 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-11 22:57:26,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:26,072 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-11 22:57:26,072 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132
[2024-03-11 22:57:26,106 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 195
[2024-03-11 22:57:26,107 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 311 flow. Second operand  has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:26,107 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:26,107 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 195
[2024-03-11 22:57:26,107 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:26,760 INFO  L130       PetriNetUnfolder]: 3751/9031 cut-off events.
[2024-03-11 22:57:26,760 INFO  L131       PetriNetUnfolder]: For 9473/10229 co-relation queries the response was YES.
[2024-03-11 22:57:26,775 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25852 conditions, 9031 events. 3751/9031 cut-off events. For 9473/10229 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 80588 event pairs, 496 based on Foata normal form. 556/9451 useless extension candidates. Maximal degree in co-relation 11816. Up to 5598 conditions per place. 
[2024-03-11 22:57:26,791 INFO  L137   encePairwiseOnDemand]: 192/195 looper letters, 109 selfloop transitions, 5 changer transitions 10/139 dead transitions.
[2024-03-11 22:57:26,791 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 139 transitions, 899 flow
[2024-03-11 22:57:26,791 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-11 22:57:26,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-11 22:57:26,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions.
[2024-03-11 22:57:26,793 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6131868131868132
[2024-03-11 22:57:26,793 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 837 transitions.
[2024-03-11 22:57:26,793 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions.
[2024-03-11 22:57:26,793 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:26,794 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions.
[2024-03-11 22:57:26,795 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:26,796 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:26,797 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:26,797 INFO  L175             Difference]: Start difference. First operand has 65 places, 59 transitions, 311 flow. Second operand 7 states and 837 transitions.
[2024-03-11 22:57:26,797 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 139 transitions, 899 flow
[2024-03-11 22:57:26,812 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 139 transitions, 861 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-03-11 22:57:26,813 INFO  L231             Difference]: Finished difference. Result has 67 places, 60 transitions, 300 flow
[2024-03-11 22:57:26,813 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=67, PETRI_TRANSITIONS=60}
[2024-03-11 22:57:26,813 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places.
[2024-03-11 22:57:26,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 300 flow
[2024-03-11 22:57:26,814 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:26,814 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:26,814 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:26,830 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
[2024-03-11 22:57:27,015 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2024-03-11 22:57:27,016 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:27,016 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:27,017 INFO  L85        PathProgramCache]: Analyzing trace with hash 446996961, now seen corresponding path program 1 times
[2024-03-11 22:57:27,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:27,017 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589643618]
[2024-03-11 22:57:27,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:27,017 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:27,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:27,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2024-03-11 22:57:27,042 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:27,042 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589643618]
[2024-03-11 22:57:27,042 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589643618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:57:27,042 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:57:27,043 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:57:27,043 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710360353]
[2024-03-11 22:57:27,043 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:57:27,044 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:57:27,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:27,044 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:57:27,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:57:27,066 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 195
[2024-03-11 22:57:27,067 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:27,067 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:27,067 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 195
[2024-03-11 22:57:27,067 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:27,700 INFO  L130       PetriNetUnfolder]: 4370/10023 cut-off events.
[2024-03-11 22:57:27,700 INFO  L131       PetriNetUnfolder]: For 12467/12545 co-relation queries the response was YES.
[2024-03-11 22:57:27,718 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29616 conditions, 10023 events. 4370/10023 cut-off events. For 12467/12545 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 88390 event pairs, 3427 based on Foata normal form. 0/9748 useless extension candidates. Maximal degree in co-relation 6410. Up to 8591 conditions per place. 
[2024-03-11 22:57:27,736 INFO  L137   encePairwiseOnDemand]: 191/195 looper letters, 58 selfloop transitions, 4 changer transitions 1/71 dead transitions.
[2024-03-11 22:57:27,736 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 480 flow
[2024-03-11 22:57:27,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:57:27,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:57:27,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions.
[2024-03-11 22:57:27,737 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5948717948717949
[2024-03-11 22:57:27,737 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 348 transitions.
[2024-03-11 22:57:27,737 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions.
[2024-03-11 22:57:27,738 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:27,738 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions.
[2024-03-11 22:57:27,738 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:27,739 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:27,739 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:27,739 INFO  L175             Difference]: Start difference. First operand has 67 places, 60 transitions, 300 flow. Second operand 3 states and 348 transitions.
[2024-03-11 22:57:27,739 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 480 flow
[2024-03-11 22:57:27,746 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 22:57:27,747 INFO  L231             Difference]: Finished difference. Result has 68 places, 62 transitions, 329 flow
[2024-03-11 22:57:27,747 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=68, PETRI_TRANSITIONS=62}
[2024-03-11 22:57:27,748 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places.
[2024-03-11 22:57:27,748 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 329 flow
[2024-03-11 22:57:27,748 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:27,748 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:27,748 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:27,748 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-11 22:57:27,749 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:27,749 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:27,749 INFO  L85        PathProgramCache]: Analyzing trace with hash -1700190220, now seen corresponding path program 1 times
[2024-03-11 22:57:27,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:27,749 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059812856]
[2024-03-11 22:57:27,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:27,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:27,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:27,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:57:27,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:27,805 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059812856]
[2024-03-11 22:57:27,805 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059812856] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:57:27,805 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747952981]
[2024-03-11 22:57:27,805 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:27,805 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:57:27,805 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:57:27,810 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)
[2024-03-11 22:57:27,813 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
[2024-03-11 22:57:27,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:27,912 INFO  L263         TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-11 22:57:27,913 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:57:27,974 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:57:27,974 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:57:28,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:57:28,004 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747952981] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:57:28,004 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:57:28,004 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2024-03-11 22:57:28,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888371086]
[2024-03-11 22:57:28,004 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:57:28,004 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-11 22:57:28,004 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:28,005 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-11 22:57:28,005 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72
[2024-03-11 22:57:28,039 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 195
[2024-03-11 22:57:28,040 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 329 flow. Second operand  has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:28,040 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:28,040 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 195
[2024-03-11 22:57:28,040 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:28,792 INFO  L130       PetriNetUnfolder]: 3198/7514 cut-off events.
[2024-03-11 22:57:28,792 INFO  L131       PetriNetUnfolder]: For 9553/10123 co-relation queries the response was YES.
[2024-03-11 22:57:28,804 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21885 conditions, 7514 events. 3198/7514 cut-off events. For 9553/10123 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 64512 event pairs, 427 based on Foata normal form. 369/7645 useless extension candidates. Maximal degree in co-relation 7441. Up to 5705 conditions per place. 
[2024-03-11 22:57:28,814 INFO  L137   encePairwiseOnDemand]: 192/195 looper letters, 86 selfloop transitions, 5 changer transitions 0/106 dead transitions.
[2024-03-11 22:57:28,814 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 663 flow
[2024-03-11 22:57:28,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:57:28,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:57:28,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 701 transitions.
[2024-03-11 22:57:28,817 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5991452991452991
[2024-03-11 22:57:28,817 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 701 transitions.
[2024-03-11 22:57:28,817 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 701 transitions.
[2024-03-11 22:57:28,818 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:28,818 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 701 transitions.
[2024-03-11 22:57:28,819 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:28,820 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:28,821 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:28,821 INFO  L175             Difference]: Start difference. First operand has 68 places, 62 transitions, 329 flow. Second operand 6 states and 701 transitions.
[2024-03-11 22:57:28,821 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 663 flow
[2024-03-11 22:57:28,832 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 106 transitions, 645 flow, removed 6 selfloop flow, removed 1 redundant places.
[2024-03-11 22:57:28,833 INFO  L231             Difference]: Finished difference. Result has 75 places, 62 transitions, 335 flow
[2024-03-11 22:57:28,833 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=75, PETRI_TRANSITIONS=62}
[2024-03-11 22:57:28,833 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places.
[2024-03-11 22:57:28,833 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 335 flow
[2024-03-11 22:57:28,838 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:28,838 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:28,838 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:28,843 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-11 22:57:29,043 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:57:29,044 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:29,044 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:29,044 INFO  L85        PathProgramCache]: Analyzing trace with hash 1531619191, now seen corresponding path program 1 times
[2024-03-11 22:57:29,045 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:29,045 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879151328]
[2024-03-11 22:57:29,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:29,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:29,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:29,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-03-11 22:57:29,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:57:29,146 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879151328]
[2024-03-11 22:57:29,146 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879151328] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:57:29,146 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492252610]
[2024-03-11 22:57:29,146 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:29,146 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:57:29,147 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:57:29,148 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)
[2024-03-11 22:57:29,150 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
[2024-03-11 22:57:29,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:57:29,248 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-11 22:57:29,249 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:57:29,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-03-11 22:57:29,335 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:57:29,415 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-03-11 22:57:29,415 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [492252610] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:57:29,416 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:57:29,416 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2024-03-11 22:57:29,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411291011]
[2024-03-11 22:57:29,417 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:57:29,419 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-11 22:57:29,419 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:57:29,419 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-11 22:57:29,419 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72
[2024-03-11 22:57:29,514 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 195
[2024-03-11 22:57:29,515 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 335 flow. Second operand  has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:29,515 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:57:29,515 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 195
[2024-03-11 22:57:29,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:30,102 INFO  L130       PetriNetUnfolder]: 1799/3965 cut-off events.
[2024-03-11 22:57:30,102 INFO  L131       PetriNetUnfolder]: For 8622/9063 co-relation queries the response was YES.
[2024-03-11 22:57:30,110 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11391 conditions, 3965 events. 1799/3965 cut-off events. For 8622/9063 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 27205 event pairs, 407 based on Foata normal form. 591/4544 useless extension candidates. Maximal degree in co-relation 4865. Up to 1090 conditions per place. 
[2024-03-11 22:57:30,117 INFO  L137   encePairwiseOnDemand]: 190/195 looper letters, 99 selfloop transitions, 5 changer transitions 7/125 dead transitions.
[2024-03-11 22:57:30,117 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 125 transitions, 781 flow
[2024-03-11 22:57:30,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:57:30,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:57:30,119 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions.
[2024-03-11 22:57:30,120 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6128205128205129
[2024-03-11 22:57:30,120 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 717 transitions.
[2024-03-11 22:57:30,120 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions.
[2024-03-11 22:57:30,120 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:30,120 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions.
[2024-03-11 22:57:30,121 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:30,123 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:30,123 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:30,123 INFO  L175             Difference]: Start difference. First operand has 75 places, 62 transitions, 335 flow. Second operand 6 states and 717 transitions.
[2024-03-11 22:57:30,123 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 125 transitions, 781 flow
[2024-03-11 22:57:30,128 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 125 transitions, 771 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-11 22:57:30,129 INFO  L231             Difference]: Finished difference. Result has 78 places, 57 transitions, 343 flow
[2024-03-11 22:57:30,129 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=78, PETRI_TRANSITIONS=57}
[2024-03-11 22:57:30,131 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places.
[2024-03-11 22:57:30,131 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 343 flow
[2024-03-11 22:57:30,131 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:30,131 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:57:30,132 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:30,138 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-11 22:57:30,333 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2024-03-11 22:57:30,333 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-11 22:57:30,334 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:57:30,334 INFO  L85        PathProgramCache]: Analyzing trace with hash 577691794, now seen corresponding path program 1 times
[2024-03-11 22:57:30,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:57:30,334 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154718387]
[2024-03-11 22:57:30,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:57:30,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:57:30,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:57:30,420 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:57:30,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:57:30,458 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:57:30,458 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:57:30,458 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining)
[2024-03-11 22:57:30,458 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-03-11 22:57:30,458 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-03-11 22:57:30,458 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2024-03-11 22:57:30,458 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-03-11 22:57:30,459 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-03-11 22:57:30,459 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-03-11 22:57:30,459 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-03-11 22:57:30,459 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-03-11 22:57:30,459 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:57:30,462 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances
[2024-03-11 22:57:30,463 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-11 22:57:30,520 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 10:57:30 BasicIcfg
[2024-03-11 22:57:30,520 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-11 22:57:30,521 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-11 22:57:30,521 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2024-03-11 22:57:30,521 INFO  L275        PluginConnector]: Witness Printer initialized
[2024-03-11 22:57:30,521 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:56:57" (3/4) ...
[2024-03-11 22:57:30,523 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-11 22:57:30,524 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-11 22:57:30,524 INFO  L158              Benchmark]: Toolchain (without parser) took 33461.12ms. Allocated memory was 142.6MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 99.3MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB.
[2024-03-11 22:57:30,524 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 22:57:30,524 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 287.75ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 80.9MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-03-11 22:57:30,525 INFO  L158              Benchmark]: Boogie Procedure Inliner took 31.05ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 78.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 22:57:30,525 INFO  L158              Benchmark]: Boogie Preprocessor took 20.29ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 22:57:30,525 INFO  L158              Benchmark]: RCFGBuilder took 298.17ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 64.5MB in the end (delta: 12.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-03-11 22:57:30,525 INFO  L158              Benchmark]: TraceAbstraction took 32816.25ms. Allocated memory was 142.6MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 63.6MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB.
[2024-03-11 22:57:30,525 INFO  L158              Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 8.4GB. Free memory is still 6.2GB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 22:57:30,526 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 287.75ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 80.9MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 31.05ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 78.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 20.29ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB.
 * RCFGBuilder took 298.17ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 64.5MB in the end (delta: 12.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 32816.25ms. Allocated memory was 142.6MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 63.6MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB.
 * Witness Printer took 2.75ms. Allocated memory is still 8.4GB. Free memory is still 6.2GB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.5s, 71 PlacesBefore, 20 PlacesAfterwards, 71 TransitionsBefore, 18 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 21 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 57 TotalNumberOfCompositions, 1633 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1004, independent: 917, independent conditional: 0, independent unconditional: 917, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 475, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1004, independent: 456, independent conditional: 0, independent unconditional: 456, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 475, unknown conditional: 0, unknown unconditional: 475] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.2s, 88 PlacesBefore, 33 PlacesAfterwards, 87 TransitionsBefore, 30 TransitionsAfterwards, 2492 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 60 TotalNumberOfCompositions, 5801 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3531, independent: 3364, independent conditional: 0, independent unconditional: 3364, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1320, independent: 1291, independent conditional: 0, independent unconditional: 1291, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3531, independent: 2073, independent conditional: 0, independent unconditional: 2073, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 1320, unknown conditional: 0, unknown unconditional: 1320] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.3s, 105 PlacesBefore, 42 PlacesAfterwards, 103 TransitionsBefore, 38 TransitionsAfterwards, 4452 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 69 TotalNumberOfCompositions, 10175 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5900, independent: 5702, independent conditional: 0, independent unconditional: 5702, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2314, independent: 2274, independent conditional: 0, independent unconditional: 2274, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5900, independent: 3428, independent conditional: 0, independent unconditional: 3428, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 2314, unknown conditional: 0, unknown unconditional: 2314] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 226, Positive conditional cache size: 0, Positive unconditional cache size: 226, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.4s, 122 PlacesBefore, 51 PlacesAfterwards, 119 TransitionsBefore, 46 TransitionsAfterwards, 6888 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 76 TotalNumberOfCompositions, 17351 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8408, independent: 8146, independent conditional: 0, independent unconditional: 8146, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3461, independent: 3401, independent conditional: 0, independent unconditional: 3401, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8408, independent: 4745, independent conditional: 0, independent unconditional: 4745, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 3461, unknown conditional: 0, unknown unconditional: 3461] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 357, Positive conditional cache size: 0, Positive unconditional cache size: 357, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 678]: Data race detected
    Data race detected
The following path leads to a data race: 
[L674]               0  int data = 0;
[L675]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
[L683]               0  int breads_total = 4;
[L684]               0  pthread_t tids[4];
[L685]               0  int i = 0;
        VAL             [breads_total=4, data=0, data_mutex={1:0}, i=0, tids={13:0}]
[L685]  COND TRUE    0  i < breads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=-2, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={13:0}]
[L685]  COND TRUE    0  i < breads_total
[L678]               1  data = __VERIFIER_nondet_int()
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=-3, data = __VERIFIER_nondet_int()=28, data_mutex={1:0}, i=1, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=-1, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=-3, data = __VERIFIER_nondet_int()=28, data_mutex={1:0}, i=2, tids={13:0}]
[L685]  COND TRUE    0  i < breads_total
[L680]               1  return ((void *)0);
[L678]               2  data = __VERIFIER_nondet_int()
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=0, tids={13:0}]
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, tids={13:0}]
[L685]  COND TRUE    0  i < breads_total
[L680]               2  return ((void *)0);
[L678]               3  data = __VERIFIER_nondet_int()
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=1, tids={13:0}]
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, tids={13:0}]
[L680]               3  return ((void *)0);
[L678]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L685]  COND FALSE   0  !(i < breads_total)
[L688]               0  int i = 0;
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, i=4, tids={13:0}]
[L688]  COND TRUE    0  i < breads_total - 1
[L689]  EXPR         0  tids[i]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, i=4, tids={13:0}, tids[i]=-2]
[L689]  FCALL, JOIN  1  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, i=0, tids={13:0}, tids[i]=-2]
[L688]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, i=4, tids={13:0}]
[L688]  COND TRUE    0  i < breads_total - 1
[L689]  EXPR         0  tids[i]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, i=1, tids={13:0}, tids[i]=-1]
[L689]  FCALL, JOIN  2  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, i=4, tids={13:0}, tids[i]=-1]
[L688]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, i=4, tids={13:0}]
[L688]  COND TRUE    0  i < breads_total - 1
[L689]  EXPR         0  tids[i]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, i=4, tids={13:0}, tids[i]=0]
[L689]  FCALL, JOIN  3  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, i=2, tids={13:0}, tids[i]=0]
[L688]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, i=3, tids={13:0}]
[L688]  COND FALSE   0  !(i < breads_total - 1)
[L691]               0  return data;
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=4, data=0, data = __VERIFIER_nondet_int()=26, data_mutex={1:0}, i=4, i=3, tids={13:0}]
[L678]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=26, data_mutex={1:0}]

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

  - UnprovableResult [Line: 691]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 689]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 686]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 84 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 20 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 99 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 13 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances
    CFG has 5 procedures, 114 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 2 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 86 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances
    CFG has 6 procedures, 129 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.9s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 962 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 712 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1648 IncrementalHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 56 mSDtfsCounter, 1648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=11, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 918 SizeOfPredicates, 6 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 171/205 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-03-11 22:57:30,604 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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