./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/per-thread-array-index-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/per-thread-array-index-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 51414ee3807ca1fd23d912ce863e20c8474e29a0fd6d368c05bcc9b8c4cb2be2
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-27 12:18:30,469 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-27 12:18:30,471 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-27 12:18:30,511 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-27 12:18:30,519 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-27 12:18:30,522 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-27 12:18:30,524 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-27 12:18:30,531 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-27 12:18:30,532 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-27 12:18:30,533 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-27 12:18:30,534 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-27 12:18:30,534 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-27 12:18:30,535 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-27 12:18:30,536 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-27 12:18:30,536 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-27 12:18:30,555 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-27 12:18:30,556 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-27 12:18:30,560 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-27 12:18:30,561 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-27 12:18:30,568 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-27 12:18:30,570 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-27 12:18:30,572 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-27 12:18:30,573 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-27 12:18:30,574 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-27 12:18:30,576 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-27 12:18:30,577 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-27 12:18:30,577 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-27 12:18:30,578 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-27 12:18:30,578 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-27 12:18:30,579 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-27 12:18:30,579 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-27 12:18:30,580 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-27 12:18:30,581 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-27 12:18:30,582 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-27 12:18:30,582 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-27 12:18:30,582 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-27 12:18:30,583 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-27 12:18:30,597 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-27 12:18:30,598 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-27 12:18:30,599 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-27 12:18:30,599 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-27 12:18:30,600 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-27 12:18:30,644 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-27 12:18:30,644 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-27 12:18:30,644 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-27 12:18:30,645 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-27 12:18:30,645 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-27 12:18:30,645 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-27 12:18:30,646 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-27 12:18:30,646 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-27 12:18:30,646 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-27 12:18:30,647 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-27 12:18:30,647 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-27 12:18:30,647 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-27 12:18:30,648 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-27 12:18:30,648 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-27 12:18:30,648 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-27 12:18:30,648 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-27 12:18:30,648 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-27 12:18:30,648 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-27 12:18:30,649 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-27 12:18:30,649 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-27 12:18:30,649 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-27 12:18:30,649 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-27 12:18:30,649 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-27 12:18:30,649 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-27 12:18:30,650 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-27 12:18:30,650 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-27 12:18:30,650 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:18:30,650 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-27 12:18:30,650 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-27 12:18:30,650 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-27 12:18:30,651 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-27 12:18:30,651 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-27 12:18:30,651 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-27 12:18:30,652 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-27 12:18:30,652 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-27 12:18:30,652 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-27 12:18:30,652 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-27 12:18:30,652 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 -> 51414ee3807ca1fd23d912ce863e20c8474e29a0fd6d368c05bcc9b8c4cb2be2
[2023-10-27 12:18:31,020 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-27 12:18:31,052 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-27 12:18:31,054 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-27 12:18:31,055 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-27 12:18:31,055 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-27 12:18:31,056 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2023-10-27 12:18:32,720 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-27 12:18:33,103 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-27 12:18:33,117 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2023-10-27 12:18:33,141 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/d2db8a70f/d1ee19738d104f84a70ea5485ece1e88/FLAGc9a6129c7
[2023-10-27 12:18:33,156 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/d2db8a70f/d1ee19738d104f84a70ea5485ece1e88
[2023-10-27 12:18:33,159 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-27 12:18:33,162 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-27 12:18:33,169 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-27 12:18:33,169 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-27 12:18:33,172 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-27 12:18:33,173 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:33,184 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1fe750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33, skipping insertion in model container
[2023-10-27 12:18:33,184 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:33,194 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-27 12:18:33,251 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-27 12:18:33,497 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:18:33,799 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:18:33,806 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-27 12:18:33,841 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:18:33,876 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:18:33,953 INFO  L208         MainTranslator]: Completed translation
[2023-10-27 12:18:33,969 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33 WrapperNode
[2023-10-27 12:18:33,969 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-27 12:18:33,971 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-27 12:18:33,971 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-27 12:18:33,971 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-27 12:18:33,983 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:33,996 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:34,037 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2023-10-27 12:18:34,038 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-27 12:18:34,038 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-27 12:18:34,038 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-27 12:18:34,039 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-27 12:18:34,046 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:34,046 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:34,064 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:34,069 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:34,083 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:34,086 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:34,087 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:34,088 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:34,103 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-27 12:18:34,104 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-27 12:18:34,104 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-27 12:18:34,104 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-27 12:18:34,105 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:34,109 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:18:34,119 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:18:34,163 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-27 12:18:34,185 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-27 12:18:34,190 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-27 12:18:34,190 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-27 12:18:34,191 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-27 12:18:34,191 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-27 12:18:34,191 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-27 12:18:34,191 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-27 12:18:34,204 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-27 12:18:34,204 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-27 12:18:34,204 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-27 12:18:34,204 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-27 12:18:34,205 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-27 12:18:34,206 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-27 12:18:34,411 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-27 12:18:34,413 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-27 12:18:34,841 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-27 12:18:34,863 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-27 12:18:34,865 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-27 12:18:34,867 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:18:34 BoogieIcfgContainer
[2023-10-27 12:18:34,868 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-27 12:18:34,869 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-27 12:18:34,870 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-27 12:18:34,872 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-27 12:18:34,872 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:18:33" (1/3) ...
[2023-10-27 12:18:34,873 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c1c934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:18:34, skipping insertion in model container
[2023-10-27 12:18:34,873 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33" (2/3) ...
[2023-10-27 12:18:34,874 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c1c934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:18:34, skipping insertion in model container
[2023-10-27 12:18:34,874 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:18:34" (3/3) ...
[2023-10-27 12:18:34,875 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i
[2023-10-27 12:18:34,890 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-27 12:18:34,906 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-27 12:18:34,907 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-10-27 12:18:34,907 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-27 12:18:35,035 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-27 12:18:35,111 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2023-10-27 12:18:35,212 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2023-10-27 12:18:35,229 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:18:35,234 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 341 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-10-27 12:18:35,240 INFO  L82        GeneralOperation]: Start removeDead. Operand has 115 places, 116 transitions, 240 flow
[2023-10-27 12:18:35,245 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 115 places, 116 transitions, 240 flow
[2023-10-27 12:18:35,259 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:18:35,268 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 116 transitions, 240 flow
[2023-10-27 12:18:35,270 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 116 transitions, 240 flow
[2023-10-27 12:18:35,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2023-10-27 12:18:35,364 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2023-10-27 12:18:35,364 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:18:35,365 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 341 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-10-27 12:18:35,367 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2166
[2023-10-27 12:18:38,593 INFO  L134        LiptonReduction]: Checked pairs total: 11903
[2023-10-27 12:18:38,593 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-10-27 12:18:38,618 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:18:38,641 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;@42c43cb1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:18:38,641 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-10-27 12:18:38,643 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-10-27 12:18:38,644 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:18:38,644 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:38,645 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-27 12:18:38,645 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:38,650 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:38,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 384, now seen corresponding path program 1 times
[2023-10-27 12:18:38,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:38,674 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333990186]
[2023-10-27 12:18:38,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:38,675 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:38,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:38,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:38,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:38,855 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333990186]
[2023-10-27 12:18:38,856 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333990186] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:38,856 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:38,856 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-27 12:18:38,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690463829]
[2023-10-27 12:18:38,858 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:38,879 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:18:38,879 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:38,907 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:18:38,912 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:18:38,918 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 194
[2023-10-27 12:18:38,920 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 108 flow. Second operand  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:38,933 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:38,933 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 194
[2023-10-27 12:18:38,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:39,035 INFO  L130       PetriNetUnfolder]: 29/222 cut-off events.
[2023-10-27 12:18:39,036 INFO  L131       PetriNetUnfolder]: For 6/8 co-relation queries the response was YES.
[2023-10-27 12:18:39,038 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308 conditions, 222 events. 29/222 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1154 event pairs, 28 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 249. Up to 78 conditions per place. 
[2023-10-27 12:18:39,040 INFO  L137   encePairwiseOnDemand]: 193/194 looper letters, 15 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2023-10-27 12:18:39,040 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 136 flow
[2023-10-27 12:18:39,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:18:39,043 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:18:39,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions.
[2023-10-27 12:18:39,070 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6134020618556701
[2023-10-27 12:18:39,070 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 238 transitions.
[2023-10-27 12:18:39,071 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions.
[2023-10-27 12:18:39,073 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:39,075 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions.
[2023-10-27 12:18:39,080 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:39,085 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:39,085 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:39,086 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 238 transitions.
[2023-10-27 12:18:39,087 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 136 flow
[2023-10-27 12:18:39,095 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:39,096 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2023-10-27 12:18:39,098 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=49}
[2023-10-27 12:18:39,101 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2023-10-27 12:18:39,101 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2023-10-27 12:18:39,101 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:39,117 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:39,117 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:39,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-27 12:18:39,118 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:39,119 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:39,119 INFO  L85        PathProgramCache]: Analyzing trace with hash 1667475177, now seen corresponding path program 1 times
[2023-10-27 12:18:39,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:39,122 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808041003]
[2023-10-27 12:18:39,123 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:39,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:39,220 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:39,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:39,888 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:39,889 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808041003]
[2023-10-27 12:18:39,889 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808041003] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:39,890 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:39,893 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:39,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818521295]
[2023-10-27 12:18:39,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:39,894 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:39,894 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:39,895 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:39,896 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:40,152 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 194
[2023-10-27 12:18:40,154 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 106 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,155 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:40,155 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 194
[2023-10-27 12:18:40,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:40,407 INFO  L130       PetriNetUnfolder]: 212/632 cut-off events.
[2023-10-27 12:18:40,408 INFO  L131       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2023-10-27 12:18:40,410 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 632 events. 212/632 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3642 event pairs, 63 based on Foata normal form. 1/588 useless extension candidates. Maximal degree in co-relation 1154. Up to 276 conditions per place. 
[2023-10-27 12:18:40,430 INFO  L137   encePairwiseOnDemand]: 171/194 looper letters, 57 selfloop transitions, 29 changer transitions 0/100 dead transitions.
[2023-10-27 12:18:40,430 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 100 transitions, 383 flow
[2023-10-27 12:18:40,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:40,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:40,434 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions.
[2023-10-27 12:18:40,435 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5197594501718213
[2023-10-27 12:18:40,435 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 605 transitions.
[2023-10-27 12:18:40,435 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions.
[2023-10-27 12:18:40,435 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:40,436 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions.
[2023-10-27 12:18:40,438 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,441 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,441 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,442 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 605 transitions.
[2023-10-27 12:18:40,442 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 100 transitions, 383 flow
[2023-10-27 12:18:40,443 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 100 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:40,445 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2023-10-27 12:18:40,445 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=62, PETRI_TRANSITIONS=78}
[2023-10-27 12:18:40,446 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2023-10-27 12:18:40,446 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2023-10-27 12:18:40,446 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,446 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:40,447 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:40,447 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-27 12:18:40,455 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:40,456 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:40,456 INFO  L85        PathProgramCache]: Analyzing trace with hash -946268794, now seen corresponding path program 1 times
[2023-10-27 12:18:40,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:40,457 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099569544]
[2023-10-27 12:18:40,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:40,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:40,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:40,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:40,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:40,505 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099569544]
[2023-10-27 12:18:40,505 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099569544] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:40,506 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:40,506 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:18:40,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071186041]
[2023-10-27 12:18:40,507 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:40,507 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:18:40,507 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:40,508 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:18:40,508 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:18:40,531 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 194
[2023-10-27 12:18:40,531 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,532 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:40,532 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 194
[2023-10-27 12:18:40,532 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:40,650 INFO  L130       PetriNetUnfolder]: 128/491 cut-off events.
[2023-10-27 12:18:40,655 INFO  L131       PetriNetUnfolder]: For 115/126 co-relation queries the response was YES.
[2023-10-27 12:18:40,657 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 491 events. 128/491 cut-off events. For 115/126 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2713 event pairs, 10 based on Foata normal form. 14/475 useless extension candidates. Maximal degree in co-relation 1102. Up to 142 conditions per place. 
[2023-10-27 12:18:40,754 INFO  L137   encePairwiseOnDemand]: 190/194 looper letters, 26 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2023-10-27 12:18:40,754 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 396 flow
[2023-10-27 12:18:40,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:18:40,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:18:40,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions.
[2023-10-27 12:18:40,756 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5824742268041238
[2023-10-27 12:18:40,756 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 339 transitions.
[2023-10-27 12:18:40,756 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions.
[2023-10-27 12:18:40,756 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:40,756 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions.
[2023-10-27 12:18:40,757 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,758 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,759 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,759 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 339 transitions.
[2023-10-27 12:18:40,759 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 396 flow
[2023-10-27 12:18:40,765 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:40,766 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2023-10-27 12:18:40,767 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=78}
[2023-10-27 12:18:40,768 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2023-10-27 12:18:40,768 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2023-10-27 12:18:40,768 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,768 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:40,768 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:40,769 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-27 12:18:40,771 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:40,772 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:40,772 INFO  L85        PathProgramCache]: Analyzing trace with hash 1190871734, now seen corresponding path program 1 times
[2023-10-27 12:18:40,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:40,772 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910079916]
[2023-10-27 12:18:40,772 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:40,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:40,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:41,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:41,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:41,137 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910079916]
[2023-10-27 12:18:41,137 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910079916] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:41,137 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:41,137 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:41,137 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223648922]
[2023-10-27 12:18:41,137 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:41,138 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:41,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:41,139 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:41,139 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:41,425 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 194
[2023-10-27 12:18:41,426 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 336 flow. Second operand  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:41,426 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:41,426 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 194
[2023-10-27 12:18:41,426 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:41,617 INFO  L130       PetriNetUnfolder]: 209/640 cut-off events.
[2023-10-27 12:18:41,617 INFO  L131       PetriNetUnfolder]: For 285/289 co-relation queries the response was YES.
[2023-10-27 12:18:41,621 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 640 events. 209/640 cut-off events. For 285/289 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3496 event pairs, 45 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 1636. Up to 328 conditions per place. 
[2023-10-27 12:18:41,622 INFO  L137   encePairwiseOnDemand]: 183/194 looper letters, 45 selfloop transitions, 33 changer transitions 8/124 dead transitions.
[2023-10-27 12:18:41,623 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 124 transitions, 703 flow
[2023-10-27 12:18:41,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:41,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:41,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions.
[2023-10-27 12:18:41,625 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5455326460481099
[2023-10-27 12:18:41,625 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 635 transitions.
[2023-10-27 12:18:41,625 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions.
[2023-10-27 12:18:41,630 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:41,631 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions.
[2023-10-27 12:18:41,632 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:41,634 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:41,635 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:41,644 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 635 transitions.
[2023-10-27 12:18:41,644 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 124 transitions, 703 flow
[2023-10-27 12:18:41,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 703 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:41,654 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2023-10-27 12:18:41,654 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=73, PETRI_TRANSITIONS=108}
[2023-10-27 12:18:41,656 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2023-10-27 12:18:41,656 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2023-10-27 12:18:41,656 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:41,656 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:41,656 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:41,656 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-27 12:18:41,657 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:41,657 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:41,657 INFO  L85        PathProgramCache]: Analyzing trace with hash -277895401, now seen corresponding path program 1 times
[2023-10-27 12:18:41,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:41,657 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536154618]
[2023-10-27 12:18:41,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:41,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:41,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:42,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:42,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:42,055 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536154618]
[2023-10-27 12:18:42,055 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536154618] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:42,055 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:42,055 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:42,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232136030]
[2023-10-27 12:18:42,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:42,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:42,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:42,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:42,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:42,212 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 194
[2023-10-27 12:18:42,213 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 108 transitions, 637 flow. Second operand  has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:42,213 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:42,213 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 194
[2023-10-27 12:18:42,213 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:42,596 INFO  L130       PetriNetUnfolder]: 361/945 cut-off events.
[2023-10-27 12:18:42,609 INFO  L131       PetriNetUnfolder]: For 732/740 co-relation queries the response was YES.
[2023-10-27 12:18:42,611 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3085 conditions, 945 events. 361/945 cut-off events. For 732/740 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5703 event pairs, 74 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 3070. Up to 656 conditions per place. 
[2023-10-27 12:18:42,614 INFO  L137   encePairwiseOnDemand]: 172/194 looper letters, 103 selfloop transitions, 76 changer transitions 20/214 dead transitions.
[2023-10-27 12:18:42,615 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 214 transitions, 1493 flow
[2023-10-27 12:18:42,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:42,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:42,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions.
[2023-10-27 12:18:42,617 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5395189003436426
[2023-10-27 12:18:42,617 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 628 transitions.
[2023-10-27 12:18:42,617 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 628 transitions.
[2023-10-27 12:18:42,617 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:42,617 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 628 transitions.
[2023-10-27 12:18:42,619 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:42,621 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:42,632 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:42,632 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 628 transitions.
[2023-10-27 12:18:42,632 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 214 transitions, 1493 flow
[2023-10-27 12:18:42,642 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 214 transitions, 1493 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:42,646 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2023-10-27 12:18:42,646 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=81, PETRI_TRANSITIONS=174}
[2023-10-27 12:18:42,648 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2023-10-27 12:18:42,648 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2023-10-27 12:18:42,648 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:42,648 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:42,648 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-27 12:18:42,648 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-27 12:18:42,649 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:42,649 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:42,649 INFO  L85        PathProgramCache]: Analyzing trace with hash 1529204463, now seen corresponding path program 1 times
[2023-10-27 12:18:42,649 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:42,662 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167564553]
[2023-10-27 12:18:42,662 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:42,663 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:42,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:18:42,713 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:18:42,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:18:42,771 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:18:42,771 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:18:42,772 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-10-27 12:18:42,773 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-10-27 12:18:42,783 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-10-27 12:18:42,784 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-10-27 12:18:42,784 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-10-27 12:18:42,784 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-10-27 12:18:42,787 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-10-27 12:18:42,788 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-10-27 12:18:42,788 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-10-27 12:18:42,789 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-10-27 12:18:42,789 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-10-27 12:18:42,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-27 12:18:42,789 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:42,793 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:18:42,793 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-27 12:18:42,828 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-27 12:18:42,833 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2023-10-27 12:18:42,874 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2023-10-27 12:18:42,883 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-27 12:18:42,884 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 726 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2023-10-27 12:18:42,885 INFO  L82        GeneralOperation]: Start removeDead. Operand has 137 places, 137 transitions, 292 flow
[2023-10-27 12:18:42,886 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 137 places, 137 transitions, 292 flow
[2023-10-27 12:18:42,886 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:18:42,886 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 137 transitions, 292 flow
[2023-10-27 12:18:42,886 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 137 transitions, 292 flow
[2023-10-27 12:18:42,887 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2023-10-27 12:18:42,924 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2023-10-27 12:18:42,924 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-27 12:18:42,925 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 726 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2023-10-27 12:18:42,928 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5548
[2023-10-27 12:18:46,002 INFO  L134        LiptonReduction]: Checked pairs total: 29998
[2023-10-27 12:18:46,002 INFO  L136        LiptonReduction]: Total number of compositions: 86
[2023-10-27 12:18:46,004 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:18:46,004 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;@42c43cb1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:18:46,004 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-10-27 12:18:46,005 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-27 12:18:46,005 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:18:46,005 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:46,005 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-27 12:18:46,005 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:46,005 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:46,005 INFO  L85        PathProgramCache]: Analyzing trace with hash 627, now seen corresponding path program 1 times
[2023-10-27 12:18:46,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:46,005 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521902001]
[2023-10-27 12:18:46,006 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:46,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:46,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:46,009 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:46,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:46,009 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521902001]
[2023-10-27 12:18:46,009 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521902001] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:46,021 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:46,021 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-27 12:18:46,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486380479]
[2023-10-27 12:18:46,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:46,022 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:18:46,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:46,024 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:18:46,024 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:18:46,024 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 223
[2023-10-27 12:18:46,025 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,025 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:46,027 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 223
[2023-10-27 12:18:46,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:46,333 INFO  L130       PetriNetUnfolder]: 363/1129 cut-off events.
[2023-10-27 12:18:46,333 INFO  L131       PetriNetUnfolder]: For 94/181 co-relation queries the response was YES.
[2023-10-27 12:18:46,335 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 1129 events. 363/1129 cut-off events. For 94/181 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7294 event pairs, 356 based on Foata normal form. 0/968 useless extension candidates. Maximal degree in co-relation 1476. Up to 647 conditions per place. 
[2023-10-27 12:18:46,338 INFO  L137   encePairwiseOnDemand]: 222/223 looper letters, 21 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2023-10-27 12:18:46,338 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 186 flow
[2023-10-27 12:18:46,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:18:46,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:18:46,339 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 282 transitions.
[2023-10-27 12:18:46,339 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6322869955156951
[2023-10-27 12:18:46,340 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 282 transitions.
[2023-10-27 12:18:46,340 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 282 transitions.
[2023-10-27 12:18:46,340 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:46,340 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 282 transitions.
[2023-10-27 12:18:46,341 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,341 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,342 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,342 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 282 transitions.
[2023-10-27 12:18:46,342 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 186 flow
[2023-10-27 12:18:46,343 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:46,345 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2023-10-27 12:18:46,346 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2023-10-27 12:18:46,347 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2023-10-27 12:18:46,347 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2023-10-27 12:18:46,349 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,349 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:46,351 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:46,352 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-27 12:18:46,352 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:46,352 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:46,352 INFO  L85        PathProgramCache]: Analyzing trace with hash -1479847002, now seen corresponding path program 1 times
[2023-10-27 12:18:46,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:46,352 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273371488]
[2023-10-27 12:18:46,353 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:46,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:46,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:46,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:46,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:46,579 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273371488]
[2023-10-27 12:18:46,579 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273371488] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:46,579 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:46,579 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:46,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279879337]
[2023-10-27 12:18:46,580 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:46,580 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:46,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:46,580 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:46,580 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:46,774 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 223
[2023-10-27 12:18:46,775 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 144 flow. Second operand  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,775 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:46,775 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 223
[2023-10-27 12:18:46,775 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:48,543 INFO  L130       PetriNetUnfolder]: 5489/10606 cut-off events.
[2023-10-27 12:18:48,543 INFO  L131       PetriNetUnfolder]: For 254/289 co-relation queries the response was YES.
[2023-10-27 12:18:48,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19874 conditions, 10606 events. 5489/10606 cut-off events. For 254/289 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 80178 event pairs, 1459 based on Foata normal form. 16/9949 useless extension candidates. Maximal degree in co-relation 19869. Up to 5638 conditions per place. 
[2023-10-27 12:18:48,633 INFO  L137   encePairwiseOnDemand]: 196/223 looper letters, 91 selfloop transitions, 48 changer transitions 0/157 dead transitions.
[2023-10-27 12:18:48,649 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 157 transitions, 621 flow
[2023-10-27 12:18:48,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:48,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:48,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions.
[2023-10-27 12:18:48,655 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5590433482810164
[2023-10-27 12:18:48,655 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 748 transitions.
[2023-10-27 12:18:48,655 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 748 transitions.
[2023-10-27 12:18:48,655 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:48,655 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 748 transitions.
[2023-10-27 12:18:48,657 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:48,658 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:48,659 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:48,659 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 748 transitions.
[2023-10-27 12:18:48,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 157 transitions, 621 flow
[2023-10-27 12:18:48,660 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 157 transitions, 621 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:48,662 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2023-10-27 12:18:48,662 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-10-27 12:18:48,664 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-10-27 12:18:48,664 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2023-10-27 12:18:48,665 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:48,665 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:48,665 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:48,665 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-27 12:18:48,665 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:48,670 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:48,670 INFO  L85        PathProgramCache]: Analyzing trace with hash -576895935, now seen corresponding path program 1 times
[2023-10-27 12:18:48,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:48,670 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334011864]
[2023-10-27 12:18:48,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:48,671 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:48,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:48,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:48,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:48,703 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334011864]
[2023-10-27 12:18:48,703 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334011864] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:48,703 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:48,703 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:18:48,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824168570]
[2023-10-27 12:18:48,704 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:48,704 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:18:48,704 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:48,704 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:18:48,705 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:18:48,733 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 223
[2023-10-27 12:18:48,733 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:48,733 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:48,734 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 223
[2023-10-27 12:18:48,734 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:49,583 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_73| v_~datas~0.base_75)) (.cse1 (* v_threadThread1of2ForFork0_~i~0_37 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_65 1))) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_65)) |v_threadThread1of2ForFork0_#t~nondet4_28|) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#res.base_9| 0) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_65))) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_65)))))  InVars {#race=|v_#race_73|, ~datas~0.base=v_~datas~0.base_75, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_28|, ~datas~0.offset=v_~datas~0.offset_65}  OutVars{#race=|v_#race_73|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, threadThread1of2ForFork0_#t~nondet3=|v_threadThread1of2ForFork0_#t~nondet3_15|, ~datas~0.base=v_~datas~0.base_75, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, ~datas~0.offset=v_~datas~0.offset_65}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet3, threadThread1of2ForFork0_#t~nondet4][58], [51#threadEXITtrue, 140#true, 143#true, Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 157#(= |#race~datas~0| 0), threadThread1of2ForFork0InUse, 3#ULTIMATE.startEXITtrue, Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 102#L1017-4true, threadThread2of2ForFork0InUse, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2023-10-27 12:18:49,597 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,597 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,597 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,598 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,598 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L1017-4-->L1017-6: Formula: (= (store |v_#race_66| v_~datas~0.base_65 (store (select |v_#race_66| v_~datas~0.base_65) (+ (* v_threadThread2of2ForFork0_~i~0_33 4) v_~datas~0.offset_57) |v_threadThread2of2ForFork0_#t~nondet4_23|)) |v_#race_65|)  InVars {#race=|v_#race_66|, ~datas~0.base=v_~datas~0.base_65, ~datas~0.offset=v_~datas~0.offset_57, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_33}  OutVars{#race=|v_#race_65|, ~datas~0.base=v_~datas~0.base_65, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_23|, ~datas~0.offset=v_~datas~0.offset_57, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_33}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][91], [140#true, 20#L1017-9true, 143#true, Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 28#L1017-6true, 157#(= |#race~datas~0| 0), 3#ULTIMATE.startEXITtrue, Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2023-10-27 12:18:49,598 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,598 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,598 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,598 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,771 INFO  L130       PetriNetUnfolder]: 2751/6464 cut-off events.
[2023-10-27 12:18:49,776 INFO  L131       PetriNetUnfolder]: For 2006/2564 co-relation queries the response was YES.
[2023-10-27 12:18:49,798 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14862 conditions, 6464 events. 2751/6464 cut-off events. For 2006/2564 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53340 event pairs, 950 based on Foata normal form. 125/6165 useless extension candidates. Maximal degree in co-relation 14852. Up to 2371 conditions per place. 
[2023-10-27 12:18:49,836 INFO  L137   encePairwiseOnDemand]: 217/223 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2023-10-27 12:18:49,849 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2023-10-27 12:18:49,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:18:49,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:18:49,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2023-10-27 12:18:49,851 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5919282511210763
[2023-10-27 12:18:49,851 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 396 transitions.
[2023-10-27 12:18:49,851 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions.
[2023-10-27 12:18:49,851 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:49,852 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions.
[2023-10-27 12:18:49,852 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:49,853 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:49,854 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:49,854 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 396 transitions.
[2023-10-27 12:18:49,854 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2023-10-27 12:18:49,868 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:49,890 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2023-10-27 12:18:49,890 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-10-27 12:18:49,891 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-10-27 12:18:49,892 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2023-10-27 12:18:49,892 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:49,892 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:49,892 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:49,893 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-27 12:18:49,893 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:49,893 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:49,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 594333784, now seen corresponding path program 1 times
[2023-10-27 12:18:49,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:49,893 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889965809]
[2023-10-27 12:18:49,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:49,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:49,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:50,172 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:50,173 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:50,173 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889965809]
[2023-10-27 12:18:50,173 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889965809] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:50,174 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:50,174 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:50,174 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641200926]
[2023-10-27 12:18:50,175 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:50,175 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:50,175 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:50,175 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:50,176 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:50,458 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 223
[2023-10-27 12:18:50,458 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 501 flow. Second operand  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:50,459 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:50,459 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 223
[2023-10-27 12:18:50,459 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:52,415 INFO  L130       PetriNetUnfolder]: 5567/10624 cut-off events.
[2023-10-27 12:18:52,415 INFO  L131       PetriNetUnfolder]: For 6462/6560 co-relation queries the response was YES.
[2023-10-27 12:18:52,443 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28208 conditions, 10624 events. 5567/10624 cut-off events. For 6462/6560 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 79146 event pairs, 1759 based on Foata normal form. 0/10089 useless extension candidates. Maximal degree in co-relation 28197. Up to 6791 conditions per place. 
[2023-10-27 12:18:52,523 INFO  L137   encePairwiseOnDemand]: 208/223 looper letters, 108 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2023-10-27 12:18:52,523 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1309 flow
[2023-10-27 12:18:52,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:52,524 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:52,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2023-10-27 12:18:52,526 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5747384155455905
[2023-10-27 12:18:52,526 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2023-10-27 12:18:52,526 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2023-10-27 12:18:52,526 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:52,526 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2023-10-27 12:18:52,528 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:52,529 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:52,545 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:52,546 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 769 transitions.
[2023-10-27 12:18:52,546 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1309 flow
[2023-10-27 12:18:52,556 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1309 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:52,560 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2023-10-27 12:18:52,560 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1155, PETRI_PLACES=87, PETRI_TRANSITIONS=180}
[2023-10-27 12:18:52,561 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2023-10-27 12:18:52,561 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2023-10-27 12:18:52,571 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:52,571 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:52,571 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:52,571 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-27 12:18:52,571 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:52,572 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:52,572 INFO  L85        PathProgramCache]: Analyzing trace with hash -1171520631, now seen corresponding path program 1 times
[2023-10-27 12:18:52,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:52,573 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804970300]
[2023-10-27 12:18:52,574 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:52,574 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:52,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:52,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:52,887 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:52,901 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804970300]
[2023-10-27 12:18:52,901 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804970300] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:52,902 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:52,902 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:52,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265504205]
[2023-10-27 12:18:52,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:52,903 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:52,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:52,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:52,903 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:53,114 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 223
[2023-10-27 12:18:53,115 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 180 transitions, 1155 flow. Second operand  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:53,115 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:53,115 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 223
[2023-10-27 12:18:53,115 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:56,696 INFO  L130       PetriNetUnfolder]: 11107/19827 cut-off events.
[2023-10-27 12:18:56,696 INFO  L131       PetriNetUnfolder]: For 18082/18251 co-relation queries the response was YES.
[2023-10-27 12:18:56,740 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62978 conditions, 19827 events. 11107/19827 cut-off events. For 18082/18251 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 151288 event pairs, 3140 based on Foata normal form. 8/18548 useless extension candidates. Maximal degree in co-relation 62962. Up to 13610 conditions per place. 
[2023-10-27 12:18:56,903 INFO  L137   encePairwiseOnDemand]: 197/223 looper letters, 233 selfloop transitions, 132 changer transitions 0/385 dead transitions.
[2023-10-27 12:18:56,904 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 385 transitions, 2911 flow
[2023-10-27 12:18:56,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:56,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:56,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions.
[2023-10-27 12:18:56,907 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5822122571001495
[2023-10-27 12:18:56,907 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 779 transitions.
[2023-10-27 12:18:56,916 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions.
[2023-10-27 12:18:56,917 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:56,917 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions.
[2023-10-27 12:18:56,918 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:56,921 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:56,921 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:56,921 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 779 transitions.
[2023-10-27 12:18:56,921 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 385 transitions, 2911 flow
[2023-10-27 12:18:56,991 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 385 transitions, 2911 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:57,009 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2023-10-27 12:18:57,010 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2326, PETRI_PLACES=96, PETRI_TRANSITIONS=302}
[2023-10-27 12:18:57,010 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2023-10-27 12:18:57,010 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2023-10-27 12:18:57,011 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:57,011 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:57,011 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:57,011 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-27 12:18:57,011 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:57,011 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:57,011 INFO  L85        PathProgramCache]: Analyzing trace with hash -485975421, now seen corresponding path program 1 times
[2023-10-27 12:18:57,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:57,012 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783048798]
[2023-10-27 12:18:57,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:57,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:57,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:57,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-27 12:18:57,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:57,571 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783048798]
[2023-10-27 12:18:57,572 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783048798] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:18:57,573 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358394137]
[2023-10-27 12:18:57,574 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:57,574 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:18:57,574 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:18:57,591 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:18:57,635 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-27 12:18:57,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:57,769 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-10-27 12:18:57,778 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:18:58,019 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:18:58,057 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:58,058 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:18:58,107 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:58,108 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:58,109 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:18:58,163 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:58,169 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:58,169 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:58,171 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:18:58,241 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:58,242 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:18:58,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-27 12:18:58,272 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:18:58,335 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2023-10-27 12:18:58,375 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-10-27 12:18:58,399 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2023-10-27 12:18:58,534 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:18:58,534 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2023-10-27 12:18:58,544 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:18:58,545 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-10-27 12:18:58,548 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-10-27 12:18:58,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2023-10-27 12:18:58,588 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [358394137] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:18:58,588 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:18:58,588 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2023-10-27 12:18:58,588 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133944225]
[2023-10-27 12:18:58,589 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:18:58,589 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-10-27 12:18:58,589 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:58,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-10-27 12:18:58,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=131, Unknown=10, NotChecked=84, Total=306
[2023-10-27 12:18:58,736 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 81 out of 223
[2023-10-27 12:18:58,737 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 302 transitions, 2326 flow. Second operand  has 18 states, 18 states have (on average 83.27777777777777) internal successors, (1499), 18 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:58,737 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:58,737 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 223
[2023-10-27 12:18:58,737 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:02,613 INFO  L130       PetriNetUnfolder]: 13643/23034 cut-off events.
[2023-10-27 12:19:02,613 INFO  L131       PetriNetUnfolder]: For 42400/42404 co-relation queries the response was YES.
[2023-10-27 12:19:02,677 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89032 conditions, 23034 events. 13643/23034 cut-off events. For 42400/42404 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 165617 event pairs, 5631 based on Foata normal form. 498/22055 useless extension candidates. Maximal degree in co-relation 89011. Up to 21318 conditions per place. 
[2023-10-27 12:19:02,857 INFO  L137   encePairwiseOnDemand]: 206/223 looper letters, 323 selfloop transitions, 7 changer transitions 11/350 dead transitions.
[2023-10-27 12:19:02,858 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 350 transitions, 3329 flow
[2023-10-27 12:19:02,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:19:02,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:19:02,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions.
[2023-10-27 12:19:02,861 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.41832158872517616
[2023-10-27 12:19:02,861 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 653 transitions.
[2023-10-27 12:19:02,861 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions.
[2023-10-27 12:19:02,861 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:02,861 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions.
[2023-10-27 12:19:02,862 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:02,864 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:02,864 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:02,865 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 653 transitions.
[2023-10-27 12:19:02,865 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 350 transitions, 3329 flow
[2023-10-27 12:19:03,562 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 350 transitions, 3233 flow, removed 48 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:03,566 INFO  L231             Difference]: Finished difference. Result has 103 places, 303 transitions, 2290 flow
[2023-10-27 12:19:03,566 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2290, PETRI_PLACES=103, PETRI_TRANSITIONS=303}
[2023-10-27 12:19:03,567 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 36 predicate places.
[2023-10-27 12:19:03,567 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 303 transitions, 2290 flow
[2023-10-27 12:19:03,567 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 83.27777777777777) internal successors, (1499), 18 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:03,568 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:03,568 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:03,589 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:03,772 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,SelfDestructingSolverStorable11
[2023-10-27 12:19:03,772 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:03,773 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:03,773 INFO  L85        PathProgramCache]: Analyzing trace with hash -834187754, now seen corresponding path program 1 times
[2023-10-27 12:19:03,773 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:03,774 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778605137]
[2023-10-27 12:19:03,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:03,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:03,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:04,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:19:04,197 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:04,197 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778605137]
[2023-10-27 12:19:04,197 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778605137] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:04,197 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:19:04,197 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-27 12:19:04,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547422956]
[2023-10-27 12:19:04,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:04,198 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-27 12:19:04,198 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:04,199 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-27 12:19:04,199 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-27 12:19:04,630 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 223
[2023-10-27 12:19:04,630 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 303 transitions, 2290 flow. Second operand  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:04,630 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:04,630 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 223
[2023-10-27 12:19:04,631 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:08,297 INFO  L130       PetriNetUnfolder]: 13295/23434 cut-off events.
[2023-10-27 12:19:08,297 INFO  L131       PetriNetUnfolder]: For 42124/42205 co-relation queries the response was YES.
[2023-10-27 12:19:08,341 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 92527 conditions, 23434 events. 13295/23434 cut-off events. For 42124/42205 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 181808 event pairs, 3483 based on Foata normal form. 350/23302 useless extension candidates. Maximal degree in co-relation 92501. Up to 11062 conditions per place. 
[2023-10-27 12:19:08,460 INFO  L137   encePairwiseOnDemand]: 207/223 looper letters, 448 selfloop transitions, 166 changer transitions 1/632 dead transitions.
[2023-10-27 12:19:08,461 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 632 transitions, 5697 flow
[2023-10-27 12:19:08,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-27 12:19:08,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-27 12:19:08,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 976 transitions.
[2023-10-27 12:19:08,467 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.547085201793722
[2023-10-27 12:19:08,467 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 976 transitions.
[2023-10-27 12:19:08,467 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 976 transitions.
[2023-10-27 12:19:08,467 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:08,468 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 976 transitions.
[2023-10-27 12:19:08,479 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:08,502 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:08,503 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:08,503 INFO  L175             Difference]: Start difference. First operand has 103 places, 303 transitions, 2290 flow. Second operand 8 states and 976 transitions.
[2023-10-27 12:19:08,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 632 transitions, 5697 flow
[2023-10-27 12:19:08,980 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 632 transitions, 5613 flow, removed 31 selfloop flow, removed 2 redundant places.
[2023-10-27 12:19:08,992 INFO  L231             Difference]: Finished difference. Result has 114 places, 420 transitions, 3916 flow
[2023-10-27 12:19:08,992 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3916, PETRI_PLACES=114, PETRI_TRANSITIONS=420}
[2023-10-27 12:19:08,993 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 47 predicate places.
[2023-10-27 12:19:08,993 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 420 transitions, 3916 flow
[2023-10-27 12:19:08,999 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:08,999 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:09,000 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:09,000 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-27 12:19:09,001 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:09,001 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:09,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 779781685, now seen corresponding path program 1 times
[2023-10-27 12:19:09,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:09,001 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656080571]
[2023-10-27 12:19:09,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:09,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:09,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:09,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-27 12:19:09,353 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:09,353 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656080571]
[2023-10-27 12:19:09,353 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656080571] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:09,353 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:19:09,353 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:19:09,353 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636201019]
[2023-10-27 12:19:09,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:09,354 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:19:09,354 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:09,354 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:19:09,355 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:19:09,527 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 223
[2023-10-27 12:19:09,528 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 420 transitions, 3916 flow. Second operand  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:09,528 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:09,528 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 223
[2023-10-27 12:19:09,528 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:14,881 INFO  L130       PetriNetUnfolder]: 17483/30558 cut-off events.
[2023-10-27 12:19:14,881 INFO  L131       PetriNetUnfolder]: For 117297/117885 co-relation queries the response was YES.
[2023-10-27 12:19:14,975 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 141844 conditions, 30558 events. 17483/30558 cut-off events. For 117297/117885 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 244225 event pairs, 3898 based on Foata normal form. 68/28478 useless extension candidates. Maximal degree in co-relation 141812. Up to 23106 conditions per place. 
[2023-10-27 12:19:15,214 INFO  L137   encePairwiseOnDemand]: 197/223 looper letters, 440 selfloop transitions, 164 changer transitions 1/622 dead transitions.
[2023-10-27 12:19:15,214 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 622 transitions, 6656 flow
[2023-10-27 12:19:15,214 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:19:15,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:19:15,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions.
[2023-10-27 12:19:15,233 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5822122571001495
[2023-10-27 12:19:15,233 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 779 transitions.
[2023-10-27 12:19:15,234 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions.
[2023-10-27 12:19:15,234 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:15,234 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions.
[2023-10-27 12:19:15,235 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:15,237 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:15,237 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:15,238 INFO  L175             Difference]: Start difference. First operand has 114 places, 420 transitions, 3916 flow. Second operand 6 states and 779 transitions.
[2023-10-27 12:19:15,238 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 622 transitions, 6656 flow
[2023-10-27 12:19:15,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 622 transitions, 6618 flow, removed 19 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:15,916 INFO  L231             Difference]: Finished difference. Result has 123 places, 535 transitions, 5508 flow
[2023-10-27 12:19:15,916 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=3878, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5508, PETRI_PLACES=123, PETRI_TRANSITIONS=535}
[2023-10-27 12:19:15,917 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 56 predicate places.
[2023-10-27 12:19:15,918 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 535 transitions, 5508 flow
[2023-10-27 12:19:15,918 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:15,918 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:15,918 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:15,918 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-27 12:19:15,918 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:15,919 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:15,919 INFO  L85        PathProgramCache]: Analyzing trace with hash -1664645135, now seen corresponding path program 1 times
[2023-10-27 12:19:15,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:15,920 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196268823]
[2023-10-27 12:19:15,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:15,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:15,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:16,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:16,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:16,608 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196268823]
[2023-10-27 12:19:16,608 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196268823] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:16,608 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771025238]
[2023-10-27 12:19:16,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:16,609 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:16,609 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:16,610 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:16,649 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-27 12:19:16,774 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:16,776 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 27 conjunts are in the unsatisfiable core
[2023-10-27 12:19:16,780 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:16,791 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118
[2023-10-27 12:19:16,917 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:19:16,917 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-27 12:19:16,954 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-27 12:19:16,971 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:19:16,994 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:19:17,005 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:17,006 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:19:17,027 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:17,027 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:19:17,070 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:19:17,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:19:17,092 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:19:17,092 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771025238] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:17,092 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:19:17,092 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11
[2023-10-27 12:19:17,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358739530]
[2023-10-27 12:19:17,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:17,094 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-27 12:19:17,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:17,095 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-27 12:19:17,095 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2023-10-27 12:19:17,529 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 223
[2023-10-27 12:19:17,530 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 535 transitions, 5508 flow. Second operand  has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:17,530 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:17,530 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 223
[2023-10-27 12:19:17,530 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:25,316 INFO  L130       PetriNetUnfolder]: 25611/44258 cut-off events.
[2023-10-27 12:19:25,317 INFO  L131       PetriNetUnfolder]: For 222841/223413 co-relation queries the response was YES.
[2023-10-27 12:19:25,544 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 233478 conditions, 44258 events. 25611/44258 cut-off events. For 222841/223413 co-relation queries the response was YES. Maximal size of possible extension queue 1613. Compared 372009 event pairs, 3108 based on Foata normal form. 243/43813 useless extension candidates. Maximal degree in co-relation 233441. Up to 27629 conditions per place. 
[2023-10-27 12:19:25,748 INFO  L137   encePairwiseOnDemand]: 200/223 looper letters, 968 selfloop transitions, 231 changer transitions 3/1216 dead transitions.
[2023-10-27 12:19:25,748 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 1216 transitions, 14879 flow
[2023-10-27 12:19:25,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-27 12:19:25,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-27 12:19:25,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1171 transitions.
[2023-10-27 12:19:25,756 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4773746432939258
[2023-10-27 12:19:25,757 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1171 transitions.
[2023-10-27 12:19:25,757 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1171 transitions.
[2023-10-27 12:19:25,758 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:25,758 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1171 transitions.
[2023-10-27 12:19:25,760 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 106.45454545454545) internal successors, (1171), 11 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:25,774 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:25,774 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:25,774 INFO  L175             Difference]: Start difference. First operand has 123 places, 535 transitions, 5508 flow. Second operand 11 states and 1171 transitions.
[2023-10-27 12:19:25,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 1216 transitions, 14879 flow
[2023-10-27 12:19:30,420 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 1216 transitions, 14563 flow, removed 158 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:30,435 INFO  L231             Difference]: Finished difference. Result has 142 places, 776 transitions, 9317 flow
[2023-10-27 12:19:30,435 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=5318, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9317, PETRI_PLACES=142, PETRI_TRANSITIONS=776}
[2023-10-27 12:19:30,437 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 75 predicate places.
[2023-10-27 12:19:30,437 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 776 transitions, 9317 flow
[2023-10-27 12:19:30,437 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:30,437 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:30,437 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:30,444 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:30,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:30,642 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:30,645 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:30,646 INFO  L85        PathProgramCache]: Analyzing trace with hash -1315530165, now seen corresponding path program 2 times
[2023-10-27 12:19:30,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:30,646 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367361790]
[2023-10-27 12:19:30,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:30,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:30,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:31,418 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:31,418 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:31,418 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367361790]
[2023-10-27 12:19:31,418 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367361790] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:31,418 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879285329]
[2023-10-27 12:19:31,418 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:19:31,418 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:31,418 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:31,434 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:31,470 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-27 12:19:31,674 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:19:31,674 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:19:31,675 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-10-27 12:19:31,678 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:31,683 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-10-27 12:19:31,683 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27
[2023-10-27 12:19:31,782 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:19:31,783 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-27 12:19:31,836 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-10-27 12:19:31,890 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:19:31,936 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:19:32,000 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:32,000 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:19:32,059 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:32,059 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:19:32,119 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:19:32,177 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:19:32,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:19:32,200 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:19:32,201 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [879285329] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:32,201 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:19:32,201 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16
[2023-10-27 12:19:32,202 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863866317]
[2023-10-27 12:19:32,202 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:32,203 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-27 12:19:32,203 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:32,203 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-27 12:19:32,203 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306
[2023-10-27 12:19:32,678 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-10-27 12:19:32,679 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 776 transitions, 9317 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:32,679 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:32,679 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-10-27 12:19:32,679 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:44,269 INFO  L130       PetriNetUnfolder]: 29386/50627 cut-off events.
[2023-10-27 12:19:44,269 INFO  L131       PetriNetUnfolder]: For 353311/353968 co-relation queries the response was YES.
[2023-10-27 12:19:44,548 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 292679 conditions, 50627 events. 29386/50627 cut-off events. For 353311/353968 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 431721 event pairs, 4048 based on Foata normal form. 477/50824 useless extension candidates. Maximal degree in co-relation 292632. Up to 18515 conditions per place. 
[2023-10-27 12:19:44,855 INFO  L137   encePairwiseOnDemand]: 207/223 looper letters, 1087 selfloop transitions, 522 changer transitions 35/1658 dead transitions.
[2023-10-27 12:19:44,855 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1658 transitions, 23195 flow
[2023-10-27 12:19:44,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-27 12:19:44,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-27 12:19:44,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1180 transitions.
[2023-10-27 12:19:44,858 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48104362005707296
[2023-10-27 12:19:44,858 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1180 transitions.
[2023-10-27 12:19:44,858 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1180 transitions.
[2023-10-27 12:19:44,859 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:44,859 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1180 transitions.
[2023-10-27 12:19:44,861 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 107.27272727272727) internal successors, (1180), 11 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:44,863 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:44,864 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:44,864 INFO  L175             Difference]: Start difference. First operand has 142 places, 776 transitions, 9317 flow. Second operand 11 states and 1180 transitions.
[2023-10-27 12:19:44,864 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 1658 transitions, 23195 flow
[2023-10-27 12:19:49,937 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 1658 transitions, 23153 flow, removed 21 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:49,957 INFO  L231             Difference]: Finished difference. Result has 159 places, 1061 transitions, 15637 flow
[2023-10-27 12:19:49,958 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=9275, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15637, PETRI_PLACES=159, PETRI_TRANSITIONS=1061}
[2023-10-27 12:19:49,958 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 92 predicate places.
[2023-10-27 12:19:49,958 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 1061 transitions, 15637 flow
[2023-10-27 12:19:49,973 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:49,973 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:49,974 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:49,984 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:50,178 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,SelfDestructingSolverStorable15
[2023-10-27 12:19:50,178 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:50,179 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:50,179 INFO  L85        PathProgramCache]: Analyzing trace with hash -952832063, now seen corresponding path program 1 times
[2023-10-27 12:19:50,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:50,180 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161340193]
[2023-10-27 12:19:50,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:50,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:50,220 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:50,750 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:50,750 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:50,750 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161340193]
[2023-10-27 12:19:50,751 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161340193] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:50,751 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044595790]
[2023-10-27 12:19:50,751 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:50,751 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:50,751 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:50,766 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:50,795 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-27 12:19:50,914 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:50,915 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-27 12:19:50,917 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:50,926 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-10-27 12:19:50,933 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 56
[2023-10-27 12:19:51,050 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:19:51,051 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-27 12:19:51,099 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-10-27 12:19:51,129 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:19:51,138 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:19:51,150 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:51,151 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:19:51,178 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:51,179 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:19:51,192 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:19:51,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:19:51,216 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:19:51,216 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044595790] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:51,216 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:19:51,216 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11
[2023-10-27 12:19:51,217 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134597745]
[2023-10-27 12:19:51,217 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:51,217 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-27 12:19:51,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:51,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-27 12:19:51,218 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2023-10-27 12:19:51,986 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 223
[2023-10-27 12:19:51,987 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 1061 transitions, 15637 flow. Second operand  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:51,987 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:51,987 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 223
[2023-10-27 12:19:51,987 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:03,175 INFO  L130       PetriNetUnfolder]: 25293/45566 cut-off events.
[2023-10-27 12:20:03,175 INFO  L131       PetriNetUnfolder]: For 466512/469194 co-relation queries the response was YES.
[2023-10-27 12:20:03,423 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290394 conditions, 45566 events. 25293/45566 cut-off events. For 466512/469194 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 407756 event pairs, 1755 based on Foata normal form. 1039/45816 useless extension candidates. Maximal degree in co-relation 290339. Up to 17989 conditions per place. 
[2023-10-27 12:20:03,613 INFO  L137   encePairwiseOnDemand]: 212/223 looper letters, 1629 selfloop transitions, 83 changer transitions 0/1876 dead transitions.
[2023-10-27 12:20:03,613 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1876 transitions, 31384 flow
[2023-10-27 12:20:03,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-10-27 12:20:03,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-10-27 12:20:03,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1077 transitions.
[2023-10-27 12:20:03,622 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5366218236173393
[2023-10-27 12:20:03,622 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1077 transitions.
[2023-10-27 12:20:03,622 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1077 transitions.
[2023-10-27 12:20:03,623 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:03,623 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1077 transitions.
[2023-10-27 12:20:03,636 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:03,638 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 223.0) internal successors, (2230), 10 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:03,647 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 223.0) internal successors, (2230), 10 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:03,647 INFO  L175             Difference]: Start difference. First operand has 159 places, 1061 transitions, 15637 flow. Second operand 9 states and 1077 transitions.
[2023-10-27 12:20:03,647 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1876 transitions, 31384 flow
[2023-10-27 12:20:10,464 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1876 transitions, 31144 flow, removed 114 selfloop flow, removed 3 redundant places.
[2023-10-27 12:20:10,482 INFO  L231             Difference]: Finished difference. Result has 160 places, 1060 transitions, 15663 flow
[2023-10-27 12:20:10,483 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=15497, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15663, PETRI_PLACES=160, PETRI_TRANSITIONS=1060}
[2023-10-27 12:20:10,490 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 93 predicate places.
[2023-10-27 12:20:10,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 1060 transitions, 15663 flow
[2023-10-27 12:20:10,500 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:10,500 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:10,502 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:10,508 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-27 12:20:10,706 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:10,707 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:20:10,707 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:10,707 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473696100, now seen corresponding path program 1 times
[2023-10-27 12:20:10,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:10,709 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106865621]
[2023-10-27 12:20:10,709 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:10,709 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:10,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:10,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:10,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:10,846 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106865621]
[2023-10-27 12:20:10,846 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106865621] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:20:10,847 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969141951]
[2023-10-27 12:20:10,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:10,847 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:10,847 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:10,857 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:20:10,961 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-10-27 12:20:11,059 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:11,060 INFO  L263         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-27 12:20:11,062 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:20:11,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:11,107 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:20:11,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:11,134 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [969141951] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:20:11,134 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:20:11,134 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-27 12:20:11,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910783427]
[2023-10-27 12:20:11,135 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:20:11,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-27 12:20:11,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:11,135 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-27 12:20:11,149 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-27 12:20:11,299 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 223
[2023-10-27 12:20:11,300 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 1060 transitions, 15663 flow. Second operand  has 9 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:11,300 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:11,301 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 223
[2023-10-27 12:20:11,301 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:18,426 INFO  L130       PetriNetUnfolder]: 15396/31719 cut-off events.
[2023-10-27 12:20:18,426 INFO  L131       PetriNetUnfolder]: For 305768/309415 co-relation queries the response was YES.
[2023-10-27 12:20:18,581 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 193046 conditions, 31719 events. 15396/31719 cut-off events. For 305768/309415 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 305458 event pairs, 668 based on Foata normal form. 629/31810 useless extension candidates. Maximal degree in co-relation 192993. Up to 13355 conditions per place. 
[2023-10-27 12:20:18,714 INFO  L137   encePairwiseOnDemand]: 216/223 looper letters, 356 selfloop transitions, 7 changer transitions 31/1129 dead transitions.
[2023-10-27 12:20:18,714 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 1129 transitions, 17228 flow
[2023-10-27 12:20:18,715 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-27 12:20:18,715 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-27 12:20:18,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1011 transitions.
[2023-10-27 12:20:18,731 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5667040358744395
[2023-10-27 12:20:18,731 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1011 transitions.
[2023-10-27 12:20:18,745 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1011 transitions.
[2023-10-27 12:20:18,746 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:18,746 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1011 transitions.
[2023-10-27 12:20:18,748 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:18,750 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:18,750 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:18,750 INFO  L175             Difference]: Start difference. First operand has 160 places, 1060 transitions, 15663 flow. Second operand 8 states and 1011 transitions.
[2023-10-27 12:20:18,750 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 1129 transitions, 17228 flow
[2023-10-27 12:20:21,769 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 1129 transitions, 17054 flow, removed 0 selfloop flow, removed 8 redundant places.
[2023-10-27 12:20:21,785 INFO  L231             Difference]: Finished difference. Result has 163 places, 1017 transitions, 15096 flow
[2023-10-27 12:20:21,785 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=15177, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15096, PETRI_PLACES=163, PETRI_TRANSITIONS=1017}
[2023-10-27 12:20:21,786 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 96 predicate places.
[2023-10-27 12:20:21,786 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 1017 transitions, 15096 flow
[2023-10-27 12:20:21,786 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:21,786 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:21,786 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:21,804 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-10-27 12:20:22,002 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-27 12:20:22,002 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:20:22,003 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:22,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -985146553, now seen corresponding path program 3 times
[2023-10-27 12:20:22,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:22,004 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482104213]
[2023-10-27 12:20:22,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:22,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:22,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:22,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:22,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:22,828 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482104213]
[2023-10-27 12:20:22,828 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482104213] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:20:22,828 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840823926]
[2023-10-27 12:20:22,828 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-27 12:20:22,828 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:22,828 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:22,830 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:20:22,875 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-10-27 12:20:23,023 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-27 12:20:23,024 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:20:23,025 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core
[2023-10-27 12:20:23,028 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:20:23,034 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-10-27 12:20:23,154 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:20:23,155 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-10-27 12:20:23,210 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-27 12:20:23,222 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:20:23,275 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:20:23,333 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:23,333 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:20:23,427 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-27 12:20:23,483 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-27 12:20:23,517 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:23,518 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:20:23,580 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:20:23,611 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:20:23,634 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:20:23,686 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:20:23,715 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:23,715 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:20:23,716 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [840823926] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:23,716 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:20:23,716 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-10-27 12:20:23,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630788191]
[2023-10-27 12:20:23,717 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:23,718 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-27 12:20:23,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:23,718 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-27 12:20:23,718 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2023-10-27 12:20:24,277 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-10-27 12:20:24,277 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 1017 transitions, 15096 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:24,277 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:24,277 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-10-27 12:20:24,278 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:37,109 INFO  L130       PetriNetUnfolder]: 26004/45151 cut-off events.
[2023-10-27 12:20:37,110 INFO  L131       PetriNetUnfolder]: For 444696/445207 co-relation queries the response was YES.
[2023-10-27 12:20:37,432 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 289287 conditions, 45151 events. 26004/45151 cut-off events. For 444696/445207 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 376100 event pairs, 3055 based on Foata normal form. 404/45231 useless extension candidates. Maximal degree in co-relation 289230. Up to 23580 conditions per place. 
[2023-10-27 12:20:37,611 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1030 selfloop transitions, 602 changer transitions 38/1682 dead transitions.
[2023-10-27 12:20:37,611 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 1682 transitions, 26046 flow
[2023-10-27 12:20:37,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-10-27 12:20:37,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2023-10-27 12:20:37,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1660 transitions.
[2023-10-27 12:20:37,628 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4962630792227205
[2023-10-27 12:20:37,641 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1660 transitions.
[2023-10-27 12:20:37,641 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1660 transitions.
[2023-10-27 12:20:37,642 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:37,642 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1660 transitions.
[2023-10-27 12:20:37,643 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 110.66666666666667) internal successors, (1660), 15 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,647 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 223.0) internal successors, (3568), 16 states have internal predecessors, (3568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,647 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 223.0) internal successors, (3568), 16 states have internal predecessors, (3568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,647 INFO  L175             Difference]: Start difference. First operand has 163 places, 1017 transitions, 15096 flow. Second operand 15 states and 1660 transitions.
[2023-10-27 12:20:37,647 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 1682 transitions, 26046 flow
[2023-10-27 12:20:41,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1682 transitions, 25696 flow, removed 50 selfloop flow, removed 3 redundant places.
[2023-10-27 12:20:41,753 INFO  L231             Difference]: Finished difference. Result has 179 places, 1268 transitions, 20571 flow
[2023-10-27 12:20:41,754 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=14897, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=20571, PETRI_PLACES=179, PETRI_TRANSITIONS=1268}
[2023-10-27 12:20:41,754 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 112 predicate places.
[2023-10-27 12:20:41,754 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 1268 transitions, 20571 flow
[2023-10-27 12:20:41,754 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:41,755 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:41,755 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:41,761 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-10-27 12:20:41,959 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:41,960 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:20:41,960 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:41,961 INFO  L85        PathProgramCache]: Analyzing trace with hash 541897883, now seen corresponding path program 4 times
[2023-10-27 12:20:41,961 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:41,961 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629326928]
[2023-10-27 12:20:41,962 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:41,962 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:42,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:42,713 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:42,713 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:42,714 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629326928]
[2023-10-27 12:20:42,714 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629326928] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:20:42,714 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113655457]
[2023-10-27 12:20:42,714 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-27 12:20:42,714 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:42,714 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:42,715 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:20:42,773 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-10-27 12:20:43,035 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-27 12:20:43,036 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:20:43,037 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-10-27 12:20:43,040 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:20:43,044 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-10-27 12:20:43,164 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:20:43,165 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-10-27 12:20:43,213 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-27 12:20:43,222 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:20:43,271 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-27 12:20:43,310 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:20:43,358 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:43,358 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:20:43,411 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:43,412 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:20:43,472 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:20:43,487 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:20:43,523 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:20:43,551 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:20:43,609 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:20:43,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:20:43,617 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:20:43,617 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113655457] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:43,617 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:20:43,617 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-10-27 12:20:43,617 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990841591]
[2023-10-27 12:20:43,617 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:43,618 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-27 12:20:43,618 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:43,619 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-27 12:20:43,619 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342
[2023-10-27 12:20:44,114 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-10-27 12:20:44,115 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 1268 transitions, 20571 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:44,115 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:44,115 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-10-27 12:20:44,115 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:59,865 INFO  L130       PetriNetUnfolder]: 28505/49623 cut-off events.
[2023-10-27 12:20:59,866 INFO  L131       PetriNetUnfolder]: For 612494/613077 co-relation queries the response was YES.
[2023-10-27 12:21:00,120 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 345311 conditions, 49623 events. 28505/49623 cut-off events. For 612494/613077 co-relation queries the response was YES. Maximal size of possible extension queue 1610. Compared 419890 event pairs, 3217 based on Foata normal form. 356/49614 useless extension candidates. Maximal degree in co-relation 345249. Up to 23695 conditions per place. 
[2023-10-27 12:21:00,319 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1364 selfloop transitions, 532 changer transitions 35/1943 dead transitions.
[2023-10-27 12:21:00,319 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1943 transitions, 33856 flow
[2023-10-27 12:21:00,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-27 12:21:00,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-27 12:21:00,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1302 transitions.
[2023-10-27 12:21:00,323 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48654708520179374
[2023-10-27 12:21:00,323 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1302 transitions.
[2023-10-27 12:21:00,323 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1302 transitions.
[2023-10-27 12:21:00,323 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:00,323 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1302 transitions.
[2023-10-27 12:21:00,326 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 108.5) internal successors, (1302), 12 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:00,343 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 223.0) internal successors, (2899), 13 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:00,356 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 223.0) internal successors, (2899), 13 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:00,356 INFO  L175             Difference]: Start difference. First operand has 179 places, 1268 transitions, 20571 flow. Second operand 12 states and 1302 transitions.
[2023-10-27 12:21:00,356 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1943 transitions, 33856 flow
[2023-10-27 12:21:10,188 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 1943 transitions, 33063 flow, removed 388 selfloop flow, removed 2 redundant places.
[2023-10-27 12:21:10,233 INFO  L231             Difference]: Finished difference. Result has 194 places, 1519 transitions, 26205 flow
[2023-10-27 12:21:10,250 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=19795, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=841, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=26205, PETRI_PLACES=194, PETRI_TRANSITIONS=1519}
[2023-10-27 12:21:10,250 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 127 predicate places.
[2023-10-27 12:21:10,251 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 1519 transitions, 26205 flow
[2023-10-27 12:21:10,251 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:10,251 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:10,251 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:10,257 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-27 12:21:10,455 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:21:10,456 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:21:10,456 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:10,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331203745, now seen corresponding path program 5 times
[2023-10-27 12:21:10,457 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:10,457 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895259595]
[2023-10-27 12:21:10,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:10,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:10,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:11,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:11,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:11,191 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895259595]
[2023-10-27 12:21:11,191 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895259595] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:21:11,191 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894629663]
[2023-10-27 12:21:11,191 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-27 12:21:11,191 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:21:11,192 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:21:11,192 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:21:11,232 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-10-27 12:21:11,383 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:21:11,383 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:21:11,384 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-10-27 12:21:11,387 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:21:11,396 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:21:11,400 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2023-10-27 12:21:11,525 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:21:11,525 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-27 12:21:11,579 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:21:11,579 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-27 12:21:11,589 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:21:11,641 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:21:11,690 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-27 12:21:11,737 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:21:11,737 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:21:11,795 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:21:11,796 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-27 12:21:11,822 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:21:11,824 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-27 12:21:11,840 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:21:11,840 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-27 12:21:11,863 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:21:11,864 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-27 12:21:11,907 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:21:11,907 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:21:11,931 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:21:11,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:21:11,943 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:21:11,943 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894629663] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:11,944 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:21:11,944 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16
[2023-10-27 12:21:11,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072102205]
[2023-10-27 12:21:11,944 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:11,944 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-27 12:21:11,944 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:11,945 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-27 12:21:11,945 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306
[2023-10-27 12:21:12,533 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-10-27 12:21:12,534 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 1519 transitions, 26205 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:12,534 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:12,534 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-10-27 12:21:12,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:31,435 INFO  L130       PetriNetUnfolder]: 29302/51201 cut-off events.
[2023-10-27 12:21:31,436 INFO  L131       PetriNetUnfolder]: For 792739/793363 co-relation queries the response was YES.
[2023-10-27 12:21:31,754 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 380440 conditions, 51201 events. 29302/51201 cut-off events. For 792739/793363 co-relation queries the response was YES. Maximal size of possible extension queue 1604. Compared 436333 event pairs, 3287 based on Foata normal form. 454/51290 useless extension candidates. Maximal degree in co-relation 380372. Up to 26464 conditions per place. 
[2023-10-27 12:21:31,980 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1356 selfloop transitions, 638 changer transitions 30/2036 dead transitions.
[2023-10-27 12:21:31,981 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 2036 transitions, 37326 flow
[2023-10-27 12:21:31,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-10-27 12:21:31,981 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-10-27 12:21:31,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1419 transitions.
[2023-10-27 12:21:31,982 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4894791307347361
[2023-10-27 12:21:31,983 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1419 transitions.
[2023-10-27 12:21:31,983 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1419 transitions.
[2023-10-27 12:21:31,983 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:31,983 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1419 transitions.
[2023-10-27 12:21:31,984 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 109.15384615384616) internal successors, (1419), 13 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:31,986 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 223.0) internal successors, (3122), 14 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:31,987 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 223.0) internal successors, (3122), 14 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:31,987 INFO  L175             Difference]: Start difference. First operand has 194 places, 1519 transitions, 26205 flow. Second operand 13 states and 1419 transitions.
[2023-10-27 12:21:31,987 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 2036 transitions, 37326 flow
[2023-10-27 12:21:47,226 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 2036 transitions, 36322 flow, removed 433 selfloop flow, removed 5 redundant places.
[2023-10-27 12:21:47,268 INFO  L231             Difference]: Finished difference. Result has 206 places, 1644 transitions, 29953 flow
[2023-10-27 12:21:47,269 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=25312, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=525, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=29953, PETRI_PLACES=206, PETRI_TRANSITIONS=1644}
[2023-10-27 12:21:47,270 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 139 predicate places.
[2023-10-27 12:21:47,270 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 1644 transitions, 29953 flow
[2023-10-27 12:21:47,270 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:47,270 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:47,270 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-10-27 12:21:47,276 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-10-27 12:21:47,474 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-10-27 12:21:47,475 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:21:47,476 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:47,476 INFO  L85        PathProgramCache]: Analyzing trace with hash -1301331673, now seen corresponding path program 1 times
[2023-10-27 12:21:47,477 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:47,489 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126485880]
[2023-10-27 12:21:47,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:47,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:47,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:21:47,537 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:21:47,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:21:47,585 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:21:47,586 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:21:47,586 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2023-10-27 12:21:47,586 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2023-10-27 12:21:47,586 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2023-10-27 12:21:47,586 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2023-10-27 12:21:47,586 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2023-10-27 12:21:47,587 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2023-10-27 12:21:47,587 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2023-10-27 12:21:47,587 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2023-10-27 12:21:47,587 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2023-10-27 12:21:47,587 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2023-10-27 12:21:47,587 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2023-10-27 12:21:47,588 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2023-10-27 12:21:47,588 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2023-10-27 12:21:47,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-27 12:21:47,588 INFO  L445         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:47,588 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:21:47,588 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-27 12:21:47,619 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-27 12:21:47,621 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2023-10-27 12:21:47,683 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2023-10-27 12:21:47,684 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-27 12:21:47,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1531 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2023-10-27 12:21:47,685 INFO  L82        GeneralOperation]: Start removeDead. Operand has 159 places, 158 transitions, 346 flow
[2023-10-27 12:21:47,689 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 159 places, 158 transitions, 346 flow
[2023-10-27 12:21:47,698 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:21:47,698 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 158 transitions, 346 flow
[2023-10-27 12:21:47,701 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 158 transitions, 346 flow
[2023-10-27 12:21:47,701 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2023-10-27 12:21:47,753 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2023-10-27 12:21:47,753 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-27 12:21:47,754 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1531 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2023-10-27 12:21:47,776 INFO  L119        LiptonReduction]: Number of co-enabled transitions 9576
[2023-10-27 12:21:50,672 INFO  L134        LiptonReduction]: Checked pairs total: 53700
[2023-10-27 12:21:50,672 INFO  L136        LiptonReduction]: Total number of compositions: 94
[2023-10-27 12:21:50,673 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:21:50,674 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;@42c43cb1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:21:50,674 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-10-27 12:21:50,674 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-27 12:21:50,674 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:21:50,674 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:50,674 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-27 12:21:50,674 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:21:50,674 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:50,674 INFO  L85        PathProgramCache]: Analyzing trace with hash 900, now seen corresponding path program 1 times
[2023-10-27 12:21:50,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:50,674 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446355907]
[2023-10-27 12:21:50,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:50,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:50,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:50,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:50,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:50,690 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446355907]
[2023-10-27 12:21:50,690 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446355907] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:50,690 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:50,691 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-27 12:21:50,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608368484]
[2023-10-27 12:21:50,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:50,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:21:50,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:50,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:21:50,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:21:50,692 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 252
[2023-10-27 12:21:50,693 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 182 flow. Second operand  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:50,693 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:50,693 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 252
[2023-10-27 12:21:50,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:51,752 INFO  L130       PetriNetUnfolder]: 3248/7585 cut-off events.
[2023-10-27 12:21:51,752 INFO  L131       PetriNetUnfolder]: For 647/1494 co-relation queries the response was YES.
[2023-10-27 12:21:51,759 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12704 conditions, 7585 events. 3248/7585 cut-off events. For 647/1494 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 64204 event pairs, 3205 based on Foata normal form. 0/6863 useless extension candidates. Maximal degree in co-relation 10479. Up to 4887 conditions per place. 
[2023-10-27 12:21:51,774 INFO  L137   encePairwiseOnDemand]: 251/252 looper letters, 27 selfloop transitions, 0 changer transitions 0/75 dead transitions.
[2023-10-27 12:21:51,775 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 234 flow
[2023-10-27 12:21:51,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:21:51,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:21:51,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 326 transitions.
[2023-10-27 12:21:51,776 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6468253968253969
[2023-10-27 12:21:51,776 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 326 transitions.
[2023-10-27 12:21:51,776 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 326 transitions.
[2023-10-27 12:21:51,776 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:51,777 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 326 transitions.
[2023-10-27 12:21:51,777 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 163.0) internal successors, (326), 2 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:51,778 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:51,778 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:51,778 INFO  L175             Difference]: Start difference. First operand has 80 places, 76 transitions, 182 flow. Second operand 2 states and 326 transitions.
[2023-10-27 12:21:51,778 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 234 flow
[2023-10-27 12:21:51,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:21:51,780 INFO  L231             Difference]: Finished difference. Result has 80 places, 75 transitions, 180 flow
[2023-10-27 12:21:51,780 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=80, PETRI_TRANSITIONS=75}
[2023-10-27 12:21:51,792 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places.
[2023-10-27 12:21:51,792 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 180 flow
[2023-10-27 12:21:51,792 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:51,792 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:51,793 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:51,793 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-10-27 12:21:51,793 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:21:51,793 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:51,793 INFO  L85        PathProgramCache]: Analyzing trace with hash -164949161, now seen corresponding path program 1 times
[2023-10-27 12:21:51,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:51,794 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394179197]
[2023-10-27 12:21:51,794 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:51,794 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:51,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:51,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:51,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:51,968 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394179197]
[2023-10-27 12:21:51,968 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394179197] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:51,968 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:51,968 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:21:51,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569834714]
[2023-10-27 12:21:51,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:51,969 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:21:51,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:51,969 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:21:51,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:21:52,238 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 252
[2023-10-27 12:21:52,238 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 180 flow. Second operand  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:52,238 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:52,238 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 252
[2023-10-27 12:21:52,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:22:02,020 INFO  L130       PetriNetUnfolder]: 72405/116612 cut-off events.
[2023-10-27 12:22:02,020 INFO  L131       PetriNetUnfolder]: For 3734/4224 co-relation queries the response was YES.
[2023-10-27 12:22:02,194 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 222409 conditions, 116612 events. 72405/116612 cut-off events. For 3734/4224 co-relation queries the response was YES. Maximal size of possible extension queue 2839. Compared 983482 event pairs, 18294 based on Foata normal form. 157/112065 useless extension candidates. Maximal degree in co-relation 222403. Up to 69950 conditions per place. 
[2023-10-27 12:22:02,574 INFO  L137   encePairwiseOnDemand]: 221/252 looper letters, 109 selfloop transitions, 64 changer transitions 0/195 dead transitions.
[2023-10-27 12:22:02,575 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 195 transitions, 787 flow
[2023-10-27 12:22:02,575 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:22:02,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:22:02,576 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 872 transitions.
[2023-10-27 12:22:02,576 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5767195767195767
[2023-10-27 12:22:02,576 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 872 transitions.
[2023-10-27 12:22:02,576 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 872 transitions.
[2023-10-27 12:22:02,576 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:22:02,577 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 872 transitions.
[2023-10-27 12:22:02,577 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 145.33333333333334) internal successors, (872), 6 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:02,707 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:02,707 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:02,707 INFO  L175             Difference]: Start difference. First operand has 80 places, 75 transitions, 180 flow. Second operand 6 states and 872 transitions.
[2023-10-27 12:22:02,707 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 195 transitions, 787 flow
[2023-10-27 12:22:02,714 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 195 transitions, 787 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:22:02,735 INFO  L231             Difference]: Finished difference. Result has 90 places, 139 transitions, 626 flow
[2023-10-27 12:22:02,735 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=90, PETRI_TRANSITIONS=139}
[2023-10-27 12:22:02,736 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places.
[2023-10-27 12:22:02,736 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 139 transitions, 626 flow
[2023-10-27 12:22:02,736 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:02,736 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:22:02,736 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:22:02,736 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-10-27 12:22:02,736 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:22:02,737 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:22:02,737 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831077822, now seen corresponding path program 1 times
[2023-10-27 12:22:02,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:22:02,737 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894839224]
[2023-10-27 12:22:02,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:02,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:22:02,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:02,760 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:02,760 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:22:02,761 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894839224]
[2023-10-27 12:22:02,761 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894839224] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:22:02,761 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:22:02,761 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:22:02,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479519622]
[2023-10-27 12:22:02,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:22:02,771 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:22:02,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:22:02,772 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:22:02,772 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:22:02,786 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 252
[2023-10-27 12:22:02,787 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 139 transitions, 626 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:02,787 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:22:02,787 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 252
[2023-10-27 12:22:02,787 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:22:03,696 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse])
[2023-10-27 12:22:03,696 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-27 12:22:03,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:22:03,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:22:03,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:22:03,697 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse])
[2023-10-27 12:22:03,697 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-27 12:22:03,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:22:03,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:22:03,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:22:06,338 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 58#$Ultimate##0true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:06,338 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,339 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,339 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,339 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,339 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:06,339 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,339 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,339 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,340 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,340 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 139#L1017-1true, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:06,340 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,340 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,340 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,340 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,341 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 58#$Ultimate##0true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:06,341 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,341 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,341 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,341 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:22:06,800 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:06,801 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,802 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:06,802 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,803 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:06,803 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,815 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,815 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,815 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,816 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 139#L1017-1true, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:06,817 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,817 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,817 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:06,817 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:22:07,035 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:07,036 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,036 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,036 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,036 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,037 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:07,037 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,037 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,037 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,037 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,038 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:07,038 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,038 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,038 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,038 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:22:07,432 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-27 12:22:07,433 INFO  L383   tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event
[2023-10-27 12:22:07,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-27 12:22:07,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-27 12:22:07,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-27 12:22:09,199 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_170| v_~datas~0.base_129)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_33 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_113))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_113))) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|)))  InVars {#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  OutVars{#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 36#L1029-1true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 7#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2023-10-27 12:22:09,199 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-10-27 12:22:09,199 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:22:09,199 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:22:09,200 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:22:09,200 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_170| v_~datas~0.base_129)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_33 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_113))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_113))) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|)))  InVars {#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  OutVars{#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 100#L1031true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 7#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2023-10-27 12:22:09,200 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-10-27 12:22:09,200 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:22:09,200 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:22:09,200 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:22:09,370 INFO  L130       PetriNetUnfolder]: 39413/75193 cut-off events.
[2023-10-27 12:22:09,371 INFO  L131       PetriNetUnfolder]: For 40753/48755 co-relation queries the response was YES.
[2023-10-27 12:22:09,592 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 180406 conditions, 75193 events. 39413/75193 cut-off events. For 40753/48755 co-relation queries the response was YES. Maximal size of possible extension queue 2636. Compared 755451 event pairs, 17234 based on Foata normal form. 1078/70433 useless extension candidates. Maximal degree in co-relation 180395. Up to 34821 conditions per place. 
[2023-10-27 12:22:10,056 INFO  L137   encePairwiseOnDemand]: 244/252 looper letters, 51 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2023-10-27 12:22:10,056 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 766 flow
[2023-10-27 12:22:10,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:22:10,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:22:10,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions.
[2023-10-27 12:22:10,057 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5992063492063492
[2023-10-27 12:22:10,058 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 453 transitions.
[2023-10-27 12:22:10,058 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions.
[2023-10-27 12:22:10,058 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:22:10,058 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions.
[2023-10-27 12:22:10,058 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:10,059 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:10,059 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:10,059 INFO  L175             Difference]: Start difference. First operand has 90 places, 139 transitions, 626 flow. Second operand 3 states and 453 transitions.
[2023-10-27 12:22:10,060 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 766 flow
[2023-10-27 12:22:10,855 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 766 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:22:10,856 INFO  L231             Difference]: Finished difference. Result has 89 places, 139 transitions, 646 flow
[2023-10-27 12:22:10,856 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=89, PETRI_TRANSITIONS=139}
[2023-10-27 12:22:10,857 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places.
[2023-10-27 12:22:10,857 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 139 transitions, 646 flow
[2023-10-27 12:22:10,857 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:10,858 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:22:10,858 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:22:10,858 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-10-27 12:22:10,858 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:22:10,858 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:22:10,858 INFO  L85        PathProgramCache]: Analyzing trace with hash -214994823, now seen corresponding path program 1 times
[2023-10-27 12:22:10,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:22:10,859 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479243679]
[2023-10-27 12:22:10,859 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:10,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:22:10,872 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:11,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:11,063 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:22:11,071 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479243679]
[2023-10-27 12:22:11,071 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479243679] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:22:11,071 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:22:11,072 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:22:11,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389528273]
[2023-10-27 12:22:11,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:22:11,072 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:22:11,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:22:11,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:22:11,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:22:11,305 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 252
[2023-10-27 12:22:11,306 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 139 transitions, 646 flow. Second operand  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:11,306 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:22:11,306 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 252
[2023-10-27 12:22:11,306 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:22:23,227 INFO  L130       PetriNetUnfolder]: 77040/122336 cut-off events.
[2023-10-27 12:22:23,227 INFO  L131       PetriNetUnfolder]: For 92792/93950 co-relation queries the response was YES.
[2023-10-27 12:22:23,606 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 335803 conditions, 122336 events. 77040/122336 cut-off events. For 92792/93950 co-relation queries the response was YES. Maximal size of possible extension queue 2947. Compared 1014085 event pairs, 25862 based on Foata normal form. 0/116443 useless extension candidates. Maximal degree in co-relation 335791. Up to 86387 conditions per place. 
[2023-10-27 12:22:24,058 INFO  L137   encePairwiseOnDemand]: 233/252 looper letters, 146 selfloop transitions, 102 changer transitions 0/291 dead transitions.
[2023-10-27 12:22:24,058 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 291 transitions, 1803 flow
[2023-10-27 12:22:24,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:22:24,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:22:24,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 892 transitions.
[2023-10-27 12:22:24,059 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.58994708994709
[2023-10-27 12:22:24,060 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 892 transitions.
[2023-10-27 12:22:24,060 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 892 transitions.
[2023-10-27 12:22:24,060 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:22:24,060 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 892 transitions.
[2023-10-27 12:22:24,061 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:24,062 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:24,062 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:24,063 INFO  L175             Difference]: Start difference. First operand has 89 places, 139 transitions, 646 flow. Second operand 6 states and 892 transitions.
[2023-10-27 12:22:24,063 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 291 transitions, 1803 flow
[2023-10-27 12:22:24,248 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 291 transitions, 1803 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:22:24,250 INFO  L231             Difference]: Finished difference. Result has 99 places, 240 transitions, 1604 flow
[2023-10-27 12:22:24,251 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1604, PETRI_PLACES=99, PETRI_TRANSITIONS=240}
[2023-10-27 12:22:24,251 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places.
[2023-10-27 12:22:24,251 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 240 transitions, 1604 flow
[2023-10-27 12:22:24,251 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:24,252 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:22:24,252 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:22:24,252 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-10-27 12:22:24,252 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:22:24,252 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:22:24,252 INFO  L85        PathProgramCache]: Analyzing trace with hash 135492018, now seen corresponding path program 1 times
[2023-10-27 12:22:24,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:22:24,253 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211687012]
[2023-10-27 12:22:24,253 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:24,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:22:24,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:24,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:24,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:22:24,623 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211687012]
[2023-10-27 12:22:24,623 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211687012] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:22:24,624 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:22:24,624 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:22:24,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904563988]
[2023-10-27 12:22:24,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:22:24,624 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:22:24,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:22:24,625 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:22:24,625 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:22:24,856 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 252
[2023-10-27 12:22:24,857 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 240 transitions, 1604 flow. Second operand  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:24,857 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:22:24,857 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 252
[2023-10-27 12:22:24,857 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:22:54,987 INFO  L130       PetriNetUnfolder]: 162624/249129 cut-off events.
[2023-10-27 12:22:54,987 INFO  L131       PetriNetUnfolder]: For 278364/281003 co-relation queries the response was YES.
[2023-10-27 12:22:55,823 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 804273 conditions, 249129 events. 162624/249129 cut-off events. For 278364/281003 co-relation queries the response was YES. Maximal size of possible extension queue 5466. Compared 2101517 event pairs, 45865 based on Foata normal form. 0/234625 useless extension candidates. Maximal degree in co-relation 804256. Up to 163056 conditions per place. 
[2023-10-27 12:22:57,177 INFO  L137   encePairwiseOnDemand]: 222/252 looper letters, 328 selfloop transitions, 162 changer transitions 0/513 dead transitions.
[2023-10-27 12:22:57,178 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 513 transitions, 4050 flow
[2023-10-27 12:22:57,178 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:22:57,178 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:22:57,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 913 transitions.
[2023-10-27 12:22:57,179 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6038359788359788
[2023-10-27 12:22:57,179 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 913 transitions.
[2023-10-27 12:22:57,179 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 913 transitions.
[2023-10-27 12:22:57,179 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:22:57,180 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 913 transitions.
[2023-10-27 12:22:57,180 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:57,181 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:57,182 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:57,182 INFO  L175             Difference]: Start difference. First operand has 99 places, 240 transitions, 1604 flow. Second operand 6 states and 913 transitions.
[2023-10-27 12:22:57,182 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 513 transitions, 4050 flow
[2023-10-27 12:22:59,589 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 513 transitions, 4050 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:22:59,593 INFO  L231             Difference]: Finished difference. Result has 108 places, 395 transitions, 3161 flow
[2023-10-27 12:22:59,593 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3161, PETRI_PLACES=108, PETRI_TRANSITIONS=395}
[2023-10-27 12:22:59,593 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places.
[2023-10-27 12:22:59,594 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 395 transitions, 3161 flow
[2023-10-27 12:22:59,594 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:59,594 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:22:59,594 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:22:59,594 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2023-10-27 12:22:59,594 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:22:59,595 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:22:59,595 INFO  L85        PathProgramCache]: Analyzing trace with hash -728071784, now seen corresponding path program 1 times
[2023-10-27 12:22:59,595 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:22:59,595 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420870681]
[2023-10-27 12:22:59,595 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:59,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:22:59,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:59,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-27 12:22:59,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:22:59,920 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420870681]
[2023-10-27 12:22:59,921 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420870681] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:22:59,921 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276386521]
[2023-10-27 12:22:59,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:59,921 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:22:59,921 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:22:59,925 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:22:59,944 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-10-27 12:23:00,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:00,079 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-10-27 12:23:00,086 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:23:00,172 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:23:00,203 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:00,204 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:23:00,251 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:00,252 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:00,252 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:23:00,298 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:00,299 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:00,300 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:00,301 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:23:00,366 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:00,367 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:23:00,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-27 12:23:00,405 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:23:00,441 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2023-10-27 12:23:00,462 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2023-10-27 12:23:00,495 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2023-10-27 12:23:00,519 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse3 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2023-10-27 12:23:00,541 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:00,541 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2023-10-27 12:23:00,548 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:00,552 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-10-27 12:23:00,559 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-10-27 12:23:00,583 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:23:00,584 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-27 12:23:00,587 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:23:00,587 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-27 12:23:00,591 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:23:00,591 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-27 12:23:00,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked.
[2023-10-27 12:23:00,606 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276386521] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:23:00,606 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:23:00,606 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2023-10-27 12:23:00,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143430515]
[2023-10-27 12:23:00,606 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:23:00,607 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-10-27 12:23:00,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:00,612 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-10-27 12:23:00,612 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=122, Unknown=4, NotChecked=108, Total=306
[2023-10-27 12:23:00,671 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 252
[2023-10-27 12:23:00,672 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 395 transitions, 3161 flow. Second operand  has 18 states, 18 states have (on average 95.33333333333333) internal successors, (1716), 18 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:00,672 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:00,672 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 252
[2023-10-27 12:23:00,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
