./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/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 e280ea7002eb926faba3195da50aa743246f3289123bb9a1b445dc9aaf8e8f3d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 21:47:52,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 21:47:52,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 21:47:52,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 21:47:52,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 21:47:52,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 21:47:52,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 21:47:52,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 21:47:52,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 21:47:52,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 21:47:52,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 21:47:52,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 21:47:52,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 21:47:52,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 21:47:52,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 21:47:52,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 21:47:52,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 21:47:52,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 21:47:52,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 21:47:52,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 21:47:52,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 21:47:52,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 21:47:52,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 21:47:52,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 21:47:52,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 21:47:52,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 21:47:52,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 21:47:52,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 21:47:52,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 21:47:52,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 21:47:52,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 21:47:52,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 21:47:52,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 21:47:52,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 21:47:52,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 21:47:52,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 21:47:52,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 21:47:52,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 21:47:52,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 21:47:52,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 21:47:52,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 21:47:52,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-31 21:47:52,448 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 21:47:52,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 21:47:52,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 21:47:52,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 21:47:52,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 21:47:52,451 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 21:47:52,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 21:47:52,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 21:47:52,452 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 21:47:52,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 21:47:52,453 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 21:47:52,453 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 21:47:52,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 21:47:52,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 21:47:52,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 21:47:52,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 21:47:52,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 21:47:52,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 21:47:52,454 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-31 21:47:52,454 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 21:47:52,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 21:47:52,455 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 21:47:52,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 21:47:52,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 21:47:52,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 21:47:52,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 21:47:52,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 21:47:52,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 21:47:52,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 21:47:52,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 21:47:52,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 21:47:52,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 21:47:52,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 21:47:52,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 21:47:52,457 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 21:47:52,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 21:47:52,458 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 21:47:52,458 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:/storage/repos/ultimate/releaseScripts/default/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 -> /storage/repos/ultimate/releaseScripts/default/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 -> e280ea7002eb926faba3195da50aa743246f3289123bb9a1b445dc9aaf8e8f3d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 21:47:52,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 21:47:52,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 21:47:52,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 21:47:52,773 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 21:47:52,773 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 21:47:52,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2023-08-31 21:47:53,990 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 21:47:54,167 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 21:47:54,168 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2023-08-31 21:47:54,181 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b9d7e606/9f818e6d197f48478577db2e17c76d38/FLAG4f27b9a2c [2023-08-31 21:47:54,203 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b9d7e606/9f818e6d197f48478577db2e17c76d38 [2023-08-31 21:47:54,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 21:47:54,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 21:47:54,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 21:47:54,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 21:47:54,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 21:47:54,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5442b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54, skipping insertion in model container [2023-08-31 21:47:54,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 21:47:54,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 21:47:54,493 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c[3182,3195] [2023-08-31 21:47:54,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 21:47:54,517 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 21:47:54,572 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c[3182,3195] [2023-08-31 21:47:54,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 21:47:54,589 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 21:47:54,589 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 21:47:54,594 INFO L208 MainTranslator]: Completed translation [2023-08-31 21:47:54,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54 WrapperNode [2023-08-31 21:47:54,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 21:47:54,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 21:47:54,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 21:47:54,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 21:47:54,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,669 INFO L138 Inliner]: procedures = 28, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 668 [2023-08-31 21:47:54,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 21:47:54,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 21:47:54,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 21:47:54,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 21:47:54,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,745 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 21:47:54,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 21:47:54,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 21:47:54,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 21:47:54,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (1/1) ... [2023-08-31 21:47:54,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 21:47:54,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 21:47:54,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 21:47:54,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 21:47:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 21:47:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-31 21:47:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 21:47:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 21:47:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 21:47:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-08-31 21:47:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 21:47:54,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 21:47:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 21:47:54,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 21:47:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 21:47:54,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 21:47:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 21:47:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 21:47:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 21:47:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 21:47:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 21:47:54,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 21:47:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 21:47:54,848 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 21:47:55,017 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 21:47:55,019 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 21:47:55,938 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 21:47:56,257 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 21:47:56,258 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-31 21:47:56,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 09:47:56 BoogieIcfgContainer [2023-08-31 21:47:56,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 21:47:56,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 21:47:56,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 21:47:56,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 21:47:56,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 09:47:54" (1/3) ... [2023-08-31 21:47:56,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467ac68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 09:47:56, skipping insertion in model container [2023-08-31 21:47:56,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 09:47:54" (2/3) ... [2023-08-31 21:47:56,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467ac68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 09:47:56, skipping insertion in model container [2023-08-31 21:47:56,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 09:47:56" (3/3) ... [2023-08-31 21:47:56,269 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2023-08-31 21:47:56,277 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 21:47:56,285 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 21:47:56,285 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 87 error locations. [2023-08-31 21:47:56,285 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 21:47:56,454 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-31 21:47:56,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 592 places, 618 transitions, 1260 flow [2023-08-31 21:47:56,732 INFO L130 PetriNetUnfolder]: 36/615 cut-off events. [2023-08-31 21:47:56,733 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 21:47:56,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 615 events. 36/615 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1990 event pairs, 0 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 471. Up to 2 conditions per place. [2023-08-31 21:47:56,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 592 places, 618 transitions, 1260 flow [2023-08-31 21:47:56,759 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 573 places, 598 transitions, 1214 flow [2023-08-31 21:47:56,762 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 21:47:56,774 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 573 places, 598 transitions, 1214 flow [2023-08-31 21:47:56,777 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 573 places, 598 transitions, 1214 flow [2023-08-31 21:47:56,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 573 places, 598 transitions, 1214 flow [2023-08-31 21:47:56,891 INFO L130 PetriNetUnfolder]: 35/598 cut-off events. [2023-08-31 21:47:56,891 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 21:47:56,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 598 events. 35/598 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1993 event pairs, 0 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 471. Up to 2 conditions per place. [2023-08-31 21:47:56,941 INFO L119 LiptonReduction]: Number of co-enabled transitions 66564 [2023-08-31 21:49:18,491 INFO L134 LiptonReduction]: Checked pairs total: 477518 [2023-08-31 21:49:18,492 INFO L136 LiptonReduction]: Total number of compositions: 546 [2023-08-31 21:49:18,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 21:49:18,509 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;@69670437, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 21:49:18,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 151 error locations. [2023-08-31 21:49:18,511 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 21:49:18,511 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 21:49:18,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:49:18,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 21:49:18,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:49:18,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:49:18,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2680, now seen corresponding path program 1 times [2023-08-31 21:49:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:49:18,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351749721] [2023-08-31 21:49:18,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:49:18,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:49:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:49:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 21:49:18,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:49:18,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351749721] [2023-08-31 21:49:18,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351749721] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:49:18,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:49:18,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 21:49:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590762775] [2023-08-31 21:49:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:49:18,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 21:49:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:49:18,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 21:49:18,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 21:49:18,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 1164 [2023-08-31 21:49:18,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 251 transitions, 520 flow. Second operand has 2 states, 2 states have (on average 562.5) internal successors, (1125), 2 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:18,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:49:18,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 1164 [2023-08-31 21:49:18,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:49:22,281 INFO L130 PetriNetUnfolder]: 10996/26551 cut-off events. [2023-08-31 21:49:22,282 INFO L131 PetriNetUnfolder]: For 578/578 co-relation queries the response was YES. [2023-08-31 21:49:22,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41490 conditions, 26551 events. 10996/26551 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 294282 event pairs, 7645 based on Foata normal form. 1555/22178 useless extension candidates. Maximal degree in co-relation 38075. Up to 14547 conditions per place. [2023-08-31 21:49:22,619 INFO L137 encePairwiseOnDemand]: 1108/1164 looper letters, 58 selfloop transitions, 0 changer transitions 1/195 dead transitions. [2023-08-31 21:49:22,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 195 transitions, 526 flow [2023-08-31 21:49:22,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 21:49:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 21:49:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1239 transitions. [2023-08-31 21:49:22,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5322164948453608 [2023-08-31 21:49:22,640 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1239 transitions. [2023-08-31 21:49:22,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1239 transitions. [2023-08-31 21:49:22,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:49:22,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1239 transitions. [2023-08-31 21:49:22,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 619.5) internal successors, (1239), 2 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:22,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 1164.0) internal successors, (3492), 3 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:22,663 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 1164.0) internal successors, (3492), 3 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:22,664 INFO L175 Difference]: Start difference. First operand has 242 places, 251 transitions, 520 flow. Second operand 2 states and 1239 transitions. [2023-08-31 21:49:22,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 195 transitions, 526 flow [2023-08-31 21:49:22,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 195 transitions, 514 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-31 21:49:22,695 INFO L231 Difference]: Finished difference. Result has 187 places, 194 transitions, 393 flow [2023-08-31 21:49:22,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=393, PETRI_PLACES=187, PETRI_TRANSITIONS=194} [2023-08-31 21:49:22,704 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -55 predicate places. [2023-08-31 21:49:22,704 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 194 transitions, 393 flow [2023-08-31 21:49:22,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 562.5) internal successors, (1125), 2 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:22,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:49:22,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:49:22,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 21:49:22,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:49:22,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:49:22,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1016127394, now seen corresponding path program 1 times [2023-08-31 21:49:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:49:22,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964568111] [2023-08-31 21:49:22,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:49:22,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:49:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:49:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 21:49:22,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:49:22,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964568111] [2023-08-31 21:49:22,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964568111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:49:22,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:49:22,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 21:49:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129657735] [2023-08-31 21:49:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:49:22,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 21:49:22,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:49:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 21:49:22,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 21:49:22,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 1164 [2023-08-31 21:49:22,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 194 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:22,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:49:22,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 1164 [2023-08-31 21:49:22,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:49:25,823 INFO L130 PetriNetUnfolder]: 13301/31171 cut-off events. [2023-08-31 21:49:25,823 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2023-08-31 21:49:25,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49066 conditions, 31171 events. 13301/31171 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 344195 event pairs, 9727 based on Foata normal form. 0/24340 useless extension candidates. Maximal degree in co-relation 49063. Up to 17759 conditions per place. [2023-08-31 21:49:26,040 INFO L137 encePairwiseOnDemand]: 1161/1164 looper letters, 60 selfloop transitions, 1 changer transitions 0/192 dead transitions. [2023-08-31 21:49:26,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 192 transitions, 511 flow [2023-08-31 21:49:26,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 21:49:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 21:49:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2023-08-31 21:49:26,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48711340206185566 [2023-08-31 21:49:26,046 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1701 transitions. [2023-08-31 21:49:26,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1701 transitions. [2023-08-31 21:49:26,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:49:26,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1701 transitions. [2023-08-31 21:49:26,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 567.0) internal successors, (1701), 3 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:26,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:26,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:26,059 INFO L175 Difference]: Start difference. First operand has 187 places, 194 transitions, 393 flow. Second operand 3 states and 1701 transitions. [2023-08-31 21:49:26,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 192 transitions, 511 flow [2023-08-31 21:49:26,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 192 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 21:49:26,068 INFO L231 Difference]: Finished difference. Result has 186 places, 192 transitions, 391 flow [2023-08-31 21:49:26,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=186, PETRI_TRANSITIONS=192} [2023-08-31 21:49:26,070 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -56 predicate places. [2023-08-31 21:49:26,070 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 192 transitions, 391 flow [2023-08-31 21:49:26,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:26,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:49:26,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:49:26,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 21:49:26,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:49:26,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:49:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1540780517, now seen corresponding path program 1 times [2023-08-31 21:49:26,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:49:26,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001484040] [2023-08-31 21:49:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:49:26,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:49:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:49:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 21:49:26,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:49:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001484040] [2023-08-31 21:49:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001484040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:49:26,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:49:26,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 21:49:26,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066987625] [2023-08-31 21:49:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:49:26,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 21:49:26,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:49:26,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 21:49:26,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 21:49:26,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 1164 [2023-08-31 21:49:26,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 192 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:26,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:49:26,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 1164 [2023-08-31 21:49:26,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:49:29,824 INFO L130 PetriNetUnfolder]: 21210/49026 cut-off events. [2023-08-31 21:49:29,824 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2023-08-31 21:49:29,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77626 conditions, 49026 events. 21210/49026 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 1750. Compared 566118 event pairs, 8791 based on Foata normal form. 0/40431 useless extension candidates. Maximal degree in co-relation 77622. Up to 28163 conditions per place. [2023-08-31 21:49:30,127 INFO L137 encePairwiseOnDemand]: 1155/1164 looper letters, 82 selfloop transitions, 3 changer transitions 0/204 dead transitions. [2023-08-31 21:49:30,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 204 transitions, 589 flow [2023-08-31 21:49:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 21:49:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 21:49:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1720 transitions. [2023-08-31 21:49:30,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925544100801833 [2023-08-31 21:49:30,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1720 transitions. [2023-08-31 21:49:30,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1720 transitions. [2023-08-31 21:49:30,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:49:30,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1720 transitions. [2023-08-31 21:49:30,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:30,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:30,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:30,146 INFO L175 Difference]: Start difference. First operand has 186 places, 192 transitions, 391 flow. Second operand 3 states and 1720 transitions. [2023-08-31 21:49:30,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 204 transitions, 589 flow [2023-08-31 21:49:30,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 204 transitions, 588 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 21:49:30,152 INFO L231 Difference]: Finished difference. Result has 182 places, 189 transitions, 399 flow [2023-08-31 21:49:30,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=182, PETRI_TRANSITIONS=189} [2023-08-31 21:49:30,154 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -60 predicate places. [2023-08-31 21:49:30,156 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 189 transitions, 399 flow [2023-08-31 21:49:30,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:30,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:49:30,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:49:30,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 21:49:30,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:49:30,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:49:30,159 INFO L85 PathProgramCache]: Analyzing trace with hash -890424331, now seen corresponding path program 1 times [2023-08-31 21:49:30,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:49:30,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935984545] [2023-08-31 21:49:30,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:49:30,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:49:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:49:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 21:49:30,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:49:30,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935984545] [2023-08-31 21:49:30,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935984545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:49:30,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:49:30,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 21:49:30,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745126284] [2023-08-31 21:49:30,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:49:30,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 21:49:30,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:49:30,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 21:49:30,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 21:49:30,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 1164 [2023-08-31 21:49:30,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 189 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 552.0) internal successors, (1656), 3 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:30,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:49:30,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 1164 [2023-08-31 21:49:30,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:49:31,602 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][33], [609#(= |#race~M~0| 0), 193#L72-8true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), 163#L104-4true, Black: 602#true]) [2023-08-31 21:49:31,603 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-31 21:49:31,603 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-31 21:49:31,603 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 21:49:31,603 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:31,658 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][33], [609#(= |#race~M~0| 0), 193#L72-8true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:31,658 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-31 21:49:31,659 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-31 21:49:31,659 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 21:49:31,659 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:31,735 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][33], [130#thread3EXITtrue, 609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), 163#L104-4true, Black: 602#true]) [2023-08-31 21:49:31,736 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:49:31,736 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:49:31,736 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:31,736 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:31,736 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][33], [609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), 163#L104-4true, 293#L73true, Black: 602#true]) [2023-08-31 21:49:31,736 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:49:31,736 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:31,736 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:49:31,737 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:31,961 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][33], [130#thread3EXITtrue, 609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:31,961 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 21:49:31,961 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:31,961 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:31,961 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:49:31,961 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][33], [609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 293#L73true]) [2023-08-31 21:49:31,961 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 21:49:31,962 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:49:31,962 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:31,962 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:33,030 INFO L130 PetriNetUnfolder]: 14189/32904 cut-off events. [2023-08-31 21:49:33,030 INFO L131 PetriNetUnfolder]: For 1176/1176 co-relation queries the response was YES. [2023-08-31 21:49:33,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53135 conditions, 32904 events. 14189/32904 cut-off events. For 1176/1176 co-relation queries the response was YES. Maximal size of possible extension queue 1274. Compared 365014 event pairs, 9506 based on Foata normal form. 0/26508 useless extension candidates. Maximal degree in co-relation 53131. Up to 18882 conditions per place. [2023-08-31 21:49:33,268 INFO L137 encePairwiseOnDemand]: 1161/1164 looper letters, 60 selfloop transitions, 1 changer transitions 0/187 dead transitions. [2023-08-31 21:49:33,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 187 transitions, 517 flow [2023-08-31 21:49:33,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 21:49:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 21:49:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2023-08-31 21:49:33,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48940435280641464 [2023-08-31 21:49:33,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1709 transitions. [2023-08-31 21:49:33,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1709 transitions. [2023-08-31 21:49:33,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:49:33,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1709 transitions. [2023-08-31 21:49:33,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 569.6666666666666) internal successors, (1709), 3 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:33,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:33,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:33,288 INFO L175 Difference]: Start difference. First operand has 182 places, 189 transitions, 399 flow. Second operand 3 states and 1709 transitions. [2023-08-31 21:49:33,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 187 transitions, 517 flow [2023-08-31 21:49:33,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 187 transitions, 517 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 21:49:33,292 INFO L231 Difference]: Finished difference. Result has 182 places, 187 transitions, 397 flow [2023-08-31 21:49:33,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=182, PETRI_TRANSITIONS=187} [2023-08-31 21:49:33,293 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -60 predicate places. [2023-08-31 21:49:33,293 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 187 transitions, 397 flow [2023-08-31 21:49:33,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 552.0) internal successors, (1656), 3 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:33,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:49:33,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:49:33,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 21:49:33,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:49:33,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:49:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1041709781, now seen corresponding path program 1 times [2023-08-31 21:49:33,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:49:33,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580211095] [2023-08-31 21:49:33,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:49:33,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:49:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:49:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 21:49:33,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:49:33,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580211095] [2023-08-31 21:49:33,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580211095] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:49:33,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:49:33,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 21:49:33,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249650432] [2023-08-31 21:49:33,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:49:33,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 21:49:33,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:49:33,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 21:49:33,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 21:49:34,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 1164 [2023-08-31 21:49:34,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 187 transitions, 397 flow. Second operand has 6 states, 6 states have (on average 539.3333333333334) internal successors, (3236), 6 states have internal predecessors, (3236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:34,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:49:34,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 1164 [2023-08-31 21:49:34,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:49:37,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][43], [516#L104-3true, 609#(= |#race~M~0| 0), 611#true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:37,404 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-31 21:49:37,404 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-31 21:49:37,404 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 21:49:37,404 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-31 21:49:37,507 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][43], [609#(= |#race~M~0| 0), 611#true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 21#$Ultimate##0true, 595#true, 600#(= |#race~N~0| 0), 163#L104-4true, Black: 602#true]) [2023-08-31 21:49:37,507 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-31 21:49:37,507 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-31 21:49:37,507 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 21:49:37,507 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-31 21:49:37,507 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][58], [609#(= |#race~M~0| 0), 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 21#$Ultimate##0true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:37,507 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-31 21:49:37,507 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 21:49:37,507 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-31 21:49:37,507 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-31 21:49:37,740 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][43], [609#(= |#race~M~0| 0), 193#L72-8true, 611#true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), 163#L104-4true, Black: 602#true]) [2023-08-31 21:49:37,740 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-31 21:49:37,740 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:37,741 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-31 21:49:37,741 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 21:49:37,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][58], [609#(= |#race~M~0| 0), 193#L72-8true, 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:37,741 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-31 21:49:37,741 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:37,741 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 21:49:37,741 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-31 21:49:37,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][71], [614#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 609#(= |#race~M~0| 0), 283#L105-3true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 21#$Ultimate##0true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:37,742 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-31 21:49:37,742 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 21:49:37,742 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:37,742 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:37,742 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][84], [609#(= |#race~M~0| 0), 615#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 21#$Ultimate##0true, 595#true, 600#(= |#race~N~0| 0), 202#L105-4true, Black: 602#true]) [2023-08-31 21:49:37,742 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-31 21:49:37,742 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:37,742 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 21:49:37,742 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:37,830 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][96], [609#(= |#race~M~0| 0), 35#L62-1true, 243#L105-5true, 3#L51-1true, 616#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 604#(= |#race~A~0| 0), 21#$Ultimate##0true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:37,830 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:49:37,830 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:49:37,830 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:37,830 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:38,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][96], [609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 616#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 21#$Ultimate##0true, 296#L105-6true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:38,113 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,113 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,113 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:49:38,113 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,142 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][71], [614#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 609#(= |#race~M~0| 0), 193#L72-8true, 283#L105-3true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:38,142 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:49:38,142 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:38,142 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][84], [609#(= |#race~M~0| 0), 193#L72-8true, 615#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 202#L105-4true]) [2023-08-31 21:49:38,143 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][43], [130#thread3EXITtrue, 609#(= |#race~M~0| 0), 611#true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), 163#L104-4true, Black: 602#true]) [2023-08-31 21:49:38,143 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][58], [130#thread3EXITtrue, 609#(= |#race~M~0| 0), 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:38,143 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:49:38,143 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][43], [609#(= |#race~M~0| 0), 611#true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), 163#L104-4true, Black: 602#true, 293#L73true]) [2023-08-31 21:49:38,144 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:49:38,144 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:38,144 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:49:38,144 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:38,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][58], [609#(= |#race~M~0| 0), 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 293#L73true]) [2023-08-31 21:49:38,144 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,144 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,145 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:38,145 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:49:38,215 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][96], [609#(= |#race~M~0| 0), 193#L72-8true, 35#L62-1true, 3#L51-1true, 243#L105-5true, 604#(= |#race~A~0| 0), 616#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:38,216 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-31 21:49:38,216 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:49:38,216 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:49:38,216 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:38,324 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][96], [609#(= |#race~M~0| 0), 193#L72-8true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 616#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 296#L105-6true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:38,324 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:49:38,324 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,324 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:38,324 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:49:38,354 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][71], [130#thread3EXITtrue, 614#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 609#(= |#race~M~0| 0), 283#L105-3true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:38,354 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-31 21:49:38,354 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:49:38,354 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:49:38,354 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][84], [130#thread3EXITtrue, 609#(= |#race~M~0| 0), 615#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 202#L105-4true]) [2023-08-31 21:49:38,355 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][71], [614#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 609#(= |#race~M~0| 0), 283#L105-3true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 293#L73true]) [2023-08-31 21:49:38,355 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][84], [609#(= |#race~M~0| 0), 615#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 202#L105-4true, 293#L73true]) [2023-08-31 21:49:38,355 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:49:38,355 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:38,419 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][96], [130#thread3EXITtrue, 609#(= |#race~M~0| 0), 35#L62-1true, 243#L105-5true, 3#L51-1true, 604#(= |#race~A~0| 0), 616#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:38,419 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-31 21:49:38,419 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:49:38,419 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:49:38,420 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-31 21:49:38,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][96], [609#(= |#race~M~0| 0), 35#L62-1true, 243#L105-5true, 3#L51-1true, 604#(= |#race~A~0| 0), 616#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 293#L73true]) [2023-08-31 21:49:38,422 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-31 21:49:38,422 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-31 21:49:38,422 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:49:38,422 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:49:38,532 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][96], [130#thread3EXITtrue, 609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 616#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 296#L105-6true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true]) [2023-08-31 21:49:38,532 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-31 21:49:38,532 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:38,532 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:49:38,532 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-31 21:49:38,534 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][96], [609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 616#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 296#L105-6true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 293#L73true]) [2023-08-31 21:49:38,534 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-31 21:49:38,534 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:49:38,534 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:38,534 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-31 21:49:40,883 INFO L130 PetriNetUnfolder]: 39245/63637 cut-off events. [2023-08-31 21:49:40,883 INFO L131 PetriNetUnfolder]: For 2389/2389 co-relation queries the response was YES. [2023-08-31 21:49:41,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116765 conditions, 63637 events. 39245/63637 cut-off events. For 2389/2389 co-relation queries the response was YES. Maximal size of possible extension queue 2337. Compared 577612 event pairs, 4823 based on Foata normal form. 0/49075 useless extension candidates. Maximal degree in co-relation 116760. Up to 18060 conditions per place. [2023-08-31 21:49:41,377 INFO L137 encePairwiseOnDemand]: 1159/1164 looper letters, 219 selfloop transitions, 4 changer transitions 0/346 dead transitions. [2023-08-31 21:49:41,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 346 transitions, 1181 flow [2023-08-31 21:49:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 21:49:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 21:49:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3441 transitions. [2023-08-31 21:49:41,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49269759450171824 [2023-08-31 21:49:41,386 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3441 transitions. [2023-08-31 21:49:41,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3441 transitions. [2023-08-31 21:49:41,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:49:41,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3441 transitions. [2023-08-31 21:49:41,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 573.5) internal successors, (3441), 6 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:41,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1164.0) internal successors, (8148), 7 states have internal predecessors, (8148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:41,407 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1164.0) internal successors, (8148), 7 states have internal predecessors, (8148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:41,407 INFO L175 Difference]: Start difference. First operand has 182 places, 187 transitions, 397 flow. Second operand 6 states and 3441 transitions. [2023-08-31 21:49:41,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 346 transitions, 1181 flow [2023-08-31 21:49:41,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 346 transitions, 1180 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 21:49:41,413 INFO L231 Difference]: Finished difference. Result has 185 places, 186 transitions, 402 flow [2023-08-31 21:49:41,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=402, PETRI_PLACES=185, PETRI_TRANSITIONS=186} [2023-08-31 21:49:41,415 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -57 predicate places. [2023-08-31 21:49:41,416 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 186 transitions, 402 flow [2023-08-31 21:49:41,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 539.3333333333334) internal successors, (3236), 6 states have internal predecessors, (3236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:41,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:49:41,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:49:41,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 21:49:41,418 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:49:41,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:49:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1364000831, now seen corresponding path program 1 times [2023-08-31 21:49:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:49:41,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207168054] [2023-08-31 21:49:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:49:41,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:49:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:49:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 21:49:41,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:49:41,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207168054] [2023-08-31 21:49:41,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207168054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:49:41,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:49:41,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 21:49:41,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483996334] [2023-08-31 21:49:41,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:49:41,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 21:49:41,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:49:41,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 21:49:41,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 21:49:41,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 1164 [2023-08-31 21:49:41,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 186 transitions, 402 flow. Second operand has 4 states, 4 states have (on average 549.5) internal successors, (2198), 4 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:41,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:49:41,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 1164 [2023-08-31 21:49:41,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:49:42,781 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [516#L104-3true, 609#(= |#race~M~0| 0), 611#true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 618#true]) [2023-08-31 21:49:42,781 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-31 21:49:42,781 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-31 21:49:42,781 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-31 21:49:42,781 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 21:49:42,845 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [609#(= |#race~M~0| 0), 611#true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 21#$Ultimate##0true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 163#L104-4true, 618#true]) [2023-08-31 21:49:42,845 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-31 21:49:42,845 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 21:49:42,845 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:42,845 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:42,910 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [609#(= |#race~M~0| 0), 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 21#$Ultimate##0true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 618#true]) [2023-08-31 21:49:42,910 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-31 21:49:42,910 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 21:49:42,910 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:42,910 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:42,968 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [609#(= |#race~M~0| 0), 611#true, 193#L72-8true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 163#L104-4true, 618#true]) [2023-08-31 21:49:42,968 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:49:42,968 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:49:42,968 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:42,968 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:42,969 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [609#(= |#race~M~0| 0), 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 604#(= |#race~A~0| 0), 103#L73-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 618#true, 94#$Ultimate##0true]) [2023-08-31 21:49:42,969 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:49:42,969 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:42,969 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:42,969 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:49:43,015 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [609#(= |#race~M~0| 0), 193#L72-8true, 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 618#true]) [2023-08-31 21:49:43,016 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 21:49:43,016 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:49:43,016 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:43,016 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:43,260 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [130#thread3EXITtrue, 609#(= |#race~M~0| 0), 611#true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 163#L104-4true, 618#true]) [2023-08-31 21:49:43,261 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-31 21:49:43,261 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:49:43,261 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:49:43,261 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:43,261 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [609#(= |#race~M~0| 0), 611#true, 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), 293#L73true, Black: 602#true, 163#L104-4true, 618#true]) [2023-08-31 21:49:43,261 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-31 21:49:43,261 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:49:43,261 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:49:43,261 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:43,333 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [147#thread2EXITtrue, 609#(= |#race~M~0| 0), 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 604#(= |#race~A~0| 0), 103#L73-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 618#true]) [2023-08-31 21:49:43,333 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:49:43,333 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:49:43,333 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:43,333 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:43,333 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [130#thread3EXITtrue, 609#(= |#race~M~0| 0), 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 618#true]) [2023-08-31 21:49:43,334 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:49:43,334 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:43,334 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:43,334 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:49:43,334 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [609#(= |#race~M~0| 0), 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 103#L73-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 618#true]) [2023-08-31 21:49:43,334 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-31 21:49:43,334 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:49:43,334 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-31 21:49:43,334 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:49:43,334 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [609#(= |#race~M~0| 0), 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 293#L73true, Black: 602#true, 618#true]) [2023-08-31 21:49:43,334 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:49:43,334 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:43,334 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:43,335 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:49:43,335 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][47], [609#(= |#race~M~0| 0), 613#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 604#(= |#race~A~0| 0), 103#L73-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 184#L62true, Black: 602#true, 618#true]) [2023-08-31 21:49:43,335 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:49:43,335 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:43,335 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:43,335 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:49:44,509 INFO L130 PetriNetUnfolder]: 12849/29723 cut-off events. [2023-08-31 21:49:44,509 INFO L131 PetriNetUnfolder]: For 2740/2740 co-relation queries the response was YES. [2023-08-31 21:49:44,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50039 conditions, 29723 events. 12849/29723 cut-off events. For 2740/2740 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 326307 event pairs, 8132 based on Foata normal form. 0/23389 useless extension candidates. Maximal degree in co-relation 50034. Up to 16969 conditions per place. [2023-08-31 21:49:44,698 INFO L137 encePairwiseOnDemand]: 1156/1164 looper letters, 57 selfloop transitions, 4 changer transitions 12/200 dead transitions. [2023-08-31 21:49:44,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 200 transitions, 576 flow [2023-08-31 21:49:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 21:49:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 21:49:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2814 transitions. [2023-08-31 21:49:44,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48350515463917526 [2023-08-31 21:49:44,706 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2814 transitions. [2023-08-31 21:49:44,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2814 transitions. [2023-08-31 21:49:44,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:49:44,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2814 transitions. [2023-08-31 21:49:44,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 562.8) internal successors, (2814), 5 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:44,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1164.0) internal successors, (6984), 6 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:44,720 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1164.0) internal successors, (6984), 6 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:44,720 INFO L175 Difference]: Start difference. First operand has 185 places, 186 transitions, 402 flow. Second operand 5 states and 2814 transitions. [2023-08-31 21:49:44,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 200 transitions, 576 flow [2023-08-31 21:49:44,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 200 transitions, 569 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 21:49:44,742 INFO L231 Difference]: Finished difference. Result has 188 places, 188 transitions, 427 flow [2023-08-31 21:49:44,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=188, PETRI_TRANSITIONS=188} [2023-08-31 21:49:44,745 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -54 predicate places. [2023-08-31 21:49:44,745 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 188 transitions, 427 flow [2023-08-31 21:49:44,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 549.5) internal successors, (2198), 4 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:44,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:49:44,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:49:44,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 21:49:44,746 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:49:44,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:49:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1533179764, now seen corresponding path program 1 times [2023-08-31 21:49:44,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:49:44,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834526026] [2023-08-31 21:49:44,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:49:44,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:49:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:49:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 21:49:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:49:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834526026] [2023-08-31 21:49:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834526026] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:49:45,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:49:45,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 21:49:45,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518863404] [2023-08-31 21:49:45,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:49:45,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 21:49:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:49:45,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 21:49:45,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 21:49:45,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-31 21:49:45,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 188 transitions, 427 flow. Second operand has 6 states, 6 states have (on average 532.3333333333334) internal successors, (3194), 6 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:45,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:49:45,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-31 21:49:45,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:49:50,858 INFO L130 PetriNetUnfolder]: 22177/44087 cut-off events. [2023-08-31 21:49:50,858 INFO L131 PetriNetUnfolder]: For 633/633 co-relation queries the response was YES. [2023-08-31 21:49:50,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74736 conditions, 44087 events. 22177/44087 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 459021 event pairs, 3331 based on Foata normal form. 0/36217 useless extension candidates. Maximal degree in co-relation 74728. Up to 18156 conditions per place. [2023-08-31 21:49:51,119 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 198 selfloop transitions, 5 changer transitions 0/318 dead transitions. [2023-08-31 21:49:51,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 318 transitions, 1101 flow [2023-08-31 21:49:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 21:49:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 21:49:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3382 transitions. [2023-08-31 21:49:51,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48424971363115693 [2023-08-31 21:49:51,128 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3382 transitions. [2023-08-31 21:49:51,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3382 transitions. [2023-08-31 21:49:51,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:49:51,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3382 transitions. [2023-08-31 21:49:51,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 563.6666666666666) internal successors, (3382), 6 states have internal predecessors, (3382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:51,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1164.0) internal successors, (8148), 7 states have internal predecessors, (8148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:51,144 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1164.0) internal successors, (8148), 7 states have internal predecessors, (8148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:51,144 INFO L175 Difference]: Start difference. First operand has 188 places, 188 transitions, 427 flow. Second operand 6 states and 3382 transitions. [2023-08-31 21:49:51,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 318 transitions, 1101 flow [2023-08-31 21:49:51,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 318 transitions, 1087 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-31 21:49:51,149 INFO L231 Difference]: Finished difference. Result has 186 places, 186 transitions, 419 flow [2023-08-31 21:49:51,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=419, PETRI_PLACES=186, PETRI_TRANSITIONS=186} [2023-08-31 21:49:51,150 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -56 predicate places. [2023-08-31 21:49:51,151 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 186 transitions, 419 flow [2023-08-31 21:49:51,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.3333333333334) internal successors, (3194), 6 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:51,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:49:51,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:49:51,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 21:49:51,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:49:51,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:49:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash 212661638, now seen corresponding path program 1 times [2023-08-31 21:49:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:49:51,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114661981] [2023-08-31 21:49:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:49:51,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:49:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:49:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 21:49:51,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:49:51,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114661981] [2023-08-31 21:49:51,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114661981] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:49:51,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:49:51,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 21:49:51,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883424917] [2023-08-31 21:49:51,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:49:51,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 21:49:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:49:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 21:49:51,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 21:49:51,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-31 21:49:51,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 186 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:51,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:49:51,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-31 21:49:51,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:49:52,148 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [516#L104-3true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 628#true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 635#true]) [2023-08-31 21:49:52,148 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-31 21:49:52,148 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 21:49:52,148 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-31 21:49:52,148 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-31 21:49:52,211 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 21#$Ultimate##0true, 604#(= |#race~A~0| 0), 628#true, 595#true, 600#(= |#race~N~0| 0), 163#L104-4true, Black: 602#true, 635#true]) [2023-08-31 21:49:52,212 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-31 21:49:52,212 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 21:49:52,212 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:52,212 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:52,269 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 3#L51-1true, 35#L62-1true, 21#$Ultimate##0true, 604#(= |#race~A~0| 0), 628#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 635#true]) [2023-08-31 21:49:52,270 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-31 21:49:52,270 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:52,270 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:52,270 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 21:49:52,320 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 193#L72-8true, 3#L51-1true, 35#L62-1true, 604#(= |#race~A~0| 0), 628#true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 635#true, 163#L104-4true]) [2023-08-31 21:49:52,320 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:49:52,321 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:49:52,321 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:52,321 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:52,321 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 3#L51-1true, 628#true, 604#(= |#race~A~0| 0), 103#L73-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 635#true, 94#$Ultimate##0true]) [2023-08-31 21:49:52,321 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:49:52,321 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:49:52,321 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:49:52,321 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:52,397 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 193#L72-8true, 35#L62-1true, 3#L51-1true, 628#true, 604#(= |#race~A~0| 0), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 635#true]) [2023-08-31 21:49:52,397 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 21:49:52,397 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:49:52,397 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:49:52,397 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:52,487 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [130#thread3EXITtrue, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 628#true, 595#true, 600#(= |#race~N~0| 0), 163#L104-4true, Black: 602#true, 635#true]) [2023-08-31 21:49:52,487 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-31 21:49:52,487 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:49:52,487 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:52,487 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:49:52,488 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 628#true, 604#(= |#race~A~0| 0), 595#true, 600#(= |#race~N~0| 0), 293#L73true, 163#L104-4true, Black: 602#true, 635#true]) [2023-08-31 21:49:52,488 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-31 21:49:52,488 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:49:52,488 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:49:52,488 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:49:52,538 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 147#thread2EXITtrue, 609#(= |#race~M~0| 0), 3#L51-1true, 628#true, 604#(= |#race~A~0| 0), 103#L73-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 635#true]) [2023-08-31 21:49:52,538 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:49:52,538 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:52,538 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:52,538 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:49:52,538 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [130#thread3EXITtrue, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 3#L51-1true, 35#L62-1true, 604#(= |#race~A~0| 0), 628#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 635#true]) [2023-08-31 21:49:52,538 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:49:52,538 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:49:52,538 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:52,538 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:52,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 3#L51-1true, 35#L62-1true, 604#(= |#race~A~0| 0), 628#true, 103#L73-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 602#true, 635#true]) [2023-08-31 21:49:52,539 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-31 21:49:52,539 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:49:52,539 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-31 21:49:52,539 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:49:52,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 3#L51-1true, 604#(= |#race~A~0| 0), 628#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 293#L73true, Black: 602#true, 635#true]) [2023-08-31 21:49:52,539 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:49:52,540 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:52,540 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:49:52,540 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:52,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][36], [Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 3#L51-1true, 604#(= |#race~A~0| 0), 628#true, 103#L73-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 184#L62true, Black: 602#true, 635#true]) [2023-08-31 21:49:52,540 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:49:52,540 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:49:52,540 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:49:52,540 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:49:54,743 INFO L130 PetriNetUnfolder]: 17136/41497 cut-off events. [2023-08-31 21:49:54,743 INFO L131 PetriNetUnfolder]: For 1030/1040 co-relation queries the response was YES. [2023-08-31 21:49:54,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66397 conditions, 41497 events. 17136/41497 cut-off events. For 1030/1040 co-relation queries the response was YES. Maximal size of possible extension queue 1236. Compared 477620 event pairs, 8141 based on Foata normal form. 0/33560 useless extension candidates. Maximal degree in co-relation 66391. Up to 16574 conditions per place. [2023-08-31 21:49:55,029 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 95 selfloop transitions, 3 changer transitions 0/223 dead transitions. [2023-08-31 21:49:55,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 223 transitions, 693 flow [2023-08-31 21:49:55,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 21:49:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 21:49:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1767 transitions. [2023-08-31 21:49:55,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060137457044673 [2023-08-31 21:49:55,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1767 transitions. [2023-08-31 21:49:55,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1767 transitions. [2023-08-31 21:49:55,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:49:55,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1767 transitions. [2023-08-31 21:49:55,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:55,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:55,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:55,042 INFO L175 Difference]: Start difference. First operand has 186 places, 186 transitions, 419 flow. Second operand 3 states and 1767 transitions. [2023-08-31 21:49:55,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 223 transitions, 693 flow [2023-08-31 21:49:55,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 223 transitions, 681 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 21:49:55,293 INFO L231 Difference]: Finished difference. Result has 185 places, 188 transitions, 431 flow [2023-08-31 21:49:55,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=185, PETRI_TRANSITIONS=188} [2023-08-31 21:49:55,294 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -57 predicate places. [2023-08-31 21:49:55,294 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 188 transitions, 431 flow [2023-08-31 21:49:55,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:55,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:49:55,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:49:55,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 21:49:55,295 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:49:55,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:49:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1946483524, now seen corresponding path program 1 times [2023-08-31 21:49:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:49:55,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714596589] [2023-08-31 21:49:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:49:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:49:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:49:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 21:49:55,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:49:55,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714596589] [2023-08-31 21:49:55,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714596589] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 21:49:55,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897196441] [2023-08-31 21:49:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:49:55,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 21:49:55,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 21:49:55,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 21:49:55,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-31 21:49:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:49:55,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 21:49:55,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 21:49:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 21:49:55,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 21:49:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 21:49:55,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897196441] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 21:49:55,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 21:49:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-31 21:49:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741118699] [2023-08-31 21:49:55,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 21:49:55,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-31 21:49:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:49:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-31 21:49:55,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-08-31 21:49:56,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 1164 [2023-08-31 21:49:56,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 188 transitions, 431 flow. Second operand has 13 states, 13 states have (on average 537.6153846153846) internal successors, (6989), 13 states have internal predecessors, (6989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:49:56,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:49:56,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 1164 [2023-08-31 21:49:56,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:50:00,484 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 21#$Ultimate##0true, 604#(= |#race~A~0| 0), 641#true, 635#true, Black: 602#true, 163#L104-4true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:00,484 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:50:00,484 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:50:00,484 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:00,484 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:00,569 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][109], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 94#$Ultimate##0true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 775#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, 635#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:00,569 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 21:50:00,569 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:50:00,569 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:00,569 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:50:00,570 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][110], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 581#L61-6true, 604#(= |#race~A~0| 0), 103#L73-1true, 635#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:00,570 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 21:50:00,570 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:00,570 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:00,570 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:00,580 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 21#$Ultimate##0true, 604#(= |#race~A~0| 0), 641#true, 635#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:00,580 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 21:50:00,580 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:00,580 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:00,580 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:00,647 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][114], [3#L51-1true, 777#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~N~0 1) (<= ~M~0 0)), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 94#$Ultimate##0true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, 635#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:00,647 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 21:50:00,647 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:00,647 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:00,647 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:00,664 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][110], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 147#thread2EXITtrue, 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, 635#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:00,664 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:50:00,664 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:00,664 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:00,664 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:00,672 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [193#L72-8true, 3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, 163#L104-4true, 635#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:00,672 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-31 21:50:00,672 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:00,672 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:00,673 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:00,673 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 94#$Ultimate##0true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, 641#true, 635#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:00,673 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-31 21:50:00,673 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:00,674 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:00,674 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:00,757 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [193#L72-8true, 3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, 635#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:00,757 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:50:00,757 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:00,758 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:00,758 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:00,758 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 581#L61-6true, 604#(= |#race~A~0| 0), 103#L73-1true, 641#true, Black: 602#true, 635#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:00,758 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-31 21:50:00,758 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:00,758 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:00,758 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:01,019 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [130#thread3EXITtrue, 3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, 163#L104-4true, 635#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:01,019 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-31 21:50:01,019 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-31 21:50:01,019 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:01,019 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:01,019 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, 163#L104-4true, 293#L73true, Black: 602#true, 635#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:01,019 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-31 21:50:01,019 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-31 21:50:01,019 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:01,020 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:01,107 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][148], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 735#(<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|), 147#thread2EXITtrue, 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, 635#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:01,108 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-31 21:50:01,108 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:01,108 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:01,108 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-31 21:50:01,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [130#thread3EXITtrue, 3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, 635#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:01,108 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-31 21:50:01,108 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:01,108 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-31 21:50:01,108 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:01,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 103#L73-1true, 641#true, 635#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:01,108 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-31 21:50:01,109 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-31 21:50:01,109 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 21:50:01,109 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-31 21:50:01,109 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, 635#true, 293#L73true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:01,109 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-31 21:50:01,109 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:01,109 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:01,109 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-31 21:50:01,109 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][95], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, 184#L62true, 641#true, 635#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:01,109 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-31 21:50:01,109 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:01,110 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-31 21:50:01,110 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:03,793 INFO L130 PetriNetUnfolder]: 24341/60206 cut-off events. [2023-08-31 21:50:03,793 INFO L131 PetriNetUnfolder]: For 7276/7394 co-relation queries the response was YES. [2023-08-31 21:50:03,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100765 conditions, 60206 events. 24341/60206 cut-off events. For 7276/7394 co-relation queries the response was YES. Maximal size of possible extension queue 1787. Compared 741124 event pairs, 12742 based on Foata normal form. 16/51213 useless extension candidates. Maximal degree in co-relation 100758. Up to 20269 conditions per place. [2023-08-31 21:50:04,142 INFO L137 encePairwiseOnDemand]: 1154/1164 looper letters, 257 selfloop transitions, 16 changer transitions 0/397 dead transitions. [2023-08-31 21:50:04,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 397 transitions, 1546 flow [2023-08-31 21:50:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 21:50:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 21:50:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6689 transitions. [2023-08-31 21:50:04,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4788802978235968 [2023-08-31 21:50:04,154 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 6689 transitions. [2023-08-31 21:50:04,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 6689 transitions. [2023-08-31 21:50:04,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:50:04,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 6689 transitions. [2023-08-31 21:50:04,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 557.4166666666666) internal successors, (6689), 12 states have internal predecessors, (6689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:04,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 1164.0) internal successors, (15132), 13 states have internal predecessors, (15132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:04,191 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 1164.0) internal successors, (15132), 13 states have internal predecessors, (15132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:04,192 INFO L175 Difference]: Start difference. First operand has 185 places, 188 transitions, 431 flow. Second operand 12 states and 6689 transitions. [2023-08-31 21:50:04,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 397 transitions, 1546 flow [2023-08-31 21:50:04,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 397 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 21:50:04,332 INFO L231 Difference]: Finished difference. Result has 199 places, 200 transitions, 533 flow [2023-08-31 21:50:04,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=533, PETRI_PLACES=199, PETRI_TRANSITIONS=200} [2023-08-31 21:50:04,333 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -43 predicate places. [2023-08-31 21:50:04,333 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 200 transitions, 533 flow [2023-08-31 21:50:04,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 537.6153846153846) internal successors, (6989), 13 states have internal predecessors, (6989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:04,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:50:04,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:50:04,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-31 21:50:04,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 21:50:04,535 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:50:04,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:50:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1997496372, now seen corresponding path program 1 times [2023-08-31 21:50:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:50:04,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881484047] [2023-08-31 21:50:04,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:50:04,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:50:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:50:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 21:50:04,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:50:04,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881484047] [2023-08-31 21:50:04,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881484047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:50:04,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:50:04,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 21:50:04,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036320716] [2023-08-31 21:50:04,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:50:04,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 21:50:04,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:50:04,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 21:50:04,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 21:50:04,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-31 21:50:04,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 200 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 560.6666666666666) internal successors, (1682), 3 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:04,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:50:04,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-31 21:50:04,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:50:07,296 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 788#true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 516#L104-3true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,296 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-31 21:50:07,296 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 21:50:07,296 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:07,296 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-31 21:50:07,381 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, 788#true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 775#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,382 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-31 21:50:07,382 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:50:07,382 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:50:07,382 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-31 21:50:07,390 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 21#$Ultimate##0true, 641#true, 163#L104-4true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,390 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-31 21:50:07,390 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-31 21:50:07,390 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:07,390 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:50:07,467 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 777#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~N~0 1) (<= ~M~0 0)), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 94#$Ultimate##0true, Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 788#true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,467 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-31 21:50:07,467 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-31 21:50:07,467 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:07,467 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:07,479 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 21#$Ultimate##0true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,480 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-31 21:50:07,480 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-31 21:50:07,480 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:07,480 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:07,550 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [193#L72-8true, 3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, 163#L104-4true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,551 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 21:50:07,551 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:07,551 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 21:50:07,551 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:07,551 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,551 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 21:50:07,551 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:07,552 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 21:50:07,552 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:07,623 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, 147#thread2EXITtrue, 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,623 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-31 21:50:07,623 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:07,623 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-31 21:50:07,624 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:07,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [193#L72-8true, 3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,630 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-31 21:50:07,631 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-31 21:50:07,631 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:07,631 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:07,671 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 788#true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 147#thread2EXITtrue, 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,672 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:07,672 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:07,672 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:07,672 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:07,684 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [130#thread3EXITtrue, 3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, 163#L104-4true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,685 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:07,685 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:07,685 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:07,685 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:07,685 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, 163#L104-4true, 293#L73true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,685 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:07,685 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:07,685 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:07,685 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:07,900 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 735#(<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 147#thread2EXITtrue, 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,901 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:07,901 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:07,901 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:07,901 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:07,901 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [130#thread3EXITtrue, 3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,901 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:07,901 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:07,901 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:07,901 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 103#L73-1true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,902 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 788#true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, 293#L73true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,902 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 788#true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 604#(= |#race~A~0| 0), 103#L73-1true, 184#L62true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:07,902 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:07,902 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:08,834 INFO L130 PetriNetUnfolder]: 18668/47019 cut-off events. [2023-08-31 21:50:08,835 INFO L131 PetriNetUnfolder]: For 8219/9505 co-relation queries the response was YES. [2023-08-31 21:50:09,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81478 conditions, 47019 events. 18668/47019 cut-off events. For 8219/9505 co-relation queries the response was YES. Maximal size of possible extension queue 1303. Compared 559982 event pairs, 11844 based on Foata normal form. 1368/41387 useless extension candidates. Maximal degree in co-relation 81467. Up to 23083 conditions per place. [2023-08-31 21:50:09,132 INFO L137 encePairwiseOnDemand]: 1162/1164 looper letters, 104 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2023-08-31 21:50:09,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 233 transitions, 820 flow [2023-08-31 21:50:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 21:50:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 21:50:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2023-08-31 21:50:09,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048682703321878 [2023-08-31 21:50:09,137 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2023-08-31 21:50:09,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2023-08-31 21:50:09,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:50:09,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2023-08-31 21:50:09,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:09,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:09,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:09,145 INFO L175 Difference]: Start difference. First operand has 199 places, 200 transitions, 533 flow. Second operand 3 states and 1763 transitions. [2023-08-31 21:50:09,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 233 transitions, 820 flow [2023-08-31 21:50:09,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 233 transitions, 804 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-31 21:50:09,166 INFO L231 Difference]: Finished difference. Result has 201 places, 199 transitions, 521 flow [2023-08-31 21:50:09,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=201, PETRI_TRANSITIONS=199} [2023-08-31 21:50:09,167 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -41 predicate places. [2023-08-31 21:50:09,167 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 199 transitions, 521 flow [2023-08-31 21:50:09,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 560.6666666666666) internal successors, (1682), 3 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:09,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:50:09,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:50:09,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 21:50:09,169 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:50:09,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:50:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash -522161326, now seen corresponding path program 1 times [2023-08-31 21:50:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:50:09,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881744123] [2023-08-31 21:50:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:50:09,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:50:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:50:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 21:50:09,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:50:09,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881744123] [2023-08-31 21:50:09,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881744123] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:50:09,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:50:09,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 21:50:09,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383496004] [2023-08-31 21:50:09,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:50:09,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 21:50:09,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:50:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 21:50:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 21:50:10,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-31 21:50:10,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 199 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 533.1666666666666) internal successors, (3199), 6 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:10,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:50:10,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-31 21:50:10,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:50:14,023 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 516#L104-3true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,024 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-31 21:50:14,024 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 21:50:14,024 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:14,024 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-31 21:50:14,092 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, 788#true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, 775#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,092 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-31 21:50:14,092 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:50:14,092 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:50:14,092 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-31 21:50:14,265 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 21#$Ultimate##0true, 604#(= |#race~A~0| 0), 641#true, 163#L104-4true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,266 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-31 21:50:14,266 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:14,266 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-31 21:50:14,266 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:50:14,327 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 777#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~N~0 1) (<= ~M~0 0)), 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, 788#true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,327 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-31 21:50:14,327 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-31 21:50:14,327 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:14,327 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:14,405 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 21#$Ultimate##0true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,405 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-31 21:50:14,405 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:14,405 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:14,405 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-31 21:50:14,475 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [193#L72-8true, 3#L51-1true, 793#true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, 163#L104-4true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,476 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 21:50:14,476 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:14,476 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:14,476 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 21:50:14,476 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,476 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 21:50:14,476 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:14,476 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 21:50:14,476 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:14,534 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 788#true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, 147#thread2EXITtrue, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,534 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-31 21:50:14,534 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:14,534 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-31 21:50:14,534 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:14,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [193#L72-8true, 3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,541 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-31 21:50:14,541 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-31 21:50:14,541 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:14,541 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:14,715 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 788#true, 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, 147#thread2EXITtrue, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,715 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:14,715 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:14,715 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:14,715 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:14,727 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 641#true, 163#L104-4true, Black: 602#true, 293#L73true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,727 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:14,727 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:14,727 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:14,727 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:14,728 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [130#thread3EXITtrue, 3#L51-1true, 793#true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, 163#L104-4true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,728 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:14,728 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:14,728 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:14,728 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:14,783 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 788#true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 735#(<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 147#thread2EXITtrue, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,783 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:14,783 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:14,783 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:14,784 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:14,784 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, 293#L73true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,784 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:14,784 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:14,784 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:14,784 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:14,784 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 788#true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,784 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-31 21:50:14,784 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-31 21:50:14,784 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-31 21:50:14,784 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 21:50:14,784 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 184#L62true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,784 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:14,785 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:14,785 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:14,785 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:14,785 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [130#thread3EXITtrue, 3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 788#true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:14,785 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:14,785 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:14,785 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:14,785 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:15,798 INFO L130 PetriNetUnfolder]: 27215/53188 cut-off events. [2023-08-31 21:50:15,798 INFO L131 PetriNetUnfolder]: For 20693/22605 co-relation queries the response was YES. [2023-08-31 21:50:15,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104518 conditions, 53188 events. 27215/53188 cut-off events. For 20693/22605 co-relation queries the response was YES. Maximal size of possible extension queue 1625. Compared 552637 event pairs, 4859 based on Foata normal form. 1276/48098 useless extension candidates. Maximal degree in co-relation 104505. Up to 22752 conditions per place. [2023-08-31 21:50:16,140 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 191 selfloop transitions, 5 changer transitions 0/313 dead transitions. [2023-08-31 21:50:16,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 313 transitions, 1257 flow [2023-08-31 21:50:16,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 21:50:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 21:50:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3356 transitions. [2023-08-31 21:50:16,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805269186712486 [2023-08-31 21:50:16,146 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3356 transitions. [2023-08-31 21:50:16,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3356 transitions. [2023-08-31 21:50:16,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:50:16,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3356 transitions. [2023-08-31 21:50:16,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 559.3333333333334) internal successors, (3356), 6 states have internal predecessors, (3356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:16,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1164.0) internal successors, (8148), 7 states have internal predecessors, (8148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:16,158 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1164.0) internal successors, (8148), 7 states have internal predecessors, (8148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:16,158 INFO L175 Difference]: Start difference. First operand has 201 places, 199 transitions, 521 flow. Second operand 6 states and 3356 transitions. [2023-08-31 21:50:16,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 313 transitions, 1257 flow [2023-08-31 21:50:16,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 313 transitions, 1247 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 21:50:16,269 INFO L231 Difference]: Finished difference. Result has 203 places, 197 transitions, 525 flow [2023-08-31 21:50:16,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=525, PETRI_PLACES=203, PETRI_TRANSITIONS=197} [2023-08-31 21:50:16,270 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -39 predicate places. [2023-08-31 21:50:16,271 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 197 transitions, 525 flow [2023-08-31 21:50:16,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 533.1666666666666) internal successors, (3199), 6 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:16,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:50:16,271 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:50:16,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 21:50:16,272 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:50:16,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:50:16,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2133869231, now seen corresponding path program 2 times [2023-08-31 21:50:16,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:50:16,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034421901] [2023-08-31 21:50:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:50:16,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:50:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:50:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-31 21:50:16,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:50:16,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034421901] [2023-08-31 21:50:16,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034421901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:50:16,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:50:16,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 21:50:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644008338] [2023-08-31 21:50:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:50:16,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 21:50:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:50:16,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 21:50:16,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 21:50:17,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-31 21:50:17,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 197 transitions, 525 flow. Second operand has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:17,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:50:17,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-31 21:50:17,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:50:22,210 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, 775#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 800#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:22,210 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-31 21:50:22,210 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:50:22,210 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:50:22,210 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-31 21:50:22,617 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 777#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~N~0 1) (<= ~M~0 0)), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 800#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:22,617 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-31 21:50:22,618 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:22,618 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-31 21:50:22,618 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:22,626 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 581#L61-6true, 604#(= |#race~A~0| 0), 800#true, 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:22,626 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-31 21:50:22,627 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:22,627 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:22,627 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-31 21:50:22,780 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 581#L61-6true, 103#L73-1true, 800#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:22,780 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 21:50:22,781 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:22,781 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:22,781 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 21:50:22,799 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 800#true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:22,799 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 21:50:22,799 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:22,799 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:22,799 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 21:50:22,800 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 581#L61-6true, 103#L73-1true, 800#true, 641#true, Black: 602#true, 163#L104-4true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:22,800 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 21:50:22,800 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 21:50:22,800 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:22,800 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:22,880 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, 147#thread2EXITtrue, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 800#true, 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:22,880 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-31 21:50:22,880 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-31 21:50:22,880 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:22,880 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:22,892 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 581#L61-6true, 103#L73-1true, 800#true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:22,892 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-31 21:50:22,892 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:22,892 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-31 21:50:22,892 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:22,957 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 147#thread2EXITtrue, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 800#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:22,957 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:22,957 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:22,957 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:22,957 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:22,983 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 735#(<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 147#thread2EXITtrue, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 800#true, Black: 602#true, 163#L104-4true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:22,983 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:22,983 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:22,983 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:22,983 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:22,983 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 800#true, 641#true, 184#L62true, 163#L104-4true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:22,983 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:22,983 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:22,984 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:22,984 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:23,063 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 735#(<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|), Black: 641#true, 147#thread2EXITtrue, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 800#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:23,063 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:23,063 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:23,063 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:23,063 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:23,064 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 800#true, 184#L62true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:23,064 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:23,064 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:23,064 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:23,064 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:24,512 INFO L130 PetriNetUnfolder]: 30875/67624 cut-off events. [2023-08-31 21:50:24,512 INFO L131 PetriNetUnfolder]: For 16133/16133 co-relation queries the response was YES. [2023-08-31 21:50:24,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124164 conditions, 67624 events. 30875/67624 cut-off events. For 16133/16133 co-relation queries the response was YES. Maximal size of possible extension queue 1927. Compared 781403 event pairs, 9170 based on Foata normal form. 0/60838 useless extension candidates. Maximal degree in co-relation 124151. Up to 20400 conditions per place. [2023-08-31 21:50:24,999 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 215 selfloop transitions, 5 changer transitions 0/331 dead transitions. [2023-08-31 21:50:24,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 331 transitions, 1313 flow [2023-08-31 21:50:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 21:50:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 21:50:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3382 transitions. [2023-08-31 21:50:25,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48424971363115693 [2023-08-31 21:50:25,006 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3382 transitions. [2023-08-31 21:50:25,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3382 transitions. [2023-08-31 21:50:25,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:50:25,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3382 transitions. [2023-08-31 21:50:25,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 563.6666666666666) internal successors, (3382), 6 states have internal predecessors, (3382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:25,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1164.0) internal successors, (8148), 7 states have internal predecessors, (8148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:25,020 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1164.0) internal successors, (8148), 7 states have internal predecessors, (8148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:25,020 INFO L175 Difference]: Start difference. First operand has 203 places, 197 transitions, 525 flow. Second operand 6 states and 3382 transitions. [2023-08-31 21:50:25,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 331 transitions, 1313 flow [2023-08-31 21:50:25,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 331 transitions, 1295 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 21:50:25,069 INFO L231 Difference]: Finished difference. Result has 201 places, 195 transitions, 521 flow [2023-08-31 21:50:25,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=521, PETRI_PLACES=201, PETRI_TRANSITIONS=195} [2023-08-31 21:50:25,070 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -41 predicate places. [2023-08-31 21:50:25,070 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 195 transitions, 521 flow [2023-08-31 21:50:25,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:25,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:50:25,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:50:25,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 21:50:25,072 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:50:25,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:50:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash 714604569, now seen corresponding path program 1 times [2023-08-31 21:50:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:50:25,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707438981] [2023-08-31 21:50:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:50:25,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:50:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:50:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 21:50:25,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:50:25,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707438981] [2023-08-31 21:50:25,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707438981] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:50:25,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:50:25,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 21:50:25,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254823345] [2023-08-31 21:50:25,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:50:25,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 21:50:25,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:50:25,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 21:50:25,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 21:50:25,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-31 21:50:25,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 195 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 562.3333333333334) internal successors, (1687), 3 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:25,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:50:25,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-31 21:50:25,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:50:28,053 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 516#L104-3true, 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 800#true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,053 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-31 21:50:28,053 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 21:50:28,053 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-31 21:50:28,053 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:28,312 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, 807#true, 775#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 800#true, 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,312 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-31 21:50:28,312 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-31 21:50:28,312 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:50:28,312 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:50:28,322 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 21#$Ultimate##0true, 604#(= |#race~A~0| 0), 800#true, 641#true, 163#L104-4true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,322 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-31 21:50:28,322 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:28,323 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-31 21:50:28,323 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:50:28,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 777#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~N~0 1) (<= ~M~0 0)), 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 800#true, 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,410 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-31 21:50:28,411 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:28,411 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-31 21:50:28,411 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:28,424 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 21#$Ultimate##0true, 604#(= |#race~A~0| 0), 800#true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,424 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-31 21:50:28,424 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:28,424 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:28,425 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-31 21:50:28,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [193#L72-8true, 3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 800#true, 641#true, Black: 602#true, 163#L104-4true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,539 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 21:50:28,539 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:28,539 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:28,539 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 21:50:28,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 800#true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,540 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 21:50:28,540 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:28,540 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:28,540 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 21:50:28,604 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 641#true, 147#thread2EXITtrue, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 800#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,604 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-31 21:50:28,604 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-31 21:50:28,604 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:28,604 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:28,614 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [193#L72-8true, 3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 35#L62-1true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 800#true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,614 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-31 21:50:28,614 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-31 21:50:28,614 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:28,614 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:28,665 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, 807#true, 147#thread2EXITtrue, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 800#true, 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,666 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:28,666 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:28,666 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:28,666 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:28,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 800#true, 641#true, 163#L104-4true, 293#L73true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,681 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:28,681 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:28,681 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:28,681 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:28,682 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [130#thread3EXITtrue, 3#L51-1true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 800#true, 641#true, Black: 602#true, 163#L104-4true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,682 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:28,682 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:28,682 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:28,682 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:28,748 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, 735#(<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 147#thread2EXITtrue, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 800#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,748 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:28,748 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:28,748 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:28,748 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:28,748 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 800#true, 103#L73-1true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,748 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-31 21:50:28,748 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 21:50:28,749 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-31 21:50:28,749 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-31 21:50:28,749 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 800#true, 641#true, Black: 602#true, 293#L73true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,749 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:28,749 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:28,749 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:28,749 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:28,750 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 800#true, 103#L73-1true, 184#L62true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,750 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:28,750 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:28,750 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:28,750 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:28,750 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [130#thread3EXITtrue, 3#L51-1true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 800#true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:28,750 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:28,750 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:28,751 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:28,751 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:30,455 INFO L130 PetriNetUnfolder]: 22940/56634 cut-off events. [2023-08-31 21:50:30,455 INFO L131 PetriNetUnfolder]: For 13840/15438 co-relation queries the response was YES. [2023-08-31 21:50:30,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100708 conditions, 56634 events. 22940/56634 cut-off events. For 13840/15438 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 677404 event pairs, 12899 based on Foata normal form. 1068/50482 useless extension candidates. Maximal degree in co-relation 100695. Up to 25054 conditions per place. [2023-08-31 21:50:30,884 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 102 selfloop transitions, 3 changer transitions 0/228 dead transitions. [2023-08-31 21:50:30,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 228 transitions, 826 flow [2023-08-31 21:50:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 21:50:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 21:50:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2023-08-31 21:50:30,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042955326460481 [2023-08-31 21:50:30,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1761 transitions. [2023-08-31 21:50:30,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1761 transitions. [2023-08-31 21:50:30,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:50:30,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1761 transitions. [2023-08-31 21:50:30,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.0) internal successors, (1761), 3 states have internal predecessors, (1761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:30,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:30,895 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:30,895 INFO L175 Difference]: Start difference. First operand has 201 places, 195 transitions, 521 flow. Second operand 3 states and 1761 transitions. [2023-08-31 21:50:30,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 228 transitions, 826 flow [2023-08-31 21:50:30,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 228 transitions, 814 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 21:50:30,931 INFO L231 Difference]: Finished difference. Result has 200 places, 197 transitions, 533 flow [2023-08-31 21:50:30,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=200, PETRI_TRANSITIONS=197} [2023-08-31 21:50:30,932 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -42 predicate places. [2023-08-31 21:50:30,932 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 197 transitions, 533 flow [2023-08-31 21:50:30,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.3333333333334) internal successors, (1687), 3 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:30,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:50:30,933 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:50:30,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 21:50:30,933 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:50:30,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:50:30,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1949526157, now seen corresponding path program 1 times [2023-08-31 21:50:30,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:50:30,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117937267] [2023-08-31 21:50:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:50:30,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:50:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:50:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-31 21:50:30,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:50:30,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117937267] [2023-08-31 21:50:30,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117937267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:50:30,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:50:30,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 21:50:30,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576297360] [2023-08-31 21:50:30,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:50:30,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 21:50:30,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:50:30,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 21:50:30,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 21:50:30,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-31 21:50:30,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 197 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:30,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:50:30,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-31 21:50:30,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:50:34,199 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 516#L104-3true, Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 813#true, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,200 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-31 21:50:34,200 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 21:50:34,200 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-31 21:50:34,200 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:34,295 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 641#true, 775#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 813#true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,295 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-31 21:50:34,295 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-31 21:50:34,295 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:50:34,295 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-31 21:50:34,302 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 813#true, 609#(= |#race~M~0| 0), 35#L62-1true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 21#$Ultimate##0true, 641#true, Black: 602#true, 163#L104-4true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,302 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-31 21:50:34,302 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:34,302 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-31 21:50:34,302 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 21:50:34,396 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 777#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~N~0 1) (<= ~M~0 0)), 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 813#true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,396 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-31 21:50:34,396 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-31 21:50:34,396 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:34,397 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-31 21:50:34,411 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 813#true, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 21#$Ultimate##0true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,411 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-31 21:50:34,411 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 21:50:34,411 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:34,411 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-31 21:50:34,511 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [193#L72-8true, 3#L51-1true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 813#true, 609#(= |#race~M~0| 0), 35#L62-1true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 641#true, Black: 602#true, 163#L104-4true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,511 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 21:50:34,511 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 21:50:34,511 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:34,511 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:34,511 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), 94#$Ultimate##0true, Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 813#true, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,511 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 21:50:34,511 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-31 21:50:34,511 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 21:50:34,512 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 21:50:34,864 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 641#true, 147#thread2EXITtrue, 609#(= |#race~M~0| 0), 813#true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,864 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-31 21:50:34,864 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-31 21:50:34,864 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:34,864 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:34,874 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [193#L72-8true, 3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 813#true, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 35#L62-1true, 604#(= |#race~A~0| 0), 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,874 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-31 21:50:34,874 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-31 21:50:34,874 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-31 21:50:34,874 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 21:50:34,942 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 147#thread2EXITtrue, 813#true, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,942 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:34,942 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:34,942 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:34,942 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:34,959 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [130#thread3EXITtrue, 3#L51-1true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 813#true, 35#L62-1true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 641#true, 163#L104-4true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,959 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:34,959 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:34,959 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:34,959 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:34,960 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), 813#true, 35#L62-1true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 641#true, 293#L73true, 163#L104-4true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:34,960 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-31 21:50:34,960 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 21:50:34,960 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-31 21:50:34,960 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-31 21:50:35,040 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, 735#(<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|), Black: 641#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 147#thread2EXITtrue, 813#true, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:35,040 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:35,040 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:35,040 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:35,040 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:35,040 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [130#thread3EXITtrue, 3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 813#true, 609#(= |#race~M~0| 0), 35#L62-1true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:35,040 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:35,040 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:35,040 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:35,040 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 813#true, 609#(= |#race~M~0| 0), 35#L62-1true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 641#true, 293#L73true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:35,041 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 813#true, 609#(= |#race~M~0| 0), 35#L62-1true, Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:35,041 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 807#true, Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 813#true, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 103#L73-1true, 184#L62true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-31 21:50:35,041 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-31 21:50:35,041 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-31 21:50:37,961 INFO L130 PetriNetUnfolder]: 27259/72619 cut-off events. [2023-08-31 21:50:37,961 INFO L131 PetriNetUnfolder]: For 19984/21585 co-relation queries the response was YES. [2023-08-31 21:50:38,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127484 conditions, 72619 events. 27259/72619 cut-off events. For 19984/21585 co-relation queries the response was YES. Maximal size of possible extension queue 1701. Compared 925173 event pairs, 16121 based on Foata normal form. 1068/65360 useless extension candidates. Maximal degree in co-relation 127470. Up to 30344 conditions per place. [2023-08-31 21:50:38,459 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 110 selfloop transitions, 3 changer transitions 0/236 dead transitions. [2023-08-31 21:50:38,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 236 transitions, 873 flow [2023-08-31 21:50:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 21:50:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 21:50:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1766 transitions. [2023-08-31 21:50:38,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057273768613975 [2023-08-31 21:50:38,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1766 transitions. [2023-08-31 21:50:38,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1766 transitions. [2023-08-31 21:50:38,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:50:38,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1766 transitions. [2023-08-31 21:50:38,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 588.6666666666666) internal successors, (1766), 3 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:38,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:38,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:38,467 INFO L175 Difference]: Start difference. First operand has 200 places, 197 transitions, 533 flow. Second operand 3 states and 1766 transitions. [2023-08-31 21:50:38,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 236 transitions, 873 flow [2023-08-31 21:50:38,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 236 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 21:50:38,579 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 549 flow [2023-08-31 21:50:38,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=202, PETRI_TRANSITIONS=199} [2023-08-31 21:50:38,579 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -40 predicate places. [2023-08-31 21:50:38,579 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 549 flow [2023-08-31 21:50:38,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:38,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:50:38,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:50:38,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 21:50:38,580 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:50:38,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:50:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash -933145270, now seen corresponding path program 1 times [2023-08-31 21:50:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:50:38,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918022733] [2023-08-31 21:50:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:50:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:50:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:50:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 21:50:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:50:38,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918022733] [2023-08-31 21:50:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918022733] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 21:50:38,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271090593] [2023-08-31 21:50:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:50:38,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 21:50:38,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 21:50:38,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 21:50:38,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-31 21:50:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:50:38,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 21:50:38,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 21:50:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 21:50:38,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 21:50:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 21:50:38,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271090593] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 21:50:38,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 21:50:38,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-31 21:50:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032150501] [2023-08-31 21:50:38,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:50:38,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 21:50:38,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:50:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 21:50:38,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-31 21:50:39,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 538 out of 1164 [2023-08-31 21:50:39,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 199 transitions, 549 flow. Second operand has 5 states, 5 states have (on average 541.2) internal successors, (2706), 5 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:39,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:50:39,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 538 of 1164 [2023-08-31 21:50:39,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:50:46,264 INFO L130 PetriNetUnfolder]: 27752/76157 cut-off events. [2023-08-31 21:50:46,264 INFO L131 PetriNetUnfolder]: For 23952/25632 co-relation queries the response was YES. [2023-08-31 21:50:46,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136379 conditions, 76157 events. 27752/76157 cut-off events. For 23952/25632 co-relation queries the response was YES. Maximal size of possible extension queue 1502. Compared 967893 event pairs, 12690 based on Foata normal form. 1893/70344 useless extension candidates. Maximal degree in co-relation 136364. Up to 28393 conditions per place. [2023-08-31 21:50:46,868 INFO L137 encePairwiseOnDemand]: 1158/1164 looper letters, 111 selfloop transitions, 5 changer transitions 0/238 dead transitions. [2023-08-31 21:50:46,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 238 transitions, 902 flow [2023-08-31 21:50:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 21:50:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 21:50:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2785 transitions. [2023-08-31 21:50:46,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47852233676975947 [2023-08-31 21:50:46,872 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2785 transitions. [2023-08-31 21:50:46,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2785 transitions. [2023-08-31 21:50:46,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:50:46,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2785 transitions. [2023-08-31 21:50:46,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 557.0) internal successors, (2785), 5 states have internal predecessors, (2785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:46,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1164.0) internal successors, (6984), 6 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:46,878 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1164.0) internal successors, (6984), 6 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:46,878 INFO L175 Difference]: Start difference. First operand has 202 places, 199 transitions, 549 flow. Second operand 5 states and 2785 transitions. [2023-08-31 21:50:46,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 238 transitions, 902 flow [2023-08-31 21:50:47,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 238 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 21:50:47,168 INFO L231 Difference]: Finished difference. Result has 206 places, 200 transitions, 568 flow [2023-08-31 21:50:47,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=206, PETRI_TRANSITIONS=200} [2023-08-31 21:50:47,169 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -36 predicate places. [2023-08-31 21:50:47,169 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 568 flow [2023-08-31 21:50:47,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 541.2) internal successors, (2706), 5 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:47,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:50:47,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:50:47,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-31 21:50:47,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-31 21:50:47,370 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:50:47,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:50:47,370 INFO L85 PathProgramCache]: Analyzing trace with hash 677930533, now seen corresponding path program 1 times [2023-08-31 21:50:47,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:50:47,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969602369] [2023-08-31 21:50:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:50:47,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:50:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:50:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 21:50:47,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:50:47,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969602369] [2023-08-31 21:50:47,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969602369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:50:47,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:50:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 21:50:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092433182] [2023-08-31 21:50:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:50:47,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 21:50:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:50:47,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 21:50:47,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 21:50:47,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-31 21:50:47,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 562.6666666666666) internal successors, (1688), 3 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:47,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:50:47,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-31 21:50:47,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:50:53,541 INFO L130 PetriNetUnfolder]: 23471/58266 cut-off events. [2023-08-31 21:50:53,541 INFO L131 PetriNetUnfolder]: For 25661/28434 co-relation queries the response was YES. [2023-08-31 21:50:53,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112565 conditions, 58266 events. 23471/58266 cut-off events. For 25661/28434 co-relation queries the response was YES. Maximal size of possible extension queue 1289. Compared 695110 event pairs, 16543 based on Foata normal form. 2751/54641 useless extension candidates. Maximal degree in co-relation 112548. Up to 30207 conditions per place. [2023-08-31 21:50:53,993 INFO L137 encePairwiseOnDemand]: 1162/1164 looper letters, 106 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2023-08-31 21:50:53,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 231 transitions, 897 flow [2023-08-31 21:50:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 21:50:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 21:50:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1757 transitions. [2023-08-31 21:50:53,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031500572737686 [2023-08-31 21:50:53,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1757 transitions. [2023-08-31 21:50:53,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1757 transitions. [2023-08-31 21:50:53,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:50:53,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1757 transitions. [2023-08-31 21:50:53,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 585.6666666666666) internal successors, (1757), 3 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:54,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:54,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:54,001 INFO L175 Difference]: Start difference. First operand has 206 places, 200 transitions, 568 flow. Second operand 3 states and 1757 transitions. [2023-08-31 21:50:54,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 231 transitions, 897 flow [2023-08-31 21:50:54,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 231 transitions, 887 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 21:50:54,168 INFO L231 Difference]: Finished difference. Result has 207 places, 199 transitions, 564 flow [2023-08-31 21:50:54,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=207, PETRI_TRANSITIONS=199} [2023-08-31 21:50:54,168 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -35 predicate places. [2023-08-31 21:50:54,169 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 199 transitions, 564 flow [2023-08-31 21:50:54,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.6666666666666) internal successors, (1688), 3 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:54,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:50:54,169 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:50:54,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 21:50:54,170 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:50:54,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:50:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash 305892674, now seen corresponding path program 1 times [2023-08-31 21:50:54,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:50:54,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887358770] [2023-08-31 21:50:54,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:50:54,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:50:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:50:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-31 21:50:54,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:50:54,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887358770] [2023-08-31 21:50:54,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887358770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:50:54,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:50:54,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 21:50:54,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568372939] [2023-08-31 21:50:54,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:50:54,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 21:50:54,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:50:54,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 21:50:54,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 21:50:54,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-31 21:50:54,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 199 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:50:54,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:50:54,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-31 21:50:54,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:50:59,745 INFO L130 PetriNetUnfolder]: 21742/53160 cut-off events. [2023-08-31 21:50:59,745 INFO L131 PetriNetUnfolder]: For 27678/30381 co-relation queries the response was YES. [2023-08-31 21:51:00,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104235 conditions, 53160 events. 21742/53160 cut-off events. For 27678/30381 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 614428 event pairs, 15387 based on Foata normal form. 2703/50561 useless extension candidates. Maximal degree in co-relation 104217. Up to 27968 conditions per place. [2023-08-31 21:51:00,184 INFO L137 encePairwiseOnDemand]: 1162/1164 looper letters, 109 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2023-08-31 21:51:00,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 234 transitions, 900 flow [2023-08-31 21:51:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 21:51:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 21:51:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2023-08-31 21:51:00,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048682703321878 [2023-08-31 21:51:00,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2023-08-31 21:51:00,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2023-08-31 21:51:00,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:51:00,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2023-08-31 21:51:00,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:00,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:00,190 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:00,190 INFO L175 Difference]: Start difference. First operand has 207 places, 199 transitions, 564 flow. Second operand 3 states and 1763 transitions. [2023-08-31 21:51:00,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 234 transitions, 900 flow [2023-08-31 21:51:00,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 234 transitions, 894 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 21:51:00,380 INFO L231 Difference]: Finished difference. Result has 209 places, 198 transitions, 564 flow [2023-08-31 21:51:00,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=209, PETRI_TRANSITIONS=198} [2023-08-31 21:51:00,380 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -33 predicate places. [2023-08-31 21:51:00,381 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 198 transitions, 564 flow [2023-08-31 21:51:00,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:00,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:51:00,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:51:00,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 21:51:00,382 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:51:00,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:51:00,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1960279651, now seen corresponding path program 1 times [2023-08-31 21:51:00,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:51:00,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457391396] [2023-08-31 21:51:00,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:51:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:51:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:51:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 21:51:00,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:51:00,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457391396] [2023-08-31 21:51:00,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457391396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:51:00,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:51:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 21:51:00,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876753582] [2023-08-31 21:51:00,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:51:00,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 21:51:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:51:00,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 21:51:00,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 21:51:00,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 1164 [2023-08-31 21:51:00,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 198 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 546.6666666666666) internal successors, (1640), 3 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:00,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:51:00,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 1164 [2023-08-31 21:51:00,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:51:06,527 INFO L130 PetriNetUnfolder]: 26021/62543 cut-off events. [2023-08-31 21:51:06,528 INFO L131 PetriNetUnfolder]: For 31861/34905 co-relation queries the response was YES. [2023-08-31 21:51:06,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123255 conditions, 62543 events. 26021/62543 cut-off events. For 31861/34905 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 729797 event pairs, 20057 based on Foata normal form. 2487/59310 useless extension candidates. Maximal degree in co-relation 123236. Up to 36133 conditions per place. [2023-08-31 21:51:07,070 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 76 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2023-08-31 21:51:07,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 195 transitions, 714 flow [2023-08-31 21:51:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 21:51:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 21:51:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1693 transitions. [2023-08-31 21:51:07,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4848224513172967 [2023-08-31 21:51:07,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1693 transitions. [2023-08-31 21:51:07,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1693 transitions. [2023-08-31 21:51:07,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:51:07,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1693 transitions. [2023-08-31 21:51:07,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:07,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:07,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:07,077 INFO L175 Difference]: Start difference. First operand has 209 places, 198 transitions, 564 flow. Second operand 3 states and 1693 transitions. [2023-08-31 21:51:07,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 195 transitions, 714 flow [2023-08-31 21:51:07,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 195 transitions, 712 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 21:51:07,830 INFO L231 Difference]: Finished difference. Result has 207 places, 195 transitions, 560 flow [2023-08-31 21:51:07,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=207, PETRI_TRANSITIONS=195} [2023-08-31 21:51:07,831 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -35 predicate places. [2023-08-31 21:51:07,831 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 195 transitions, 560 flow [2023-08-31 21:51:07,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 546.6666666666666) internal successors, (1640), 3 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:07,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:51:07,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:51:07,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 21:51:07,831 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:51:07,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:51:07,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1662410549, now seen corresponding path program 1 times [2023-08-31 21:51:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:51:07,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840087847] [2023-08-31 21:51:07,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:51:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:51:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:51:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 21:51:07,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:51:07,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840087847] [2023-08-31 21:51:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840087847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:51:07,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:51:07,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 21:51:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864122534] [2023-08-31 21:51:07,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:51:07,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 21:51:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:51:07,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 21:51:07,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 21:51:07,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 1164 [2023-08-31 21:51:07,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 195 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 547.0) internal successors, (1641), 3 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:07,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:51:07,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 1164 [2023-08-31 21:51:07,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 21:51:14,814 INFO L130 PetriNetUnfolder]: 33826/73303 cut-off events. [2023-08-31 21:51:14,814 INFO L131 PetriNetUnfolder]: For 38933/43007 co-relation queries the response was YES. [2023-08-31 21:51:15,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151617 conditions, 73303 events. 33826/73303 cut-off events. For 38933/43007 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 818106 event pairs, 8250 based on Foata normal form. 3342/72569 useless extension candidates. Maximal degree in co-relation 151598. Up to 40840 conditions per place. [2023-08-31 21:51:15,444 INFO L137 encePairwiseOnDemand]: 1155/1164 looper letters, 110 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2023-08-31 21:51:15,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 222 transitions, 891 flow [2023-08-31 21:51:15,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 21:51:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 21:51:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1727 transitions. [2023-08-31 21:51:15,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945589919816724 [2023-08-31 21:51:15,447 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1727 transitions. [2023-08-31 21:51:15,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1727 transitions. [2023-08-31 21:51:15,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 21:51:15,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1727 transitions. [2023-08-31 21:51:15,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 575.6666666666666) internal successors, (1727), 3 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:15,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:15,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1164.0) internal successors, (4656), 4 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:15,450 INFO L175 Difference]: Start difference. First operand has 207 places, 195 transitions, 560 flow. Second operand 3 states and 1727 transitions. [2023-08-31 21:51:15,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 222 transitions, 891 flow [2023-08-31 21:51:15,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 222 transitions, 889 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 21:51:15,645 INFO L231 Difference]: Finished difference. Result has 203 places, 192 transitions, 573 flow [2023-08-31 21:51:15,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=203, PETRI_TRANSITIONS=192} [2023-08-31 21:51:15,646 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -39 predicate places. [2023-08-31 21:51:15,646 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 192 transitions, 573 flow [2023-08-31 21:51:15,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 547.0) internal successors, (1641), 3 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:15,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 21:51:15,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 21:51:15,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 21:51:15,647 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-31 21:51:15,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 21:51:15,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1321343099, now seen corresponding path program 1 times [2023-08-31 21:51:15,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 21:51:15,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386796094] [2023-08-31 21:51:15,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 21:51:15,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 21:51:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 21:51:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 21:51:15,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 21:51:15,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386796094] [2023-08-31 21:51:15,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386796094] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 21:51:15,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 21:51:15,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 21:51:15,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620039764] [2023-08-31 21:51:15,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 21:51:15,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 21:51:15,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 21:51:15,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 21:51:15,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 21:51:16,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 1164 [2023-08-31 21:51:16,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 192 transitions, 573 flow. Second operand has 8 states, 8 states have (on average 537.75) internal successors, (4302), 8 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 21:51:16,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 21:51:16,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 1164 [2023-08-31 21:51:16,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand