./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 AFTER --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 AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 03:39:37,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 03:39:37,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 03:39:37,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 03:39:37,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 03:39:37,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 03:39:37,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 03:39:37,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 03:39:37,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 03:39:37,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 03:39:37,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 03:39:37,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 03:39:37,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 03:39:37,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 03:39:37,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 03:39:37,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 03:39:37,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 03:39:37,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 03:39:37,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 03:39:37,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 03:39:37,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 03:39:37,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 03:39:37,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 03:39:37,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 03:39:37,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 03:39:37,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 03:39:37,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 03:39:37,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 03:39:37,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 03:39:37,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 03:39:37,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 03:39:37,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 03:39:37,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 03:39:37,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 03:39:37,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 03:39:37,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 03:39:37,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 03:39:37,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 03:39:37,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 03:39:37,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 03:39:37,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 03:39:37,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 03:39:37,338 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 03:39:37,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 03:39:37,339 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 03:39:37,339 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 03:39:37,340 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 03:39:37,340 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 03:39:37,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 03:39:37,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 03:39:37,341 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 03:39:37,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 03:39:37,342 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 03:39:37,342 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 03:39:37,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 03:39:37,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 03:39:37,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 03:39:37,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 03:39:37,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 03:39:37,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 03:39:37,343 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 03:39:37,344 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 03:39:37,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 03:39:37,344 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 03:39:37,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 03:39:37,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 03:39:37,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 03:39:37,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 03:39:37,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:39:37,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 03:39:37,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 03:39:37,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 03:39:37,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 03:39:37,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 03:39:37,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 03:39:37,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 03:39:37,347 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 03:39:37,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 03:39:37,347 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 03:39:37,347 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 -> AFTER [2023-08-29 03:39:37,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 03:39:37,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 03:39:37,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 03:39:37,653 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 03:39:37,654 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 03:39:37,655 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-29 03:39:38,758 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 03:39:38,939 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 03:39:38,940 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2023-08-29 03:39:38,946 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8721f48c9/f2dccace521b4262a5a49abe51255e23/FLAG9408cb298 [2023-08-29 03:39:38,963 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8721f48c9/f2dccace521b4262a5a49abe51255e23 [2023-08-29 03:39:38,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 03:39:38,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 03:39:38,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 03:39:38,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 03:39:38,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 03:39:38,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:39:38" (1/1) ... [2023-08-29 03:39:38,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341187c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:38, skipping insertion in model container [2023-08-29 03:39:38,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:39:38" (1/1) ... [2023-08-29 03:39:38,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 03:39:39,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 03:39:39,222 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-29 03:39:39,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:39:39,239 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 03:39:39,274 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-29 03:39:39,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:39:39,285 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 03:39:39,286 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 03:39:39,291 INFO L208 MainTranslator]: Completed translation [2023-08-29 03:39:39,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39 WrapperNode [2023-08-29 03:39:39,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 03:39:39,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 03:39:39,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 03:39:39,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 03:39:39,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (1/1) ... [2023-08-29 03:39:39,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (1/1) ... [2023-08-29 03:39:39,370 INFO L138 Inliner]: procedures = 28, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 668 [2023-08-29 03:39:39,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 03:39:39,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 03:39:39,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 03:39:39,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 03:39:39,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (1/1) ... [2023-08-29 03:39:39,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (1/1) ... [2023-08-29 03:39:39,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (1/1) ... [2023-08-29 03:39:39,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (1/1) ... [2023-08-29 03:39:39,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (1/1) ... [2023-08-29 03:39:39,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (1/1) ... [2023-08-29 03:39:39,434 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (1/1) ... [2023-08-29 03:39:39,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (1/1) ... [2023-08-29 03:39:39,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 03:39:39,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 03:39:39,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 03:39:39,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 03:39:39,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (1/1) ... [2023-08-29 03:39:39,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:39:39,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:39:39,478 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-29 03:39:39,487 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-29 03:39:39,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 03:39:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-29 03:39:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 03:39:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 03:39:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 03:39:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-08-29 03:39:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 03:39:39,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 03:39:39,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 03:39:39,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 03:39:39,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-29 03:39:39,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-29 03:39:39,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 03:39:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 03:39:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 03:39:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-29 03:39:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 03:39:39,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 03:39:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 03:39:39,526 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 03:39:39,688 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 03:39:39,702 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 03:39:40,585 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 03:39:40,977 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 03:39:40,978 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-29 03:39:40,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:39:40 BoogieIcfgContainer [2023-08-29 03:39:40,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 03:39:40,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 03:39:40,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 03:39:40,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 03:39:40,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 03:39:38" (1/3) ... [2023-08-29 03:39:40,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43189cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:39:40, skipping insertion in model container [2023-08-29 03:39:40,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:39:39" (2/3) ... [2023-08-29 03:39:40,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43189cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:39:40, skipping insertion in model container [2023-08-29 03:39:40,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:39:40" (3/3) ... [2023-08-29 03:39:40,990 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2023-08-29 03:39:40,998 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 03:39:41,006 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 03:39:41,007 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 87 error locations. [2023-08-29 03:39:41,007 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 03:39:41,215 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 03:39:41,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 592 places, 618 transitions, 1260 flow [2023-08-29 03:39:41,518 INFO L130 PetriNetUnfolder]: 36/615 cut-off events. [2023-08-29 03:39:41,519 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 03:39:41,532 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-29 03:39:41,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 592 places, 618 transitions, 1260 flow [2023-08-29 03:39:41,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 573 places, 598 transitions, 1214 flow [2023-08-29 03:39:41,545 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:39:41,553 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 573 places, 598 transitions, 1214 flow [2023-08-29 03:39:41,555 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 573 places, 598 transitions, 1214 flow [2023-08-29 03:39:41,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 573 places, 598 transitions, 1214 flow [2023-08-29 03:39:41,668 INFO L130 PetriNetUnfolder]: 35/598 cut-off events. [2023-08-29 03:39:41,668 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 03:39:41,673 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-29 03:39:41,697 INFO L119 LiptonReduction]: Number of co-enabled transitions 66564 [2023-08-29 03:41:01,975 INFO L134 LiptonReduction]: Checked pairs total: 477518 [2023-08-29 03:41:01,975 INFO L136 LiptonReduction]: Total number of compositions: 546 [2023-08-29 03:41:01,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 03:41:01,991 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;@28107c84, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:41:01,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 151 error locations. [2023-08-29 03:41:01,993 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 03:41:01,993 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:41:01,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:01,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 03:41:01,994 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-29 03:41:01,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:01,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2680, now seen corresponding path program 1 times [2023-08-29 03:41:02,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:02,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230258692] [2023-08-29 03:41:02,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:02,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:02,087 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-29 03:41:02,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:02,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230258692] [2023-08-29 03:41:02,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230258692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:41:02,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:41:02,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 03:41:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719786873] [2023-08-29 03:41:02,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:41:02,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 03:41:02,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 03:41:02,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 03:41:02,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 1164 [2023-08-29 03:41:02,187 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-29 03:41:02,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:02,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 1164 [2023-08-29 03:41:02,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:41:05,838 INFO L130 PetriNetUnfolder]: 10996/26551 cut-off events. [2023-08-29 03:41:05,838 INFO L131 PetriNetUnfolder]: For 578/578 co-relation queries the response was YES. [2023-08-29 03:41:05,922 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-29 03:41:06,067 INFO L137 encePairwiseOnDemand]: 1108/1164 looper letters, 58 selfloop transitions, 0 changer transitions 1/195 dead transitions. [2023-08-29 03:41:06,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 195 transitions, 526 flow [2023-08-29 03:41:06,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 03:41:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 03:41:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1239 transitions. [2023-08-29 03:41:06,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5322164948453608 [2023-08-29 03:41:06,086 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1239 transitions. [2023-08-29 03:41:06,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1239 transitions. [2023-08-29 03:41:06,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:41:06,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1239 transitions. [2023-08-29 03:41:06,098 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-29 03:41:06,108 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-29 03:41:06,110 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-29 03:41:06,112 INFO L175 Difference]: Start difference. First operand has 242 places, 251 transitions, 520 flow. Second operand 2 states and 1239 transitions. [2023-08-29 03:41:06,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 195 transitions, 526 flow [2023-08-29 03:41:06,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 195 transitions, 514 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-29 03:41:06,142 INFO L231 Difference]: Finished difference. Result has 187 places, 194 transitions, 393 flow [2023-08-29 03:41:06,144 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-29 03:41:06,147 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -55 predicate places. [2023-08-29 03:41:06,148 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 194 transitions, 393 flow [2023-08-29 03:41:06,149 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-29 03:41:06,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:06,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:41:06,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 03:41:06,150 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-29 03:41:06,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1016127394, now seen corresponding path program 1 times [2023-08-29 03:41:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:06,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369279871] [2023-08-29 03:41:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:06,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:06,331 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-29 03:41:06,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:06,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369279871] [2023-08-29 03:41:06,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369279871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:41:06,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:41:06,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:41:06,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786375579] [2023-08-29 03:41:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:41:06,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:41:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:41:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:41:06,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 1164 [2023-08-29 03:41:06,356 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-29 03:41:06,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:06,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 1164 [2023-08-29 03:41:06,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:41:08,676 INFO L130 PetriNetUnfolder]: 13301/31171 cut-off events. [2023-08-29 03:41:08,676 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2023-08-29 03:41:08,738 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-29 03:41:08,881 INFO L137 encePairwiseOnDemand]: 1161/1164 looper letters, 60 selfloop transitions, 1 changer transitions 0/192 dead transitions. [2023-08-29 03:41:08,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 192 transitions, 511 flow [2023-08-29 03:41:08,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:41:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:41:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2023-08-29 03:41:08,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48711340206185566 [2023-08-29 03:41:08,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1701 transitions. [2023-08-29 03:41:08,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1701 transitions. [2023-08-29 03:41:08,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:41:08,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1701 transitions. [2023-08-29 03:41:08,892 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-29 03:41:08,898 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-29 03:41:08,900 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-29 03:41:08,901 INFO L175 Difference]: Start difference. First operand has 187 places, 194 transitions, 393 flow. Second operand 3 states and 1701 transitions. [2023-08-29 03:41:08,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 192 transitions, 511 flow [2023-08-29 03:41:08,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 192 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:41:08,909 INFO L231 Difference]: Finished difference. Result has 186 places, 192 transitions, 391 flow [2023-08-29 03:41:08,910 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-29 03:41:08,912 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -56 predicate places. [2023-08-29 03:41:08,912 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 192 transitions, 391 flow [2023-08-29 03:41:08,913 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-29 03:41:08,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:08,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:41:08,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 03:41:08,914 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-29 03:41:08,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1540780517, now seen corresponding path program 1 times [2023-08-29 03:41:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:08,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59425385] [2023-08-29 03:41:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:09,066 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-29 03:41:09,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:09,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59425385] [2023-08-29 03:41:09,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59425385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:41:09,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:41:09,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:41:09,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629095146] [2023-08-29 03:41:09,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:41:09,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:41:09,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:09,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:41:09,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:41:09,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 1164 [2023-08-29 03:41:09,098 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-29 03:41:09,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:09,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 1164 [2023-08-29 03:41:09,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:41:12,604 INFO L130 PetriNetUnfolder]: 21210/49026 cut-off events. [2023-08-29 03:41:12,604 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2023-08-29 03:41:12,685 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-29 03:41:12,880 INFO L137 encePairwiseOnDemand]: 1155/1164 looper letters, 82 selfloop transitions, 3 changer transitions 0/204 dead transitions. [2023-08-29 03:41:12,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 204 transitions, 589 flow [2023-08-29 03:41:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:41:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:41:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1720 transitions. [2023-08-29 03:41:12,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925544100801833 [2023-08-29 03:41:12,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1720 transitions. [2023-08-29 03:41:12,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1720 transitions. [2023-08-29 03:41:12,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:41:12,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1720 transitions. [2023-08-29 03:41:12,890 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-29 03:41:12,895 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-29 03:41:12,897 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-29 03:41:12,897 INFO L175 Difference]: Start difference. First operand has 186 places, 192 transitions, 391 flow. Second operand 3 states and 1720 transitions. [2023-08-29 03:41:12,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 204 transitions, 589 flow [2023-08-29 03:41:12,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 204 transitions, 588 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:41:12,902 INFO L231 Difference]: Finished difference. Result has 182 places, 189 transitions, 399 flow [2023-08-29 03:41:12,903 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-29 03:41:12,904 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -60 predicate places. [2023-08-29 03:41:12,907 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 189 transitions, 399 flow [2023-08-29 03:41:12,909 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-29 03:41:12,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:12,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:41:12,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 03:41:12,910 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-29 03:41:12,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash -890424331, now seen corresponding path program 1 times [2023-08-29 03:41:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769371967] [2023-08-29 03:41:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:12,994 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-29 03:41:12,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:12,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769371967] [2023-08-29 03:41:12,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769371967] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:41:12,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:41:12,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:41:12,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617742575] [2023-08-29 03:41:12,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:41:12,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:41:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:41:12,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:41:13,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 1164 [2023-08-29 03:41:13,013 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-29 03:41:13,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:13,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 1164 [2023-08-29 03:41:13,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:41:14,203 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-29 03:41:14,204 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 03:41:14,204 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 03:41:14,204 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 03:41:14,204 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:14,433 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-29 03:41:14,433 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 03:41:14,433 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 03:41:14,433 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 03:41:14,433 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:14,486 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-29 03:41:14,487 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:14,487 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:14,487 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:14,487 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:14,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][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-29 03:41:14,487 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:14,487 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:14,488 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:14,488 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:14,563 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-29 03:41:14,563 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:41:14,563 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:14,563 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:14,564 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:14,564 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-29 03:41:14,564 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:41:14,564 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:14,564 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:14,564 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:15,536 INFO L130 PetriNetUnfolder]: 14189/32904 cut-off events. [2023-08-29 03:41:15,536 INFO L131 PetriNetUnfolder]: For 1176/1176 co-relation queries the response was YES. [2023-08-29 03:41:15,598 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-29 03:41:15,713 INFO L137 encePairwiseOnDemand]: 1161/1164 looper letters, 60 selfloop transitions, 1 changer transitions 0/187 dead transitions. [2023-08-29 03:41:15,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 187 transitions, 517 flow [2023-08-29 03:41:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:41:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:41:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2023-08-29 03:41:15,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48940435280641464 [2023-08-29 03:41:15,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1709 transitions. [2023-08-29 03:41:15,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1709 transitions. [2023-08-29 03:41:15,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:41:15,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1709 transitions. [2023-08-29 03:41:15,724 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-29 03:41:15,729 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-29 03:41:15,731 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-29 03:41:15,731 INFO L175 Difference]: Start difference. First operand has 182 places, 189 transitions, 399 flow. Second operand 3 states and 1709 transitions. [2023-08-29 03:41:15,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 187 transitions, 517 flow [2023-08-29 03:41:15,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 187 transitions, 517 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:41:15,736 INFO L231 Difference]: Finished difference. Result has 182 places, 187 transitions, 397 flow [2023-08-29 03:41:15,737 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-29 03:41:15,737 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -60 predicate places. [2023-08-29 03:41:15,737 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 187 transitions, 397 flow [2023-08-29 03:41:15,739 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-29 03:41:15,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:15,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:41:15,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 03:41:15,739 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-29 03:41:15,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:15,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1041709781, now seen corresponding path program 1 times [2023-08-29 03:41:15,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:15,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892713954] [2023-08-29 03:41:15,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:15,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:16,191 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-29 03:41:16,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:16,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892713954] [2023-08-29 03:41:16,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892713954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:41:16,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:41:16,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:41:16,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871686100] [2023-08-29 03:41:16,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:41:16,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:41:16,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:16,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:41:16,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:41:16,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 1164 [2023-08-29 03:41:16,954 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-29 03:41:16,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:16,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 1164 [2023-08-29 03:41:16,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:41:19,755 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-29 03:41:19,756 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 03:41:19,756 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 03:41:19,756 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-29 03:41:19,756 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 03:41:19,884 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-29 03:41:19,884 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 03:41:19,884 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 03:41:19,884 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-29 03:41:19,884 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 03:41:19,884 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-29 03:41:19,884 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 03:41:19,885 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 03:41:19,885 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 03:41:19,885 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 03:41:20,178 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-29 03:41:20,178 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 03:41:20,179 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:20,179 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 03:41:20,179 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 03:41:20,179 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-29 03:41:20,179 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 03:41:20,179 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:20,179 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 03:41:20,179 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 03:41:20,180 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-29 03:41:20,180 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 03:41:20,180 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 03:41:20,180 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:20,180 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:20,180 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-29 03:41:20,180 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 03:41:20,180 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:20,181 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 03:41:20,181 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:20,290 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-29 03:41:20,290 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,290 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:20,290 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,290 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,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][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-29 03:41:20,617 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,617 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,617 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:20,617 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,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][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-29 03:41:20,647 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,647 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,648 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:20,648 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:20,648 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-29 03:41:20,648 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,648 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,648 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:20,648 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:20,648 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-29 03:41:20,648 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,649 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:20,649 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:20,649 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,649 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-29 03:41:20,649 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,649 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:20,649 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:20,649 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,649 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-29 03:41:20,649 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,649 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,649 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:20,649 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:20,650 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-29 03:41:20,650 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,650 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,650 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:20,650 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:20,718 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-29 03:41:20,718 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 03:41:20,718 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:20,719 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:20,719 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,826 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-29 03:41:20,826 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:20,826 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,826 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:20,826 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:20,856 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-29 03:41:20,856 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 03:41:20,856 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:20,857 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:20,857 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,857 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-29 03:41:20,857 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:20,857 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:20,857 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:20,857 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,857 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-29 03:41:20,857 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 03:41:20,857 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:20,857 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:20,857 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:20,858 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-29 03:41:20,858 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:20,858 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:20,858 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:20,858 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:20,923 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-29 03:41:20,923 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 03:41:20,923 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:20,923 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:20,923 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 03:41:20,926 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-29 03:41:20,926 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 03:41:20,926 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 03:41:20,926 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:20,926 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:21,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][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-29 03:41:21,041 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 03:41:21,041 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:21,041 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:21,042 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 03:41:21,043 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-29 03:41:21,043 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 03:41:21,043 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:21,043 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:21,043 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 03:41:23,295 INFO L130 PetriNetUnfolder]: 39245/63637 cut-off events. [2023-08-29 03:41:23,295 INFO L131 PetriNetUnfolder]: For 2389/2389 co-relation queries the response was YES. [2023-08-29 03:41:23,431 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-29 03:41:23,696 INFO L137 encePairwiseOnDemand]: 1159/1164 looper letters, 219 selfloop transitions, 4 changer transitions 0/346 dead transitions. [2023-08-29 03:41:23,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 346 transitions, 1181 flow [2023-08-29 03:41:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:41:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:41:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3441 transitions. [2023-08-29 03:41:23,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49269759450171824 [2023-08-29 03:41:23,706 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3441 transitions. [2023-08-29 03:41:23,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3441 transitions. [2023-08-29 03:41:23,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:41:23,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3441 transitions. [2023-08-29 03:41:23,715 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-29 03:41:23,725 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-29 03:41:23,727 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-29 03:41:23,727 INFO L175 Difference]: Start difference. First operand has 182 places, 187 transitions, 397 flow. Second operand 6 states and 3441 transitions. [2023-08-29 03:41:23,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 346 transitions, 1181 flow [2023-08-29 03:41:23,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 346 transitions, 1180 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:41:23,733 INFO L231 Difference]: Finished difference. Result has 185 places, 186 transitions, 402 flow [2023-08-29 03:41:23,733 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-29 03:41:23,734 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -57 predicate places. [2023-08-29 03:41:23,734 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 186 transitions, 402 flow [2023-08-29 03:41:23,735 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-29 03:41:23,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:23,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:41:23,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 03:41:23,736 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-29 03:41:23,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1364000831, now seen corresponding path program 1 times [2023-08-29 03:41:23,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:23,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193297627] [2023-08-29 03:41:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:23,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:23,828 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-29 03:41:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193297627] [2023-08-29 03:41:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193297627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:41:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:41:23,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 03:41:23,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497983363] [2023-08-29 03:41:23,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:41:23,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 03:41:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:23,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 03:41:23,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 03:41:23,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 1164 [2023-08-29 03:41:23,935 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-29 03:41:23,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:23,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 1164 [2023-08-29 03:41:23,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:41:25,097 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-29 03:41:25,097 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 03:41:25,098 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 03:41:25,098 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 03:41:25,098 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 03:41:25,159 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-29 03:41:25,160 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 03:41:25,160 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 03:41:25,160 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:25,160 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:25,224 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-29 03:41:25,224 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 03:41:25,224 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 03:41:25,224 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:25,224 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:25,283 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-29 03:41:25,283 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:25,283 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:25,283 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:25,283 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:25,284 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-29 03:41:25,284 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:25,284 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:25,284 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:25,284 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:25,331 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-29 03:41:25,331 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:41:25,331 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:25,331 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:25,331 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:25,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][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-29 03:41:25,381 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 03:41:25,381 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:25,381 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:25,382 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:25,382 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-29 03:41:25,382 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 03:41:25,382 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:25,382 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:25,382 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:25,436 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-29 03:41:25,437 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:25,437 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:25,437 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:25,437 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:25,437 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-29 03:41:25,437 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:25,437 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:25,437 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:25,437 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:25,437 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-29 03:41:25,438 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 03:41:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 03:41:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:25,438 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-29 03:41:25,438 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:25,438 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-29 03:41:25,438 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:26,654 INFO L130 PetriNetUnfolder]: 12849/29723 cut-off events. [2023-08-29 03:41:26,654 INFO L131 PetriNetUnfolder]: For 2740/2740 co-relation queries the response was YES. [2023-08-29 03:41:26,706 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-29 03:41:26,782 INFO L137 encePairwiseOnDemand]: 1156/1164 looper letters, 57 selfloop transitions, 4 changer transitions 12/200 dead transitions. [2023-08-29 03:41:26,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 200 transitions, 576 flow [2023-08-29 03:41:26,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 03:41:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 03:41:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2814 transitions. [2023-08-29 03:41:26,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48350515463917526 [2023-08-29 03:41:26,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2814 transitions. [2023-08-29 03:41:26,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2814 transitions. [2023-08-29 03:41:26,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:41:26,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2814 transitions. [2023-08-29 03:41:26,796 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-29 03:41:26,803 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-29 03:41:26,804 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-29 03:41:26,804 INFO L175 Difference]: Start difference. First operand has 185 places, 186 transitions, 402 flow. Second operand 5 states and 2814 transitions. [2023-08-29 03:41:26,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 200 transitions, 576 flow [2023-08-29 03:41:26,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 200 transitions, 569 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 03:41:26,827 INFO L231 Difference]: Finished difference. Result has 188 places, 188 transitions, 427 flow [2023-08-29 03:41:26,827 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-29 03:41:26,828 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -54 predicate places. [2023-08-29 03:41:26,828 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 188 transitions, 427 flow [2023-08-29 03:41:26,828 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-29 03:41:26,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:26,829 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-29 03:41:26,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 03:41:26,829 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-29 03:41:26,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:26,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1533179764, now seen corresponding path program 1 times [2023-08-29 03:41:26,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:26,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154428084] [2023-08-29 03:41:26,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:26,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:27,166 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-29 03:41:27,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:27,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154428084] [2023-08-29 03:41:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154428084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:41:27,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:41:27,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:41:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201267093] [2023-08-29 03:41:27,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:41:27,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:41:27,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:27,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:41:27,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:41:27,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-29 03:41:27,826 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-29 03:41:27,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:27,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-29 03:41:27,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:41:32,649 INFO L130 PetriNetUnfolder]: 22177/44087 cut-off events. [2023-08-29 03:41:32,649 INFO L131 PetriNetUnfolder]: For 633/633 co-relation queries the response was YES. [2023-08-29 03:41:32,762 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-29 03:41:32,890 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 198 selfloop transitions, 5 changer transitions 0/318 dead transitions. [2023-08-29 03:41:32,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 318 transitions, 1101 flow [2023-08-29 03:41:32,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:41:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:41:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3382 transitions. [2023-08-29 03:41:32,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48424971363115693 [2023-08-29 03:41:32,898 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3382 transitions. [2023-08-29 03:41:32,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3382 transitions. [2023-08-29 03:41:32,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:41:32,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3382 transitions. [2023-08-29 03:41:32,904 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-29 03:41:32,911 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-29 03:41:32,913 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-29 03:41:32,913 INFO L175 Difference]: Start difference. First operand has 188 places, 188 transitions, 427 flow. Second operand 6 states and 3382 transitions. [2023-08-29 03:41:32,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 318 transitions, 1101 flow [2023-08-29 03:41:32,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 318 transitions, 1087 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-29 03:41:32,918 INFO L231 Difference]: Finished difference. Result has 186 places, 186 transitions, 419 flow [2023-08-29 03:41:32,919 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-29 03:41:32,919 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -56 predicate places. [2023-08-29 03:41:32,920 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 186 transitions, 419 flow [2023-08-29 03:41:32,921 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-29 03:41:32,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:32,921 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-29 03:41:32,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 03:41:32,922 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-29 03:41:32,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash 212661638, now seen corresponding path program 1 times [2023-08-29 03:41:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855585147] [2023-08-29 03:41:32,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:32,970 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-29 03:41:32,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:32,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855585147] [2023-08-29 03:41:32,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855585147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:41:32,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:41:32,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 03:41:32,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032501550] [2023-08-29 03:41:32,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:41:32,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:41:32,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:32,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:41:32,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:41:32,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 03:41:32,982 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-29 03:41:32,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:32,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 03:41:32,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:41:34,024 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-29 03:41:34,025 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 03:41:34,025 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 03:41:34,025 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 03:41:34,025 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 03:41:34,084 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-29 03:41:34,084 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 03:41:34,084 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 03:41:34,084 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:34,084 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:34,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][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-29 03:41:34,143 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 03:41:34,144 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:34,144 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:34,144 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 03:41:34,197 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-29 03:41:34,197 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:34,198 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:34,198 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:34,198 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:34,198 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-29 03:41:34,198 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:34,198 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:34,198 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:34,198 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:34,277 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-29 03:41:34,277 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:41:34,277 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:34,277 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:34,277 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:34,495 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-29 03:41:34,495 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 03:41:34,495 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:34,495 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:34,495 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:34,496 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-29 03:41:34,496 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 03:41:34,496 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:34,496 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:34,496 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:34,542 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-29 03:41:34,542 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:34,542 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:34,542 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:34,543 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:34,543 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-29 03:41:34,543 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:34,543 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:34,543 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:34,543 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:34,545 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-29 03:41:34,545 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 03:41:34,545 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:34,545 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 03:41:34,545 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:34,546 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-29 03:41:34,546 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:34,546 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:34,546 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:34,546 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:34,546 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-29 03:41:34,546 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:34,547 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:34,547 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:34,547 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:36,518 INFO L130 PetriNetUnfolder]: 17136/41497 cut-off events. [2023-08-29 03:41:36,518 INFO L131 PetriNetUnfolder]: For 1030/1040 co-relation queries the response was YES. [2023-08-29 03:41:36,626 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-29 03:41:36,884 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 95 selfloop transitions, 3 changer transitions 0/223 dead transitions. [2023-08-29 03:41:36,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 223 transitions, 693 flow [2023-08-29 03:41:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:41:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:41:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1767 transitions. [2023-08-29 03:41:36,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060137457044673 [2023-08-29 03:41:36,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1767 transitions. [2023-08-29 03:41:36,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1767 transitions. [2023-08-29 03:41:36,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:41:36,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1767 transitions. [2023-08-29 03:41:36,892 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-29 03:41:36,896 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-29 03:41:36,897 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-29 03:41:36,897 INFO L175 Difference]: Start difference. First operand has 186 places, 186 transitions, 419 flow. Second operand 3 states and 1767 transitions. [2023-08-29 03:41:36,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 223 transitions, 693 flow [2023-08-29 03:41:36,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 223 transitions, 681 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 03:41:36,997 INFO L231 Difference]: Finished difference. Result has 185 places, 188 transitions, 431 flow [2023-08-29 03:41:36,997 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-29 03:41:36,998 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -57 predicate places. [2023-08-29 03:41:36,998 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 188 transitions, 431 flow [2023-08-29 03:41:36,998 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-29 03:41:36,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:36,999 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-29 03:41:36,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 03:41:36,999 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-29 03:41:36,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1946483524, now seen corresponding path program 1 times [2023-08-29 03:41:36,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:37,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614759154] [2023-08-29 03:41:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:37,149 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-29 03:41:37,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:37,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614759154] [2023-08-29 03:41:37,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614759154] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:41:37,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555924205] [2023-08-29 03:41:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:37,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:41:37,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:41:37,157 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-29 03:41:37,181 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-29 03:41:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:37,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 03:41:37,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:41:37,450 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-29 03:41:37,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:41:37,514 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-29 03:41:37,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555924205] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:41:37,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:41:37,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 03:41:37,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113226359] [2023-08-29 03:41:37,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:41:37,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 03:41:37,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:37,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 03:41:37,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-08-29 03:41:38,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 1164 [2023-08-29 03:41:38,453 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-29 03:41:38,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:38,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 1164 [2023-08-29 03:41:38,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:41:42,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][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-29 03:41:42,063 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:42,063 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:42,063 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:42,063 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:42,146 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-29 03:41:42,147 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:41:42,147 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:42,147 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:42,147 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:42,147 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-29 03:41:42,147 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:41:42,147 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:42,148 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:42,148 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:42,158 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-29 03:41:42,158 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:41:42,158 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:42,158 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:42,158 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:42,357 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-29 03:41:42,358 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:41:42,358 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:42,358 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:42,358 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:42,376 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-29 03:41:42,376 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:42,376 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:42,376 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:42,376 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:42,383 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-29 03:41:42,383 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 03:41:42,384 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:42,384 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:42,384 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:42,384 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-29 03:41:42,384 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 03:41:42,384 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:42,384 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:42,385 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:42,457 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-29 03:41:42,458 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:42,458 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:42,458 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:42,458 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:42,458 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-29 03:41:42,458 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 03:41:42,458 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:42,458 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:42,458 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:42,537 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-29 03:41:42,537 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 03:41:42,537 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 03:41:42,537 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:42,537 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:42,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][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-29 03:41:42,538 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 03:41:42,538 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 03:41:42,538 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:42,538 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:42,625 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-29 03:41:42,625 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 03:41:42,625 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:42,625 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:42,625 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 03:41:42,625 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-29 03:41:42,625 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 03:41:42,626 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:42,626 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 03:41:42,626 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:42,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][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-29 03:41:42,626 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-29 03:41:42,626 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 03:41:42,626 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:41:42,626 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 03:41:42,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][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-29 03:41:42,626 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 03:41:42,627 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:42,627 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:42,627 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 03:41:42,627 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-29 03:41:42,627 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 03:41:42,627 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:42,627 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 03:41:42,627 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:45,257 INFO L130 PetriNetUnfolder]: 24341/60206 cut-off events. [2023-08-29 03:41:45,257 INFO L131 PetriNetUnfolder]: For 7276/7394 co-relation queries the response was YES. [2023-08-29 03:41:45,422 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-29 03:41:45,581 INFO L137 encePairwiseOnDemand]: 1154/1164 looper letters, 257 selfloop transitions, 16 changer transitions 0/397 dead transitions. [2023-08-29 03:41:45,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 397 transitions, 1546 flow [2023-08-29 03:41:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 03:41:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 03:41:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6689 transitions. [2023-08-29 03:41:45,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4788802978235968 [2023-08-29 03:41:45,590 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 6689 transitions. [2023-08-29 03:41:45,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 6689 transitions. [2023-08-29 03:41:45,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:41:45,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 6689 transitions. [2023-08-29 03:41:45,599 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-29 03:41:45,613 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-29 03:41:45,615 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-29 03:41:45,615 INFO L175 Difference]: Start difference. First operand has 185 places, 188 transitions, 431 flow. Second operand 12 states and 6689 transitions. [2023-08-29 03:41:45,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 397 transitions, 1546 flow [2023-08-29 03:41:45,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 397 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 03:41:45,769 INFO L231 Difference]: Finished difference. Result has 199 places, 200 transitions, 533 flow [2023-08-29 03:41:45,770 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-29 03:41:45,770 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -43 predicate places. [2023-08-29 03:41:45,770 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 200 transitions, 533 flow [2023-08-29 03:41:45,771 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-29 03:41:45,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:45,771 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-29 03:41:45,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-29 03:41:45,972 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-29 03:41:45,972 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-29 03:41:45,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1997496372, now seen corresponding path program 1 times [2023-08-29 03:41:45,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:45,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870446179] [2023-08-29 03:41:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:45,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:46,021 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-29 03:41:46,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:46,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870446179] [2023-08-29 03:41:46,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870446179] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:41:46,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:41:46,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 03:41:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413075928] [2023-08-29 03:41:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:41:46,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:41:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:46,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:41:46,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:41:46,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 03:41:46,033 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-29 03:41:46,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:46,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 03:41:46,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:41:48,584 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-29 03:41:48,584 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-29 03:41:48,584 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 03:41:48,584 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:48,584 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-29 03:41:48,853 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-29 03:41:48,853 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 03:41:48,853 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:48,853 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:48,854 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:41:48,860 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-29 03:41:48,861 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 03:41:48,861 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:41:48,861 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:48,861 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:48,936 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-29 03:41:48,936 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 03:41:48,936 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:41:48,936 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:48,936 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:48,948 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-29 03:41:48,948 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 03:41:48,948 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:41:48,948 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:48,948 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:49,029 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-29 03:41:49,029 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:41:49,029 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:49,029 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:41:49,029 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:49,030 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-29 03:41:49,030 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:41:49,030 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:49,030 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:41:49,030 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:49,094 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-29 03:41:49,095 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:41:49,095 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:49,095 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:41:49,095 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:49,103 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-29 03:41:49,103 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:41:49,103 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:41:49,103 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:49,103 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:49,153 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-29 03:41:49,153 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:41:49,154 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:49,154 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:49,154 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:41:49,169 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-29 03:41:49,169 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:41:49,169 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:49,170 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:41:49,170 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:49,170 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-29 03:41:49,170 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:41:49,170 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:49,170 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:49,170 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:41:49,232 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-29 03:41:49,232 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:41:49,233 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:41:49,233 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:49,233 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:49,233 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-29 03:41:49,233 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:41:49,233 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:49,233 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:41:49,233 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:49,234 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-29 03:41:49,234 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 03:41:49,234 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:41:49,234 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:41:49,234 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 03:41:49,234 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-29 03:41:49,234 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:41:49,234 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:49,234 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:49,234 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:41:49,235 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-29 03:41:49,235 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:41:49,235 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:49,235 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:41:49,235 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:50,194 INFO L130 PetriNetUnfolder]: 18668/47019 cut-off events. [2023-08-29 03:41:50,194 INFO L131 PetriNetUnfolder]: For 8219/9505 co-relation queries the response was YES. [2023-08-29 03:41:50,327 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-29 03:41:50,457 INFO L137 encePairwiseOnDemand]: 1162/1164 looper letters, 104 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2023-08-29 03:41:50,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 233 transitions, 820 flow [2023-08-29 03:41:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:41:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:41:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2023-08-29 03:41:50,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048682703321878 [2023-08-29 03:41:50,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2023-08-29 03:41:50,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2023-08-29 03:41:50,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:41:50,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2023-08-29 03:41:50,464 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-29 03:41:50,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-29 03:41:50,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-29 03:41:50,467 INFO L175 Difference]: Start difference. First operand has 199 places, 200 transitions, 533 flow. Second operand 3 states and 1763 transitions. [2023-08-29 03:41:50,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 233 transitions, 820 flow [2023-08-29 03:41:50,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 233 transitions, 804 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-29 03:41:50,490 INFO L231 Difference]: Finished difference. Result has 201 places, 199 transitions, 521 flow [2023-08-29 03:41:50,490 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-29 03:41:50,491 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -41 predicate places. [2023-08-29 03:41:50,491 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 199 transitions, 521 flow [2023-08-29 03:41:50,492 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-29 03:41:50,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:50,492 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-29 03:41:50,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 03:41:50,492 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-29 03:41:50,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash -522161326, now seen corresponding path program 1 times [2023-08-29 03:41:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253850047] [2023-08-29 03:41:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:50,891 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-29 03:41:50,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253850047] [2023-08-29 03:41:50,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253850047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:41:50,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:41:50,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:41:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562699671] [2023-08-29 03:41:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:41:50,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:41:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:50,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:41:50,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:41:51,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-29 03:41:51,531 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-29 03:41:51,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:51,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-29 03:41:51,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:41:55,483 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-29 03:41:55,484 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-29 03:41:55,484 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 03:41:55,484 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:55,484 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-29 03:41:55,693 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-29 03:41:55,693 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 03:41:55,693 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:41:55,693 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:55,693 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:41:55,865 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-29 03:41:55,865 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 03:41:55,865 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:55,865 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:41:55,865 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:41:55,927 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-29 03:41:55,928 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 03:41:55,928 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:41:55,928 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:55,928 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:41:56,006 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-29 03:41:56,006 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 03:41:56,006 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:56,006 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:41:56,006 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:41:56,072 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-29 03:41:56,072 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:41:56,072 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:56,073 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:56,073 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:41:56,073 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-29 03:41:56,073 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:41:56,073 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:41:56,073 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:41:56,073 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:41:56,131 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-29 03:41:56,131 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:41:56,131 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:56,131 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:41:56,131 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:56,138 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-29 03:41:56,139 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:41:56,139 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:41:56,139 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:41:56,139 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:41:56,186 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-29 03:41:56,187 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:41:56,187 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:56,187 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:56,187 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:41:56,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, 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-29 03:41:56,199 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:41:56,199 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:56,199 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:41:56,199 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:56,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], [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-29 03:41:56,200 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:41:56,200 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:41:56,200 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:41:56,200 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:41:56,257 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-29 03:41:56,258 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:41:56,258 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:56,258 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:56,258 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:41:56,258 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-29 03:41:56,258 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:41:56,258 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:56,258 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:41:56,258 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:56,258 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-29 03:41:56,258 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 03:41:56,258 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 03:41:56,258 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:41:56,259 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:41:56,259 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-29 03:41:56,259 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:41:56,259 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:56,259 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:41:56,259 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:56,259 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-29 03:41:56,259 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:41:56,259 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:41:56,259 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:41:56,259 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:41:57,410 INFO L130 PetriNetUnfolder]: 27215/53188 cut-off events. [2023-08-29 03:41:57,410 INFO L131 PetriNetUnfolder]: For 20693/22605 co-relation queries the response was YES. [2023-08-29 03:41:57,561 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-29 03:41:57,715 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 191 selfloop transitions, 5 changer transitions 0/313 dead transitions. [2023-08-29 03:41:57,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 313 transitions, 1257 flow [2023-08-29 03:41:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:41:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:41:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3356 transitions. [2023-08-29 03:41:57,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805269186712486 [2023-08-29 03:41:57,721 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3356 transitions. [2023-08-29 03:41:57,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3356 transitions. [2023-08-29 03:41:57,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:41:57,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3356 transitions. [2023-08-29 03:41:57,726 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-29 03:41:57,729 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-29 03:41:57,730 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-29 03:41:57,730 INFO L175 Difference]: Start difference. First operand has 201 places, 199 transitions, 521 flow. Second operand 6 states and 3356 transitions. [2023-08-29 03:41:57,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 313 transitions, 1257 flow [2023-08-29 03:41:57,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 313 transitions, 1247 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:41:57,811 INFO L231 Difference]: Finished difference. Result has 203 places, 197 transitions, 525 flow [2023-08-29 03:41:57,811 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-29 03:41:57,812 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -39 predicate places. [2023-08-29 03:41:57,812 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 197 transitions, 525 flow [2023-08-29 03:41:57,812 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-29 03:41:57,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:41:57,812 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-29 03:41:57,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 03:41:57,812 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-29 03:41:57,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:41:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2133869231, now seen corresponding path program 2 times [2023-08-29 03:41:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:41:57,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811240241] [2023-08-29 03:41:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:41:57,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:41:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:41:58,188 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-29 03:41:58,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:41:58,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811240241] [2023-08-29 03:41:58,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811240241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:41:58,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:41:58,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:41:58,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290961518] [2023-08-29 03:41:58,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:41:58,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:41:58,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:41:58,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:41:58,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:41:58,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-29 03:41:58,957 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-29 03:41:58,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:41:58,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-29 03:41:58,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:03,688 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-29 03:42:03,688 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 03:42:03,688 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:42:03,688 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:42:03,688 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:42:03,896 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-29 03:42:03,896 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 03:42:03,896 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:42:03,896 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:42:03,896 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:42:03,903 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-29 03:42:03,903 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 03:42:03,903 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:42:03,903 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:42:03,904 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:42:04,044 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-29 03:42:04,044 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:42:04,044 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:42:04,044 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:42:04,044 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:42:04,060 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-29 03:42:04,060 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:42:04,060 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:42:04,060 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:42:04,061 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:42:04,061 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-29 03:42:04,061 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:42:04,061 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:42:04,061 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:42:04,061 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:42:04,123 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-29 03:42:04,123 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:42:04,123 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:42:04,123 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:42:04,123 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:42:04,132 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-29 03:42:04,132 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:42:04,132 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:42:04,132 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:42:04,133 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:42:04,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][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-29 03:42:04,333 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:42:04,333 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:42:04,334 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:04,334 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:42:04,357 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-29 03:42:04,357 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:42:04,358 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:42:04,358 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:04,358 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:42:04,358 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-29 03:42:04,358 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:42:04,358 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:04,358 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:42:04,358 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:42:04,445 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-29 03:42:04,445 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:42:04,445 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:04,445 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:42:04,445 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:42:04,446 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-29 03:42:04,446 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:42:04,446 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:04,446 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:42:04,446 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:42:05,687 INFO L130 PetriNetUnfolder]: 30875/67624 cut-off events. [2023-08-29 03:42:05,687 INFO L131 PetriNetUnfolder]: For 16133/16133 co-relation queries the response was YES. [2023-08-29 03:42:05,946 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-29 03:42:06,259 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 215 selfloop transitions, 5 changer transitions 0/331 dead transitions. [2023-08-29 03:42:06,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 331 transitions, 1313 flow [2023-08-29 03:42:06,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:42:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:42:06,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3382 transitions. [2023-08-29 03:42:06,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48424971363115693 [2023-08-29 03:42:06,267 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3382 transitions. [2023-08-29 03:42:06,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3382 transitions. [2023-08-29 03:42:06,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:06,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3382 transitions. [2023-08-29 03:42:06,273 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-29 03:42:06,276 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-29 03:42:06,277 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-29 03:42:06,277 INFO L175 Difference]: Start difference. First operand has 203 places, 197 transitions, 525 flow. Second operand 6 states and 3382 transitions. [2023-08-29 03:42:06,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 331 transitions, 1313 flow [2023-08-29 03:42:06,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 331 transitions, 1295 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 03:42:06,326 INFO L231 Difference]: Finished difference. Result has 201 places, 195 transitions, 521 flow [2023-08-29 03:42:06,326 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-29 03:42:06,327 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -41 predicate places. [2023-08-29 03:42:06,327 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 195 transitions, 521 flow [2023-08-29 03:42:06,327 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-29 03:42:06,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:06,328 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-29 03:42:06,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 03:42:06,328 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-29 03:42:06,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:06,328 INFO L85 PathProgramCache]: Analyzing trace with hash 714604569, now seen corresponding path program 1 times [2023-08-29 03:42:06,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:06,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722962609] [2023-08-29 03:42:06,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:06,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:06,385 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-29 03:42:06,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:06,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722962609] [2023-08-29 03:42:06,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722962609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:06,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:06,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 03:42:06,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737064071] [2023-08-29 03:42:06,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:06,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:42:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:42:06,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:42:06,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 03:42:06,396 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-29 03:42:06,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:06,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 03:42:06,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:09,128 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-29 03:42:09,128 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-29 03:42:09,128 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 03:42:09,128 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-29 03:42:09,128 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:42:09,205 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-29 03:42:09,205 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 03:42:09,205 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:42:09,205 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:42:09,205 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:42:09,212 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-29 03:42:09,212 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 03:42:09,212 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:42:09,212 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:42:09,212 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:42:09,301 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-29 03:42:09,301 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 03:42:09,301 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:42:09,302 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:42:09,302 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:42:09,315 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-29 03:42:09,315 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 03:42:09,315 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:42:09,315 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:42:09,315 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:42:09,601 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-29 03:42:09,601 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:42:09,601 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:42:09,601 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:42:09,601 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:42:09,601 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-29 03:42:09,601 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:42:09,601 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:42:09,602 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:42:09,602 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:42:09,661 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-29 03:42:09,661 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:42:09,661 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:42:09,661 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:42:09,661 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:42:09,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], [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-29 03:42:09,671 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:42:09,671 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:42:09,671 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:42:09,671 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:42:09,720 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-29 03:42:09,720 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:42:09,720 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:09,720 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:42:09,720 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:42:09,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][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-29 03:42:09,735 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:42:09,735 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:42:09,735 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:42:09,735 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:09,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][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-29 03:42:09,735 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:42:09,736 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:09,736 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:42:09,736 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:42:09,798 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-29 03:42:09,798 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:42:09,798 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:42:09,798 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:09,798 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:42:09,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, 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-29 03:42:09,799 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 03:42:09,799 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:42:09,799 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:42:09,799 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 03:42:09,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, 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-29 03:42:09,799 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:42:09,799 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:09,800 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:42:09,800 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:42:09,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, 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-29 03:42:09,800 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:42:09,800 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:42:09,800 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:42:09,800 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:09,801 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-29 03:42:09,801 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:42:09,801 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:09,801 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:42:09,801 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:42:11,417 INFO L130 PetriNetUnfolder]: 22940/56634 cut-off events. [2023-08-29 03:42:11,417 INFO L131 PetriNetUnfolder]: For 13840/15438 co-relation queries the response was YES. [2023-08-29 03:42:11,606 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-29 03:42:11,762 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 102 selfloop transitions, 3 changer transitions 0/228 dead transitions. [2023-08-29 03:42:11,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 228 transitions, 826 flow [2023-08-29 03:42:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:42:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:42:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2023-08-29 03:42:11,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042955326460481 [2023-08-29 03:42:11,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1761 transitions. [2023-08-29 03:42:11,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1761 transitions. [2023-08-29 03:42:11,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:11,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1761 transitions. [2023-08-29 03:42:11,768 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-29 03:42:11,770 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-29 03:42:11,770 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-29 03:42:11,770 INFO L175 Difference]: Start difference. First operand has 201 places, 195 transitions, 521 flow. Second operand 3 states and 1761 transitions. [2023-08-29 03:42:11,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 228 transitions, 826 flow [2023-08-29 03:42:11,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 228 transitions, 814 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 03:42:11,806 INFO L231 Difference]: Finished difference. Result has 200 places, 197 transitions, 533 flow [2023-08-29 03:42:11,806 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-29 03:42:11,807 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -42 predicate places. [2023-08-29 03:42:11,807 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 197 transitions, 533 flow [2023-08-29 03:42:11,807 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-29 03:42:11,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:11,808 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-29 03:42:11,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 03:42:11,808 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-29 03:42:11,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1949526157, now seen corresponding path program 1 times [2023-08-29 03:42:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:11,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439942644] [2023-08-29 03:42:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:11,854 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-29 03:42:11,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:11,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439942644] [2023-08-29 03:42:11,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439942644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:11,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:11,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 03:42:11,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241488487] [2023-08-29 03:42:11,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:11,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:42:11,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:11,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:42:11,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:42:11,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 03:42:11,864 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-29 03:42:11,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:11,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 03:42:11,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:14,954 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-29 03:42:14,954 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-29 03:42:14,955 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 03:42:14,955 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-29 03:42:14,955 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:42:15,047 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-29 03:42:15,047 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 03:42:15,047 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 03:42:15,047 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:42:15,047 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:42:15,054 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-29 03:42:15,054 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 03:42:15,055 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:42:15,055 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:42:15,055 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 03:42:15,149 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-29 03:42:15,149 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 03:42:15,149 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 03:42:15,149 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:42:15,149 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:42:15,164 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-29 03:42:15,164 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 03:42:15,164 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 03:42:15,164 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:42:15,164 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:42:15,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][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-29 03:42:15,269 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:42:15,269 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:42:15,270 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:42:15,270 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:42:15,270 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-29 03:42:15,270 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:42:15,270 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 03:42:15,270 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:42:15,270 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:42:15,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, 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-29 03:42:15,390 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:42:15,390 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:42:15,390 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:42:15,390 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:42:15,399 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-29 03:42:15,399 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:42:15,399 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:42:15,399 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 03:42:15,399 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:42:15,465 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-29 03:42:15,466 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:42:15,466 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:42:15,466 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:15,466 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:42:15,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][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-29 03:42:15,484 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:42:15,484 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:42:15,485 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:42:15,485 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:15,485 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-29 03:42:15,485 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:42:15,485 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:15,485 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 03:42:15,485 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:42:15,567 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-29 03:42:15,567 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:42:15,567 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:42:15,567 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:15,567 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:42:15,567 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-29 03:42:15,567 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:42:15,567 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:15,568 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:42:15,568 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:42:15,568 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-29 03:42:15,568 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:42:15,568 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:42:15,568 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:15,568 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:42:15,568 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-29 03:42:15,568 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 03:42:15,568 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:42:15,568 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 03:42:15,568 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:42:15,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][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-29 03:42:15,569 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:42:15,569 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:15,569 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 03:42:15,569 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:42:18,453 INFO L130 PetriNetUnfolder]: 27259/72619 cut-off events. [2023-08-29 03:42:18,454 INFO L131 PetriNetUnfolder]: For 19984/21585 co-relation queries the response was YES. [2023-08-29 03:42:18,759 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-29 03:42:19,137 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 110 selfloop transitions, 3 changer transitions 0/236 dead transitions. [2023-08-29 03:42:19,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 236 transitions, 873 flow [2023-08-29 03:42:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:42:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:42:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1766 transitions. [2023-08-29 03:42:19,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057273768613975 [2023-08-29 03:42:19,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1766 transitions. [2023-08-29 03:42:19,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1766 transitions. [2023-08-29 03:42:19,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:19,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1766 transitions. [2023-08-29 03:42:19,143 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-29 03:42:19,145 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-29 03:42:19,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-29 03:42:19,146 INFO L175 Difference]: Start difference. First operand has 200 places, 197 transitions, 533 flow. Second operand 3 states and 1766 transitions. [2023-08-29 03:42:19,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 236 transitions, 873 flow [2023-08-29 03:42:19,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 236 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 03:42:19,260 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 549 flow [2023-08-29 03:42:19,260 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-29 03:42:19,261 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -40 predicate places. [2023-08-29 03:42:19,261 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 549 flow [2023-08-29 03:42:19,261 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-29 03:42:19,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:19,261 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-29 03:42:19,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 03:42:19,262 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-29 03:42:19,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:19,262 INFO L85 PathProgramCache]: Analyzing trace with hash -933145270, now seen corresponding path program 1 times [2023-08-29 03:42:19,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:19,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471444439] [2023-08-29 03:42:19,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:19,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:19,386 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-29 03:42:19,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:19,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471444439] [2023-08-29 03:42:19,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471444439] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:42:19,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235005512] [2023-08-29 03:42:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:42:19,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:42:19,388 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-29 03:42:19,402 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-29 03:42:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:19,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 03:42:19,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:42:19,605 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-29 03:42:19,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:42:19,634 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-29 03:42:19,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235005512] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 03:42:19,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 03:42:19,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-29 03:42:19,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760913124] [2023-08-29 03:42:19,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:19,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 03:42:19,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:19,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 03:42:19,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-29 03:42:19,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 538 out of 1164 [2023-08-29 03:42:19,831 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-29 03:42:19,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:19,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 538 of 1164 [2023-08-29 03:42:19,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:26,961 INFO L130 PetriNetUnfolder]: 27752/76157 cut-off events. [2023-08-29 03:42:26,962 INFO L131 PetriNetUnfolder]: For 23952/25632 co-relation queries the response was YES. [2023-08-29 03:42:27,277 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-29 03:42:27,485 INFO L137 encePairwiseOnDemand]: 1158/1164 looper letters, 111 selfloop transitions, 5 changer transitions 0/238 dead transitions. [2023-08-29 03:42:27,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 238 transitions, 902 flow [2023-08-29 03:42:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 03:42:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 03:42:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2785 transitions. [2023-08-29 03:42:27,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47852233676975947 [2023-08-29 03:42:27,489 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2785 transitions. [2023-08-29 03:42:27,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2785 transitions. [2023-08-29 03:42:27,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:27,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2785 transitions. [2023-08-29 03:42:27,493 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-29 03:42:27,497 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-29 03:42:27,498 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-29 03:42:27,498 INFO L175 Difference]: Start difference. First operand has 202 places, 199 transitions, 549 flow. Second operand 5 states and 2785 transitions. [2023-08-29 03:42:27,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 238 transitions, 902 flow [2023-08-29 03:42:27,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 238 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 03:42:27,801 INFO L231 Difference]: Finished difference. Result has 206 places, 200 transitions, 568 flow [2023-08-29 03:42:27,801 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-29 03:42:27,801 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -36 predicate places. [2023-08-29 03:42:27,801 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 568 flow [2023-08-29 03:42:27,802 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-29 03:42:27,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:27,802 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-29 03:42:27,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-29 03:42:28,002 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-29 03:42:28,002 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-29 03:42:28,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash 677930533, now seen corresponding path program 1 times [2023-08-29 03:42:28,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:28,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951693918] [2023-08-29 03:42:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:28,054 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-29 03:42:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:28,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951693918] [2023-08-29 03:42:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951693918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:28,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:28,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 03:42:28,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119726049] [2023-08-29 03:42:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:28,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:42:28,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:28,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:42:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:42:28,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 03:42:28,065 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-29 03:42:28,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:28,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 03:42:28,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:33,748 INFO L130 PetriNetUnfolder]: 23471/58266 cut-off events. [2023-08-29 03:42:33,749 INFO L131 PetriNetUnfolder]: For 25661/28434 co-relation queries the response was YES. [2023-08-29 03:42:34,001 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-29 03:42:34,359 INFO L137 encePairwiseOnDemand]: 1162/1164 looper letters, 106 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2023-08-29 03:42:34,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 231 transitions, 897 flow [2023-08-29 03:42:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:42:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:42:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1757 transitions. [2023-08-29 03:42:34,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031500572737686 [2023-08-29 03:42:34,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1757 transitions. [2023-08-29 03:42:34,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1757 transitions. [2023-08-29 03:42:34,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:34,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1757 transitions. [2023-08-29 03:42:34,365 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-29 03:42:34,368 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-29 03:42:34,368 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-29 03:42:34,369 INFO L175 Difference]: Start difference. First operand has 206 places, 200 transitions, 568 flow. Second operand 3 states and 1757 transitions. [2023-08-29 03:42:34,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 231 transitions, 897 flow [2023-08-29 03:42:34,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 231 transitions, 887 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 03:42:34,540 INFO L231 Difference]: Finished difference. Result has 207 places, 199 transitions, 564 flow [2023-08-29 03:42:34,540 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-29 03:42:34,540 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -35 predicate places. [2023-08-29 03:42:34,540 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 199 transitions, 564 flow [2023-08-29 03:42:34,541 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-29 03:42:34,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:34,541 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-29 03:42:34,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 03:42:34,541 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-29 03:42:34,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash 305892674, now seen corresponding path program 1 times [2023-08-29 03:42:34,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:34,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537989222] [2023-08-29 03:42:34,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:34,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:34,596 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-29 03:42:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:34,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537989222] [2023-08-29 03:42:34,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537989222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:34,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:34,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 03:42:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836232835] [2023-08-29 03:42:34,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:34,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:42:34,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:34,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:42:34,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:42:34,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 03:42:34,606 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-29 03:42:34,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:34,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 03:42:34,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:40,079 INFO L130 PetriNetUnfolder]: 21742/53160 cut-off events. [2023-08-29 03:42:40,079 INFO L131 PetriNetUnfolder]: For 27678/30381 co-relation queries the response was YES. [2023-08-29 03:42:40,300 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-29 03:42:40,456 INFO L137 encePairwiseOnDemand]: 1162/1164 looper letters, 109 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2023-08-29 03:42:40,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 234 transitions, 900 flow [2023-08-29 03:42:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:42:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:42:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2023-08-29 03:42:40,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048682703321878 [2023-08-29 03:42:40,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2023-08-29 03:42:40,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2023-08-29 03:42:40,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:40,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2023-08-29 03:42:40,463 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-29 03:42:40,466 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-29 03:42:40,466 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-29 03:42:40,466 INFO L175 Difference]: Start difference. First operand has 207 places, 199 transitions, 564 flow. Second operand 3 states and 1763 transitions. [2023-08-29 03:42:40,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 234 transitions, 900 flow [2023-08-29 03:42:40,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 234 transitions, 894 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 03:42:40,717 INFO L231 Difference]: Finished difference. Result has 209 places, 198 transitions, 564 flow [2023-08-29 03:42:40,717 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-29 03:42:40,718 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -33 predicate places. [2023-08-29 03:42:40,718 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 198 transitions, 564 flow [2023-08-29 03:42:40,718 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-29 03:42:40,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:40,718 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-29 03:42:40,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 03:42:40,719 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-29 03:42:40,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:40,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1960279651, now seen corresponding path program 1 times [2023-08-29 03:42:40,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:40,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349522893] [2023-08-29 03:42:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:40,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:40,755 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-29 03:42:40,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:40,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349522893] [2023-08-29 03:42:40,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349522893] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:40,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:40,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:42:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477006423] [2023-08-29 03:42:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:40,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:42:40,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:42:40,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:42:40,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 1164 [2023-08-29 03:42:40,776 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-29 03:42:40,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:40,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 1164 [2023-08-29 03:42:40,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:46,888 INFO L130 PetriNetUnfolder]: 26021/62543 cut-off events. [2023-08-29 03:42:46,888 INFO L131 PetriNetUnfolder]: For 31861/34905 co-relation queries the response was YES. [2023-08-29 03:42:47,163 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-29 03:42:47,336 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 76 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2023-08-29 03:42:47,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 195 transitions, 714 flow [2023-08-29 03:42:47,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:42:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:42:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1693 transitions. [2023-08-29 03:42:47,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4848224513172967 [2023-08-29 03:42:47,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1693 transitions. [2023-08-29 03:42:47,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1693 transitions. [2023-08-29 03:42:47,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:47,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1693 transitions. [2023-08-29 03:42:47,340 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-29 03:42:47,343 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-29 03:42:47,343 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-29 03:42:47,343 INFO L175 Difference]: Start difference. First operand has 209 places, 198 transitions, 564 flow. Second operand 3 states and 1693 transitions. [2023-08-29 03:42:47,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 195 transitions, 714 flow [2023-08-29 03:42:47,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 195 transitions, 712 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:42:47,955 INFO L231 Difference]: Finished difference. Result has 207 places, 195 transitions, 560 flow [2023-08-29 03:42:47,955 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-29 03:42:47,955 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -35 predicate places. [2023-08-29 03:42:47,955 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 195 transitions, 560 flow [2023-08-29 03:42:47,956 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-29 03:42:47,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:47,956 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-29 03:42:47,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 03:42:47,956 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-29 03:42:47,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1662410549, now seen corresponding path program 1 times [2023-08-29 03:42:47,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:47,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040696702] [2023-08-29 03:42:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:47,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:47,995 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-29 03:42:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:47,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040696702] [2023-08-29 03:42:47,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040696702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:47,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:47,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:42:47,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745539773] [2023-08-29 03:42:47,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:47,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:42:47,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:47,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:42:47,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:42:48,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 1164 [2023-08-29 03:42:48,016 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-29 03:42:48,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:48,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 1164 [2023-08-29 03:42:48,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:55,195 INFO L130 PetriNetUnfolder]: 33826/73303 cut-off events. [2023-08-29 03:42:55,195 INFO L131 PetriNetUnfolder]: For 38933/43007 co-relation queries the response was YES. [2023-08-29 03:42:55,528 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-29 03:42:55,739 INFO L137 encePairwiseOnDemand]: 1155/1164 looper letters, 110 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2023-08-29 03:42:55,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 222 transitions, 891 flow [2023-08-29 03:42:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:42:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:42:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1727 transitions. [2023-08-29 03:42:55,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945589919816724 [2023-08-29 03:42:55,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1727 transitions. [2023-08-29 03:42:55,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1727 transitions. [2023-08-29 03:42:55,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:55,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1727 transitions. [2023-08-29 03:42:55,744 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-29 03:42:55,745 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-29 03:42:55,745 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-29 03:42:55,745 INFO L175 Difference]: Start difference. First operand has 207 places, 195 transitions, 560 flow. Second operand 3 states and 1727 transitions. [2023-08-29 03:42:55,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 222 transitions, 891 flow [2023-08-29 03:42:55,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 222 transitions, 889 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:42:55,949 INFO L231 Difference]: Finished difference. Result has 203 places, 192 transitions, 573 flow [2023-08-29 03:42:55,950 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-29 03:42:55,950 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -39 predicate places. [2023-08-29 03:42:55,950 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 192 transitions, 573 flow [2023-08-29 03:42:55,950 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-29 03:42:55,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:55,950 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-29 03:42:55,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 03:42:55,951 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-29 03:42:55,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1321343099, now seen corresponding path program 1 times [2023-08-29 03:42:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:55,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975992302] [2023-08-29 03:42:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:56,118 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-29 03:42:56,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:56,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975992302] [2023-08-29 03:42:56,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975992302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:56,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:56,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 03:42:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175872371] [2023-08-29 03:42:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:56,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 03:42:56,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 03:42:56,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 03:42:56,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 1164 [2023-08-29 03:42:56,747 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-29 03:42:56,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:56,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 1164 [2023-08-29 03:42:56,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:43:18,888 INFO L130 PetriNetUnfolder]: 82021/178315 cut-off events. [2023-08-29 03:43:18,888 INFO L131 PetriNetUnfolder]: For 97794/103459 co-relation queries the response was YES. [2023-08-29 03:43:19,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380488 conditions, 178315 events. 82021/178315 cut-off events. For 97794/103459 co-relation queries the response was YES. Maximal size of possible extension queue 4256. Compared 2237673 event pairs, 38345 based on Foata normal form. 5326/175092 useless extension candidates. Maximal degree in co-relation 380469. Up to 35177 conditions per place. [2023-08-29 03:43:20,515 INFO L137 encePairwiseOnDemand]: 1151/1164 looper letters, 467 selfloop transitions, 27 changer transitions 0/605 dead transitions. [2023-08-29 03:43:20,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 605 transitions, 2983 flow [2023-08-29 03:43:20,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-29 03:43:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-29 03:43:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 7927 transitions. [2023-08-29 03:43:20,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48643838978890525 [2023-08-29 03:43:20,528 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 7927 transitions. [2023-08-29 03:43:20,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 7927 transitions. [2023-08-29 03:43:20,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:43:20,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 7927 transitions. [2023-08-29 03:43:20,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 566.2142857142857) internal successors, (7927), 14 states have internal predecessors, (7927), 0 states have call successors, (0), 0 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-29 03:43:20,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 1164.0) internal successors, (17460), 15 states have internal predecessors, (17460), 0 states have call successors, (0), 0 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-29 03:43:20,546 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 1164.0) internal successors, (17460), 15 states have internal predecessors, (17460), 0 states have call successors, (0), 0 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-29 03:43:20,546 INFO L175 Difference]: Start difference. First operand has 203 places, 192 transitions, 573 flow. Second operand 14 states and 7927 transitions. [2023-08-29 03:43:20,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 605 transitions, 2983 flow [2023-08-29 03:43:28,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 605 transitions, 2983 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:43:28,678 INFO L231 Difference]: Finished difference. Result has 226 places, 216 transitions, 782 flow [2023-08-29 03:43:28,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=782, PETRI_PLACES=226, PETRI_TRANSITIONS=216} [2023-08-29 03:43:28,679 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -16 predicate places. [2023-08-29 03:43:28,679 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 216 transitions, 782 flow [2023-08-29 03:43:28,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-29 03:43:28,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:43:28,680 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, 1] [2023-08-29 03:43:28,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 03:43:28,680 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-29 03:43:28,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:43:28,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2009704277, now seen corresponding path program 1 times [2023-08-29 03:43:28,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:43:28,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221522877] [2023-08-29 03:43:28,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:43:28,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:43:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:43:29,003 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-29 03:43:29,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:43:29,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221522877] [2023-08-29 03:43:29,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221522877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:43:29,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:43:29,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:43:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689055572] [2023-08-29 03:43:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:43:29,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:43:29,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:43:29,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:43:29,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:43:29,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-29 03:43:29,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 216 transitions, 782 flow. Second operand has 6 states, 6 states have (on average 533.0) internal successors, (3198), 6 states have internal predecessors, (3198), 0 states have call successors, (0), 0 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-29 03:43:29,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:43:29,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-29 03:43:29,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:43:55,325 INFO L130 PetriNetUnfolder]: 100817/199713 cut-off events. [2023-08-29 03:43:55,325 INFO L131 PetriNetUnfolder]: For 187190/196292 co-relation queries the response was YES. [2023-08-29 03:43:57,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472547 conditions, 199713 events. 100817/199713 cut-off events. For 187190/196292 co-relation queries the response was YES. Maximal size of possible extension queue 5011. Compared 2385508 event pairs, 47859 based on Foata normal form. 6250/196541 useless extension candidates. Maximal degree in co-relation 472518. Up to 89713 conditions per place. [2023-08-29 03:43:58,171 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 249 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2023-08-29 03:43:58,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 358 transitions, 1794 flow [2023-08-29 03:43:58,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:43:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:43:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3382 transitions. [2023-08-29 03:43:58,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48424971363115693 [2023-08-29 03:43:58,177 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3382 transitions. [2023-08-29 03:43:58,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3382 transitions. [2023-08-29 03:43:58,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:43:58,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3382 transitions. [2023-08-29 03:43:58,181 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-29 03:43:58,184 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-29 03:43:58,185 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-29 03:43:58,185 INFO L175 Difference]: Start difference. First operand has 226 places, 216 transitions, 782 flow. Second operand 6 states and 3382 transitions. [2023-08-29 03:43:58,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 358 transitions, 1794 flow [2023-08-29 03:44:00,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 358 transitions, 1791 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:44:00,705 INFO L231 Difference]: Finished difference. Result has 228 places, 214 transitions, 785 flow [2023-08-29 03:44:00,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=785, PETRI_PLACES=228, PETRI_TRANSITIONS=214} [2023-08-29 03:44:00,705 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -14 predicate places. [2023-08-29 03:44:00,705 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 214 transitions, 785 flow [2023-08-29 03:44:00,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 533.0) internal successors, (3198), 6 states have internal predecessors, (3198), 0 states have call successors, (0), 0 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-29 03:44:00,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:44:00,706 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, 1, 1] [2023-08-29 03:44:00,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 03:44:00,706 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-29 03:44:00,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:44:00,706 INFO L85 PathProgramCache]: Analyzing trace with hash 497589136, now seen corresponding path program 1 times [2023-08-29 03:44:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:44:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889724338] [2023-08-29 03:44:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:44:00,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:44:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:44:00,894 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-29 03:44:00,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:44:00,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889724338] [2023-08-29 03:44:00,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889724338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:44:00,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:44:00,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 03:44:00,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732331749] [2023-08-29 03:44:00,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:44:00,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 03:44:00,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:44:00,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 03:44:00,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-29 03:44:01,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 1164 [2023-08-29 03:44:01,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 214 transitions, 785 flow. Second operand has 9 states, 9 states have (on average 533.2222222222222) internal successors, (4799), 9 states have internal predecessors, (4799), 0 states have call successors, (0), 0 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-29 03:44:01,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:44:01,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 1164 [2023-08-29 03:44:01,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:44:20,030 INFO L130 PetriNetUnfolder]: 59355/130753 cut-off events. [2023-08-29 03:44:20,030 INFO L131 PetriNetUnfolder]: For 139784/148586 co-relation queries the response was YES. [2023-08-29 03:44:21,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313804 conditions, 130753 events. 59355/130753 cut-off events. For 139784/148586 co-relation queries the response was YES. Maximal size of possible extension queue 3305. Compared 1619470 event pairs, 25499 based on Foata normal form. 7880/132453 useless extension candidates. Maximal degree in co-relation 313774. Up to 29365 conditions per place. [2023-08-29 03:44:21,867 INFO L137 encePairwiseOnDemand]: 1152/1164 looper letters, 428 selfloop transitions, 15 changer transitions 0/557 dead transitions. [2023-08-29 03:44:21,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 557 transitions, 3330 flow [2023-08-29 03:44:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 03:44:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 03:44:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7226 transitions. [2023-08-29 03:44:21,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47753106000528683 [2023-08-29 03:44:21,875 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 7226 transitions. [2023-08-29 03:44:21,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 7226 transitions. [2023-08-29 03:44:21,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:44:21,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 7226 transitions. [2023-08-29 03:44:21,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 555.8461538461538) internal successors, (7226), 13 states have internal predecessors, (7226), 0 states have call successors, (0), 0 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-29 03:44:21,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 1164.0) internal successors, (16296), 14 states have internal predecessors, (16296), 0 states have call successors, (0), 0 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-29 03:44:21,894 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 1164.0) internal successors, (16296), 14 states have internal predecessors, (16296), 0 states have call successors, (0), 0 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-29 03:44:21,894 INFO L175 Difference]: Start difference. First operand has 228 places, 214 transitions, 785 flow. Second operand 13 states and 7226 transitions. [2023-08-29 03:44:21,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 557 transitions, 3330 flow [2023-08-29 03:44:25,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 557 transitions, 3302 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 03:44:25,433 INFO L231 Difference]: Finished difference. Result has 242 places, 221 transitions, 859 flow [2023-08-29 03:44:25,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=859, PETRI_PLACES=242, PETRI_TRANSITIONS=221} [2023-08-29 03:44:25,434 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, 0 predicate places. [2023-08-29 03:44:25,434 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 221 transitions, 859 flow [2023-08-29 03:44:25,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 533.2222222222222) internal successors, (4799), 9 states have internal predecessors, (4799), 0 states have call successors, (0), 0 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-29 03:44:25,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:44:25,435 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, 1, 1, 1, 1] [2023-08-29 03:44:25,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 03:44:25,435 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-29 03:44:25,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:44:25,435 INFO L85 PathProgramCache]: Analyzing trace with hash 751981737, now seen corresponding path program 1 times [2023-08-29 03:44:25,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:44:25,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490809465] [2023-08-29 03:44:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:44:25,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:44:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:44:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 03:44:25,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:44:25,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490809465] [2023-08-29 03:44:25,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490809465] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:44:25,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:44:25,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:44:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323198642] [2023-08-29 03:44:25,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:44:25,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:44:25,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:44:25,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:44:25,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:44:26,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-29 03:44:26,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 221 transitions, 859 flow. Second operand has 6 states, 6 states have (on average 534.3333333333334) internal successors, (3206), 6 states have internal predecessors, (3206), 0 states have call successors, (0), 0 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-29 03:44:26,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:44:26,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-29 03:44:26,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:44:46,373 INFO L130 PetriNetUnfolder]: 67672/146458 cut-off events. [2023-08-29 03:44:46,373 INFO L131 PetriNetUnfolder]: For 180662/190263 co-relation queries the response was YES. [2023-08-29 03:44:47,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368689 conditions, 146458 events. 67672/146458 cut-off events. For 180662/190263 co-relation queries the response was YES. Maximal size of possible extension queue 3671. Compared 1825863 event pairs, 42431 based on Foata normal form. 7370/146580 useless extension candidates. Maximal degree in co-relation 368653. Up to 75494 conditions per place. [2023-08-29 03:44:48,424 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 234 selfloop transitions, 5 changer transitions 0/343 dead transitions. [2023-08-29 03:44:48,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 343 transitions, 1873 flow [2023-08-29 03:44:48,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:44:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:44:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3356 transitions. [2023-08-29 03:44:48,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805269186712486 [2023-08-29 03:44:48,427 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3356 transitions. [2023-08-29 03:44:48,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3356 transitions. [2023-08-29 03:44:48,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:44:48,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3356 transitions. [2023-08-29 03:44:48,431 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-29 03:44:48,435 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-29 03:44:48,436 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-29 03:44:48,436 INFO L175 Difference]: Start difference. First operand has 242 places, 221 transitions, 859 flow. Second operand 6 states and 3356 transitions. [2023-08-29 03:44:48,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 343 transitions, 1873 flow [2023-08-29 03:44:51,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 343 transitions, 1864 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 03:44:51,077 INFO L231 Difference]: Finished difference. Result has 243 places, 219 transitions, 856 flow [2023-08-29 03:44:51,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1164, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=243, PETRI_TRANSITIONS=219} [2023-08-29 03:44:51,078 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, 1 predicate places. [2023-08-29 03:44:51,078 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 219 transitions, 856 flow [2023-08-29 03:44:51,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 534.3333333333334) internal successors, (3206), 6 states have internal predecessors, (3206), 0 states have call successors, (0), 0 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-29 03:44:51,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:44:51,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:44:51,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 03:44:51,079 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-08-29 03:44:51,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:44:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1273868743, now seen corresponding path program 1 times [2023-08-29 03:44:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:44:51,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593179719] [2023-08-29 03:44:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:44:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:44:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:44:51,253 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-29 03:44:51,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:44:51,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593179719] [2023-08-29 03:44:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593179719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:44:51,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:44:51,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 03:44:51,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996646546] [2023-08-29 03:44:51,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:44:51,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 03:44:51,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:44:51,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 03:44:51,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 03:44:51,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 1164 [2023-08-29 03:44:51,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 219 transitions, 856 flow. Second operand has 8 states, 8 states have (on average 538.0) internal successors, (4304), 8 states have internal predecessors, (4304), 0 states have call successors, (0), 0 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-29 03:44:51,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:44:51,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 1164 [2023-08-29 03:44:51,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand