./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 TOGETHER --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 TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 19:09:54,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:09:54,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:09:54,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:09:54,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:09:54,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:09:54,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:09:54,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:09:54,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:09:54,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:09:54,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:09:54,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:09:54,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:09:54,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:09:54,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:09:54,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:09:54,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:09:54,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:09:54,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:09:54,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:09:54,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:09:54,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:09:54,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:09:54,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:09:54,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:09:54,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:09:54,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:09:54,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:09:54,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:09:54,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:09:54,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:09:54,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:09:54,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:09:54,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:09:54,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:09:54,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:09:54,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:09:54,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:09:54,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:09:54,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:09:54,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:09:54,770 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 19:09:54,799 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:09:54,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:09:54,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:09:54,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:09:54,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:09:54,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:09:54,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:09:54,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:09:54,802 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:09:54,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:09:54,803 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:09:54,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:09:54,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:09:54,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:09:54,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:09:54,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 19:09:54,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:09:54,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 19:09:54,804 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 19:09:54,804 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:09:54,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 19:09:54,805 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:09:54,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 19:09:54,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:09:54,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:09:54,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:09:54,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:09:54,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:09:54,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:09:54,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 19:09:54,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 19:09:54,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 19:09:54,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:09:54,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 19:09:54,807 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:09:54,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:09:54,807 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:09:54,807 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 -> TOGETHER [2023-08-29 19:09:55,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:09:55,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:09:55,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:09:55,091 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:09:55,092 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:09:55,093 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 19:09:56,075 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:09:56,223 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:09:56,223 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2023-08-29 19:09:56,227 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb103a7b/b59e8de7062b4c70bfc55bfea779f1ee/FLAG335bffbdb [2023-08-29 19:09:56,238 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb103a7b/b59e8de7062b4c70bfc55bfea779f1ee [2023-08-29 19:09:56,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:09:56,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:09:56,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:09:56,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:09:56,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:09:56,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d4d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56, skipping insertion in model container [2023-08-29 19:09:56,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:09:56,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:09:56,415 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 19:09:56,427 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:09:56,436 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:09:56,492 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 19:09:56,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:09:56,501 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:09:56,501 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:09:56,506 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:09:56,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56 WrapperNode [2023-08-29 19:09:56,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:09:56,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:09:56,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:09:56,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:09:56,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,555 INFO L138 Inliner]: procedures = 28, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 668 [2023-08-29 19:09:56,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:09:56,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:09:56,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:09:56,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:09:56,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,611 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:09:56,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:09:56,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:09:56,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:09:56,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (1/1) ... [2023-08-29 19:09:56,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:09:56,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:09:56,670 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 19:09:56,680 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 19:09:56,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:09:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-29 19:09:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:09:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 19:09:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 19:09:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-08-29 19:09:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 19:09:56,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 19:09:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 19:09:56,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 19:09:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-29 19:09:56,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-29 19:09:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 19:09:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 19:09:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 19:09:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-29 19:09:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:09:56,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:09:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:09:56,706 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 19:09:56,822 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:09:56,823 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:09:57,606 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:09:57,879 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:09:57,879 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-29 19:09:57,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:09:57 BoogieIcfgContainer [2023-08-29 19:09:57,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:09:57,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:09:57,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:09:57,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:09:57,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:09:56" (1/3) ... [2023-08-29 19:09:57,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7a42d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:09:57, skipping insertion in model container [2023-08-29 19:09:57,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:09:56" (2/3) ... [2023-08-29 19:09:57,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7a42d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:09:57, skipping insertion in model container [2023-08-29 19:09:57,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:09:57" (3/3) ... [2023-08-29 19:09:57,891 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2023-08-29 19:09:57,898 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 19:09:57,904 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:09:57,905 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 87 error locations. [2023-08-29 19:09:57,905 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:09:58,051 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 19:09:58,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 592 places, 618 transitions, 1260 flow [2023-08-29 19:09:58,284 INFO L130 PetriNetUnfolder]: 36/615 cut-off events. [2023-08-29 19:09:58,285 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 19:09:58,300 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 19:09:58,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 592 places, 618 transitions, 1260 flow [2023-08-29 19:09:58,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 573 places, 598 transitions, 1214 flow [2023-08-29 19:09:58,315 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:09:58,332 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 573 places, 598 transitions, 1214 flow [2023-08-29 19:09:58,335 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 573 places, 598 transitions, 1214 flow [2023-08-29 19:09:58,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 573 places, 598 transitions, 1214 flow [2023-08-29 19:09:58,433 INFO L130 PetriNetUnfolder]: 35/598 cut-off events. [2023-08-29 19:09:58,434 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 19:09:58,439 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 19:09:58,460 INFO L119 LiptonReduction]: Number of co-enabled transitions 66564 [2023-08-29 19:11:17,274 INFO L134 LiptonReduction]: Checked pairs total: 477518 [2023-08-29 19:11:17,274 INFO L136 LiptonReduction]: Total number of compositions: 546 [2023-08-29 19:11:17,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:11:17,346 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;@16f017f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:11:17,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 151 error locations. [2023-08-29 19:11:17,347 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 19:11:17,351 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:11:17,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:11:17,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 19:11:17,353 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 19:11:17,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:11:17,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2680, now seen corresponding path program 1 times [2023-08-29 19:11:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:11:17,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941084971] [2023-08-29 19:11:17,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:11:17,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:11:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:11:17,465 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 19:11:17,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:11:17,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941084971] [2023-08-29 19:11:17,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941084971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:11:17,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:11:17,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 19:11:17,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178014466] [2023-08-29 19:11:17,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:11:17,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:11:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:11:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:11:17,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:11:17,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 1164 [2023-08-29 19:11:17,508 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 19:11:17,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:11:17,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 1164 [2023-08-29 19:11:17,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:11:20,361 INFO L130 PetriNetUnfolder]: 10996/26551 cut-off events. [2023-08-29 19:11:20,362 INFO L131 PetriNetUnfolder]: For 578/578 co-relation queries the response was YES. [2023-08-29 19:11:20,438 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 19:11:20,585 INFO L137 encePairwiseOnDemand]: 1108/1164 looper letters, 58 selfloop transitions, 0 changer transitions 1/195 dead transitions. [2023-08-29 19:11:20,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 195 transitions, 526 flow [2023-08-29 19:11:20,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:11:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:11:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1239 transitions. [2023-08-29 19:11:20,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5322164948453608 [2023-08-29 19:11:20,602 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1239 transitions. [2023-08-29 19:11:20,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1239 transitions. [2023-08-29 19:11:20,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:11:20,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1239 transitions. [2023-08-29 19:11:20,613 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 19:11:20,625 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 19:11:20,626 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 19:11:20,628 INFO L175 Difference]: Start difference. First operand has 242 places, 251 transitions, 520 flow. Second operand 2 states and 1239 transitions. [2023-08-29 19:11:20,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 195 transitions, 526 flow [2023-08-29 19:11:20,643 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 19:11:20,647 INFO L231 Difference]: Finished difference. Result has 187 places, 194 transitions, 393 flow [2023-08-29 19:11:20,651 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 19:11:20,655 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -55 predicate places. [2023-08-29 19:11:20,655 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 194 transitions, 393 flow [2023-08-29 19:11:20,656 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 19:11:20,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:11:20,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:11:20,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 19:11:20,657 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 19:11:20,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:11:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1016127394, now seen corresponding path program 1 times [2023-08-29 19:11:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:11:20,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980109591] [2023-08-29 19:11:20,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:11:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:11:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:11:20,849 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 19:11:20,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:11:20,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980109591] [2023-08-29 19:11:20,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980109591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:11:20,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:11:20,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:11:20,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48414814] [2023-08-29 19:11:20,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:11:20,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:11:20,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:11:20,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:11:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:11:20,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 1164 [2023-08-29 19:11:20,872 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 19:11:20,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:11:20,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 1164 [2023-08-29 19:11:20,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:11:23,116 INFO L130 PetriNetUnfolder]: 13301/31171 cut-off events. [2023-08-29 19:11:23,116 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2023-08-29 19:11:23,163 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 19:11:23,260 INFO L137 encePairwiseOnDemand]: 1161/1164 looper letters, 60 selfloop transitions, 1 changer transitions 0/192 dead transitions. [2023-08-29 19:11:23,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 192 transitions, 511 flow [2023-08-29 19:11:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:11:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:11:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2023-08-29 19:11:23,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48711340206185566 [2023-08-29 19:11:23,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1701 transitions. [2023-08-29 19:11:23,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1701 transitions. [2023-08-29 19:11:23,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:11:23,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1701 transitions. [2023-08-29 19:11:23,268 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 19:11:23,272 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 19:11:23,273 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 19:11:23,274 INFO L175 Difference]: Start difference. First operand has 187 places, 194 transitions, 393 flow. Second operand 3 states and 1701 transitions. [2023-08-29 19:11:23,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 192 transitions, 511 flow [2023-08-29 19:11:23,276 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 19:11:23,279 INFO L231 Difference]: Finished difference. Result has 186 places, 192 transitions, 391 flow [2023-08-29 19:11:23,279 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 19:11:23,281 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -56 predicate places. [2023-08-29 19:11:23,281 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 192 transitions, 391 flow [2023-08-29 19:11:23,282 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 19:11:23,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:11:23,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:11:23,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 19:11:23,282 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 19:11:23,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:11:23,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1540780517, now seen corresponding path program 1 times [2023-08-29 19:11:23,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:11:23,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603908192] [2023-08-29 19:11:23,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:11:23,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:11:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:11:23,363 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 19:11:23,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:11:23,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603908192] [2023-08-29 19:11:23,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603908192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:11:23,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:11:23,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:11:23,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909459386] [2023-08-29 19:11:23,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:11:23,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:11:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:11:23,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:11:23,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:11:23,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 1164 [2023-08-29 19:11:23,387 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 19:11:23,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:11:23,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 1164 [2023-08-29 19:11:23,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:11:26,814 INFO L130 PetriNetUnfolder]: 21210/49026 cut-off events. [2023-08-29 19:11:26,814 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2023-08-29 19:11:26,885 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 19:11:27,027 INFO L137 encePairwiseOnDemand]: 1155/1164 looper letters, 82 selfloop transitions, 3 changer transitions 0/204 dead transitions. [2023-08-29 19:11:27,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 204 transitions, 589 flow [2023-08-29 19:11:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:11:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:11:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1720 transitions. [2023-08-29 19:11:27,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925544100801833 [2023-08-29 19:11:27,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1720 transitions. [2023-08-29 19:11:27,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1720 transitions. [2023-08-29 19:11:27,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:11:27,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1720 transitions. [2023-08-29 19:11:27,034 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 19:11:27,038 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 19:11:27,039 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 19:11:27,039 INFO L175 Difference]: Start difference. First operand has 186 places, 192 transitions, 391 flow. Second operand 3 states and 1720 transitions. [2023-08-29 19:11:27,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 204 transitions, 589 flow [2023-08-29 19:11:27,042 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 19:11:27,043 INFO L231 Difference]: Finished difference. Result has 182 places, 189 transitions, 399 flow [2023-08-29 19:11:27,044 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 19:11:27,045 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -60 predicate places. [2023-08-29 19:11:27,047 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 189 transitions, 399 flow [2023-08-29 19:11:27,048 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 19:11:27,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:11:27,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:11:27,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 19:11:27,048 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 19:11:27,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:11:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash -890424331, now seen corresponding path program 1 times [2023-08-29 19:11:27,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:11:27,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380221239] [2023-08-29 19:11:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:11:27,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:11:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:11:27,104 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 19:11:27,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:11:27,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380221239] [2023-08-29 19:11:27,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380221239] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:11:27,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:11:27,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:11:27,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880378367] [2023-08-29 19:11:27,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:11:27,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:11:27,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:11:27,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:11:27,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:11:27,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 1164 [2023-08-29 19:11:27,123 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 19:11:27,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:11:27,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 1164 [2023-08-29 19:11:27,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:11:28,171 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:28,172 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:11:28,173 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:11:28,173 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 19:11:28,173 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:28,237 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:28,237 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:11:28,238 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:11:28,238 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 19:11:28,238 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:28,309 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:28,309 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:28,309 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:28,309 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:28,309 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:28,310 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:28,310 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:28,310 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:28,310 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:28,310 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:28,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][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 19:11:28,384 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:11:28,384 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:28,384 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:28,384 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:11:28,385 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:28,385 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:11:28,385 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:11:28,385 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:28,385 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:29,539 INFO L130 PetriNetUnfolder]: 14189/32904 cut-off events. [2023-08-29 19:11:29,539 INFO L131 PetriNetUnfolder]: For 1176/1176 co-relation queries the response was YES. [2023-08-29 19:11:29,596 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 19:11:29,682 INFO L137 encePairwiseOnDemand]: 1161/1164 looper letters, 60 selfloop transitions, 1 changer transitions 0/187 dead transitions. [2023-08-29 19:11:29,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 187 transitions, 517 flow [2023-08-29 19:11:29,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:11:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:11:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2023-08-29 19:11:29,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48940435280641464 [2023-08-29 19:11:29,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1709 transitions. [2023-08-29 19:11:29,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1709 transitions. [2023-08-29 19:11:29,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:11:29,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1709 transitions. [2023-08-29 19:11:29,690 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 19:11:29,694 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 19:11:29,695 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 19:11:29,696 INFO L175 Difference]: Start difference. First operand has 182 places, 189 transitions, 399 flow. Second operand 3 states and 1709 transitions. [2023-08-29 19:11:29,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 187 transitions, 517 flow [2023-08-29 19:11:29,697 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 19:11:29,698 INFO L231 Difference]: Finished difference. Result has 182 places, 187 transitions, 397 flow [2023-08-29 19:11:29,699 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 19:11:29,699 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -60 predicate places. [2023-08-29 19:11:29,699 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 187 transitions, 397 flow [2023-08-29 19:11:29,700 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 19:11:29,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:11:29,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:11:29,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 19:11:29,701 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 19:11:29,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:11:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1041709781, now seen corresponding path program 1 times [2023-08-29 19:11:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:11:29,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558017001] [2023-08-29 19:11:29,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:11:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:11:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:11:30,003 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 19:11:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:11:30,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558017001] [2023-08-29 19:11:30,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558017001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:11:30,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:11:30,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:11:30,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444672340] [2023-08-29 19:11:30,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:11:30,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:11:30,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:11:30,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:11:30,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:11:30,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 1164 [2023-08-29 19:11:30,532 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 19:11:30,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:11:30,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 1164 [2023-08-29 19:11:30,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:11:33,155 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,155 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:11:33,156 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:11:33,156 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-29 19:11:33,156 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:11:33,266 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,266 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:11:33,266 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:11:33,266 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-29 19:11:33,267 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:11:33,267 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,267 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:11:33,267 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 19:11:33,267 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:11:33,267 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:11:33,516 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,516 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:11:33,516 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:33,517 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:11:33,517 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 19:11:33,517 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,518 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:11:33,518 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:33,518 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 19:11:33,518 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:11:33,518 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,518 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:11:33,518 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 19:11:33,518 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:33,519 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:33,519 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,519 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:11:33,519 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:33,519 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 19:11:33,519 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:33,614 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][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 19:11:33,614 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:33,615 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:33,615 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:33,615 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:33,765 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,765 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:11:33,765 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:33,766 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:11:33,766 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:33,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,810 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:33,811 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:33,811 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:33,811 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:33,811 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,811 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:11:33,811 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:33,812 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:11:33,812 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:33,812 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,812 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:33,812 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:33,812 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:33,812 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:33,813 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,813 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:11:33,813 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:33,813 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:11:33,813 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:33,813 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,814 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:33,814 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:33,814 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:33,817 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:33,818 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:33,818 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:11:33,819 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:33,819 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:33,819 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:11:33,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], [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 19:11:33,923 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:11:33,923 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:33,923 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:11:33,923 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:34,208 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:34,209 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:34,209 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:34,209 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:34,209 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:34,238 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:34,239 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:11:34,239 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:34,239 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:11:34,239 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:34,239 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:34,239 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:34,239 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:34,239 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:34,240 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:34,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:34,240 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:11:34,240 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:34,240 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:34,240 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:11:34,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:34,240 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:34,241 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:34,241 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:34,241 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:34,303 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:34,303 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 19:11:34,303 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:34,304 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:11:34,304 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 19:11:34,306 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:34,306 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 19:11:34,307 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 19:11:34,307 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:34,307 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:11:34,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:34,414 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 19:11:34,414 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:34,414 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:11:34,414 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 19:11:34,415 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:34,415 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 19:11:34,415 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:11:34,415 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:34,415 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 19:11:36,674 INFO L130 PetriNetUnfolder]: 39245/63637 cut-off events. [2023-08-29 19:11:36,674 INFO L131 PetriNetUnfolder]: For 2389/2389 co-relation queries the response was YES. [2023-08-29 19:11:36,823 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 19:11:37,029 INFO L137 encePairwiseOnDemand]: 1159/1164 looper letters, 219 selfloop transitions, 4 changer transitions 0/346 dead transitions. [2023-08-29 19:11:37,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 346 transitions, 1181 flow [2023-08-29 19:11:37,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:11:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:11:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3441 transitions. [2023-08-29 19:11:37,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49269759450171824 [2023-08-29 19:11:37,035 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3441 transitions. [2023-08-29 19:11:37,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3441 transitions. [2023-08-29 19:11:37,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:11:37,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3441 transitions. [2023-08-29 19:11:37,041 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 19:11:37,048 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 19:11:37,050 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 19:11:37,050 INFO L175 Difference]: Start difference. First operand has 182 places, 187 transitions, 397 flow. Second operand 6 states and 3441 transitions. [2023-08-29 19:11:37,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 346 transitions, 1181 flow [2023-08-29 19:11:37,051 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 19:11:37,054 INFO L231 Difference]: Finished difference. Result has 185 places, 186 transitions, 402 flow [2023-08-29 19:11:37,054 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 19:11:37,056 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -57 predicate places. [2023-08-29 19:11:37,056 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 186 transitions, 402 flow [2023-08-29 19:11:37,057 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 19:11:37,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:11:37,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:11:37,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 19:11:37,058 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 19:11:37,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:11:37,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1364000831, now seen corresponding path program 1 times [2023-08-29 19:11:37,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:11:37,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554956108] [2023-08-29 19:11:37,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:11:37,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:11:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:11:37,140 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 19:11:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:11:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554956108] [2023-08-29 19:11:37,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554956108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:11:37,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:11:37,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:11:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158563945] [2023-08-29 19:11:37,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:11:37,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:11:37,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:11:37,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:11:37,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:11:37,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 1164 [2023-08-29 19:11:37,228 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 19:11:37,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:11:37,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 1164 [2023-08-29 19:11:37,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:11:38,249 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:38,249 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:11:38,249 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:11:38,250 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:11:38,250 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 19:11:38,313 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:38,314 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:11:38,314 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 19:11:38,314 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:38,314 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:38,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], [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 19:11:38,381 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:11:38,381 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 19:11:38,381 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:38,381 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:38,439 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:38,439 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:38,439 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:38,439 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:38,439 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:38,439 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:38,440 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:38,440 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:38,440 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:38,440 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:38,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][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 19:11:38,487 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:11:38,487 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:11:38,487 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:38,487 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:38,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][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 19:11:38,540 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:11:38,540 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:38,540 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:11:38,540 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:38,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][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 19:11:38,541 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:11:38,541 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:38,541 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:11:38,541 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:38,597 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:38,598 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:38,598 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:38,598 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:38,598 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:38,598 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:38,598 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:38,598 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:38,598 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:38,599 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:38,599 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:38,599 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 19:11:38,599 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:11:38,599 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 19:11:38,599 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:38,599 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:38,599 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:38,600 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:38,600 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:38,600 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:38,600 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:38,600 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:38,600 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:38,600 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:38,600 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:39,861 INFO L130 PetriNetUnfolder]: 12849/29723 cut-off events. [2023-08-29 19:11:39,861 INFO L131 PetriNetUnfolder]: For 2740/2740 co-relation queries the response was YES. [2023-08-29 19:11:39,920 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 19:11:40,017 INFO L137 encePairwiseOnDemand]: 1156/1164 looper letters, 57 selfloop transitions, 4 changer transitions 12/200 dead transitions. [2023-08-29 19:11:40,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 200 transitions, 576 flow [2023-08-29 19:11:40,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:11:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:11:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2814 transitions. [2023-08-29 19:11:40,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48350515463917526 [2023-08-29 19:11:40,025 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2814 transitions. [2023-08-29 19:11:40,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2814 transitions. [2023-08-29 19:11:40,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:11:40,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2814 transitions. [2023-08-29 19:11:40,030 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 19:11:40,035 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 19:11:40,036 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 19:11:40,036 INFO L175 Difference]: Start difference. First operand has 185 places, 186 transitions, 402 flow. Second operand 5 states and 2814 transitions. [2023-08-29 19:11:40,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 200 transitions, 576 flow [2023-08-29 19:11:40,051 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 19:11:40,055 INFO L231 Difference]: Finished difference. Result has 188 places, 188 transitions, 427 flow [2023-08-29 19:11:40,055 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 19:11:40,057 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -54 predicate places. [2023-08-29 19:11:40,057 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 188 transitions, 427 flow [2023-08-29 19:11:40,058 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 19:11:40,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:11:40,058 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 19:11:40,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 19:11:40,058 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 19:11:40,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:11:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1533179764, now seen corresponding path program 1 times [2023-08-29 19:11:40,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:11:40,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863483223] [2023-08-29 19:11:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:11:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:11:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:11:40,326 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 19:11:40,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:11:40,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863483223] [2023-08-29 19:11:40,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863483223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:11:40,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:11:40,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:11:40,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304044234] [2023-08-29 19:11:40,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:11:40,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:11:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:11:40,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:11:40,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:11:41,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-29 19:11:41,068 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 19:11:41,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:11:41,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-29 19:11:41,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:11:45,598 INFO L130 PetriNetUnfolder]: 22177/44087 cut-off events. [2023-08-29 19:11:45,598 INFO L131 PetriNetUnfolder]: For 633/633 co-relation queries the response was YES. [2023-08-29 19:11:45,709 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 19:11:45,824 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 198 selfloop transitions, 5 changer transitions 0/318 dead transitions. [2023-08-29 19:11:45,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 318 transitions, 1101 flow [2023-08-29 19:11:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:11:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:11:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3382 transitions. [2023-08-29 19:11:45,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48424971363115693 [2023-08-29 19:11:45,831 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3382 transitions. [2023-08-29 19:11:45,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3382 transitions. [2023-08-29 19:11:45,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:11:45,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3382 transitions. [2023-08-29 19:11:45,837 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 19:11:45,842 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 19:11:45,843 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 19:11:45,843 INFO L175 Difference]: Start difference. First operand has 188 places, 188 transitions, 427 flow. Second operand 6 states and 3382 transitions. [2023-08-29 19:11:45,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 318 transitions, 1101 flow [2023-08-29 19:11:45,845 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 19:11:45,847 INFO L231 Difference]: Finished difference. Result has 186 places, 186 transitions, 419 flow [2023-08-29 19:11:45,847 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 19:11:45,848 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -56 predicate places. [2023-08-29 19:11:45,848 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 186 transitions, 419 flow [2023-08-29 19:11:45,848 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 19:11:45,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:11:45,849 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 19:11:45,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 19:11:45,849 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 19:11:45,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:11:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash 212661638, now seen corresponding path program 1 times [2023-08-29 19:11:45,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:11:45,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650218602] [2023-08-29 19:11:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:11:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:11:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:11:45,879 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 19:11:45,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:11:45,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650218602] [2023-08-29 19:11:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650218602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:11:45,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:11:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:11:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756250000] [2023-08-29 19:11:45,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:11:45,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:11:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:11:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:11:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:11:45,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 19:11:45,886 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 19:11:45,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:11:45,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 19:11:45,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:11:46,758 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][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 19:11:46,758 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:11:46,758 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 19:11:46,758 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:11:46,759 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:11:46,828 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:46,828 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:11:46,828 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 19:11:46,828 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:46,829 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:46,904 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:46,905 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:11:46,905 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:46,905 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:46,905 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 19:11:46,974 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:46,974 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:46,974 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:46,974 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:46,974 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:46,974 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:46,975 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:46,975 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:46,975 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:46,975 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:47,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][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 19:11:47,061 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:11:47,061 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:47,062 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:11:47,062 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:47,150 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:47,150 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:11:47,150 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:11:47,150 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:47,151 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:47,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:47,151 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:11:47,151 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:47,151 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:11:47,151 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:47,200 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:47,201 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:47,201 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:47,201 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:47,201 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:47,201 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:47,201 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:47,201 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:47,202 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:47,202 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:47,202 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:47,202 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 19:11:47,202 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:47,202 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 19:11:47,202 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:11:47,202 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:47,203 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:47,203 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:47,203 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:47,203 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:47,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][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 19:11:47,203 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:47,203 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:47,203 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:47,203 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:49,110 INFO L130 PetriNetUnfolder]: 17136/41497 cut-off events. [2023-08-29 19:11:49,111 INFO L131 PetriNetUnfolder]: For 1030/1040 co-relation queries the response was YES. [2023-08-29 19:11:49,205 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 19:11:49,312 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 95 selfloop transitions, 3 changer transitions 0/223 dead transitions. [2023-08-29 19:11:49,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 223 transitions, 693 flow [2023-08-29 19:11:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:11:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:11:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1767 transitions. [2023-08-29 19:11:49,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060137457044673 [2023-08-29 19:11:49,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1767 transitions. [2023-08-29 19:11:49,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1767 transitions. [2023-08-29 19:11:49,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:11:49,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1767 transitions. [2023-08-29 19:11:49,319 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 19:11:49,322 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 19:11:49,322 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 19:11:49,322 INFO L175 Difference]: Start difference. First operand has 186 places, 186 transitions, 419 flow. Second operand 3 states and 1767 transitions. [2023-08-29 19:11:49,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 223 transitions, 693 flow [2023-08-29 19:11:49,400 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 19:11:49,402 INFO L231 Difference]: Finished difference. Result has 185 places, 188 transitions, 431 flow [2023-08-29 19:11:49,402 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 19:11:49,403 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -57 predicate places. [2023-08-29 19:11:49,403 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 188 transitions, 431 flow [2023-08-29 19:11:49,403 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 19:11:49,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:11:49,404 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 19:11:49,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 19:11:49,404 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 19:11:49,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:11:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1946483524, now seen corresponding path program 1 times [2023-08-29 19:11:49,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:11:49,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019965284] [2023-08-29 19:11:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:11:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:11:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:11:49,490 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 19:11:49,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:11:49,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019965284] [2023-08-29 19:11:49,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019965284] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:11:49,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821804657] [2023-08-29 19:11:49,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:11:49,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:11:49,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:11:49,493 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 19:11:49,494 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 19:11:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:11:49,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 19:11:49,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:11:49,666 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 19:11:49,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:11:49,729 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 19:11:49,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821804657] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:11:49,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:11:49,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 19:11:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54814383] [2023-08-29 19:11:49,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:11:49,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 19:11:49,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:11:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 19:11:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-08-29 19:11:50,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 1164 [2023-08-29 19:11:50,599 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 19:11:50,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:11:50,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 1164 [2023-08-29 19:11:50,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:11:54,117 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,117 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:54,118 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:54,118 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:54,118 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:54,229 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,229 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:11:54,229 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:11:54,229 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:54,229 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:11:54,230 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,230 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:11:54,230 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:11:54,230 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:54,230 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:54,245 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,246 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:11:54,246 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:54,246 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:11:54,246 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:54,347 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,348 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:11:54,348 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:11:54,348 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:54,348 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:11:54,369 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,369 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:54,369 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:54,369 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:54,370 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:54,581 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,581 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:11:54,581 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:54,581 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:11:54,581 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:54,581 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,581 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:11:54,581 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:11:54,581 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:54,582 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:11:54,658 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][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 19:11:54,658 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:54,658 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:54,658 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:54,658 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:54,659 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,659 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:11:54,659 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:11:54,659 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:54,659 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:11:54,740 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][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 19:11:54,740 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 19:11:54,740 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 19:11:54,741 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:11:54,741 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:54,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][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 19:11:54,741 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 19:11:54,741 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 19:11:54,741 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:11:54,741 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:11:54,835 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,835 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 19:11:54,835 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:54,835 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:11:54,836 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 19:11:54,836 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,836 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 19:11:54,836 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:11:54,836 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 19:11:54,836 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:54,836 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,837 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-29 19:11:54,837 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 19:11:54,837 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:11:54,837 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 19:11:54,837 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,837 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 19:11:54,837 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:54,837 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:11:54,838 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 19:11:54,838 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:11:54,838 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 19:11:54,838 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:11:54,838 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 19:11:54,838 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:11:57,425 INFO L130 PetriNetUnfolder]: 24341/60206 cut-off events. [2023-08-29 19:11:57,426 INFO L131 PetriNetUnfolder]: For 7276/7394 co-relation queries the response was YES. [2023-08-29 19:11:57,672 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 19:11:57,974 INFO L137 encePairwiseOnDemand]: 1154/1164 looper letters, 257 selfloop transitions, 16 changer transitions 0/397 dead transitions. [2023-08-29 19:11:57,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 397 transitions, 1546 flow [2023-08-29 19:11:57,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 19:11:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 19:11:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6689 transitions. [2023-08-29 19:11:58,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4788802978235968 [2023-08-29 19:11:58,016 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 6689 transitions. [2023-08-29 19:11:58,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 6689 transitions. [2023-08-29 19:11:58,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:11:58,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 6689 transitions. [2023-08-29 19:11:58,027 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 19:11:58,038 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 19:11:58,040 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 19:11:58,040 INFO L175 Difference]: Start difference. First operand has 185 places, 188 transitions, 431 flow. Second operand 12 states and 6689 transitions. [2023-08-29 19:11:58,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 397 transitions, 1546 flow [2023-08-29 19:11:58,146 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 19:11:58,148 INFO L231 Difference]: Finished difference. Result has 199 places, 200 transitions, 533 flow [2023-08-29 19:11:58,149 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 19:11:58,149 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -43 predicate places. [2023-08-29 19:11:58,149 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 200 transitions, 533 flow [2023-08-29 19:11:58,151 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 19:11:58,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:11:58,151 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 19:11:58,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-29 19:11:58,356 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 19:11:58,357 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 19:11:58,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:11:58,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1997496372, now seen corresponding path program 1 times [2023-08-29 19:11:58,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:11:58,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006356617] [2023-08-29 19:11:58,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:11:58,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:11:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:11:58,389 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 19:11:58,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:11:58,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006356617] [2023-08-29 19:11:58,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006356617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:11:58,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:11:58,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:11:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619451022] [2023-08-29 19:11:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:11:58,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:11:58,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:11:58,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:11:58,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:11:58,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 19:11:58,398 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 19:11:58,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:11:58,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 19:11:58,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:12:00,872 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:00,873 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-29 19:12:00,873 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 19:12:00,873 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:12:00,873 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-29 19:12:00,945 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:00,945 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 19:12:00,945 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:12:00,945 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:12:00,946 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 19:12:00,952 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:00,953 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 19:12:00,953 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 19:12:00,953 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:00,953 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:12:01,015 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][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 19:12:01,025 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 19:12:01,025 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 19:12:01,025 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:12:01,025 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:12:01,035 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:01,036 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 19:12:01,036 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 19:12:01,036 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:12:01,036 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:01,100 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:01,100 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 19:12:01,101 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:12:01,101 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 19:12:01,101 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:01,101 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:01,101 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 19:12:01,101 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:12:01,101 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 19:12:01,101 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:01,152 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:01,153 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 19:12:01,153 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:01,153 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 19:12:01,153 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:12:01,160 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:01,160 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 19:12:01,160 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 19:12:01,160 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:12:01,160 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:01,201 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:01,201 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:01,201 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:01,201 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:01,201 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:01,214 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:01,214 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:01,214 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:01,214 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:01,214 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:01,214 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:01,215 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:01,215 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:01,215 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:01,215 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:01,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][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 19:12:01,436 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:01,436 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:01,436 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:01,437 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:01,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][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 19:12:01,437 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:01,437 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:01,437 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:01,437 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:01,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][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 19:12:01,438 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 19:12:01,438 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:12:01,438 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 19:12:01,438 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 19:12:01,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][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 19:12:01,438 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:01,438 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:01,439 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:01,439 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:01,439 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:01,439 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:01,439 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:01,439 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:01,439 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:02,426 INFO L130 PetriNetUnfolder]: 18668/47019 cut-off events. [2023-08-29 19:12:02,426 INFO L131 PetriNetUnfolder]: For 8219/9505 co-relation queries the response was YES. [2023-08-29 19:12:02,538 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 19:12:02,651 INFO L137 encePairwiseOnDemand]: 1162/1164 looper letters, 104 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2023-08-29 19:12:02,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 233 transitions, 820 flow [2023-08-29 19:12:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:12:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:12:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2023-08-29 19:12:02,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048682703321878 [2023-08-29 19:12:02,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2023-08-29 19:12:02,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2023-08-29 19:12:02,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:12:02,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2023-08-29 19:12:02,661 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 19:12:02,664 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 19:12:02,664 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 19:12:02,665 INFO L175 Difference]: Start difference. First operand has 199 places, 200 transitions, 533 flow. Second operand 3 states and 1763 transitions. [2023-08-29 19:12:02,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 233 transitions, 820 flow [2023-08-29 19:12:02,678 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 19:12:02,679 INFO L231 Difference]: Finished difference. Result has 201 places, 199 transitions, 521 flow [2023-08-29 19:12:02,680 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 19:12:02,680 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -41 predicate places. [2023-08-29 19:12:02,680 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 199 transitions, 521 flow [2023-08-29 19:12:02,681 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 19:12:02,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:12:02,681 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 19:12:02,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 19:12:02,681 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 19:12:02,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:12:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash -522161326, now seen corresponding path program 1 times [2023-08-29 19:12:02,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:12:02,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72135855] [2023-08-29 19:12:02,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:12:02,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:12:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:12:02,930 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 19:12:02,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:12:02,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72135855] [2023-08-29 19:12:02,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72135855] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:12:02,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:12:02,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:12:02,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960693323] [2023-08-29 19:12:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:12:02,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:12:02,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:12:02,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:12:02,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:12:03,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-29 19:12:03,467 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 19:12:03,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:12:03,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-29 19:12:03,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:12:06,941 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:06,941 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-29 19:12:06,941 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 19:12:06,941 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:12:06,941 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-29 19:12:07,019 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][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 19:12:07,019 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 19:12:07,019 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:12:07,019 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:12:07,019 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 19:12:07,195 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:07,196 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 19:12:07,196 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:07,196 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 19:12:07,196 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:12:07,263 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:07,263 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 19:12:07,263 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 19:12:07,263 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:12:07,263 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:12:07,517 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:07,517 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 19:12:07,518 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:07,518 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:12:07,518 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 19:12:07,607 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:07,608 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 19:12:07,608 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:07,608 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:12:07,608 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 19:12:07,608 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:07,609 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 19:12:07,609 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:07,609 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 19:12:07,609 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:12:07,686 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:07,686 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 19:12:07,686 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:12:07,686 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 19:12:07,686 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:07,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:07,696 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 19:12:07,696 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 19:12:07,697 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:12:07,697 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:07,760 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:07,760 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:07,760 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:07,761 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:07,761 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:07,777 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:07,778 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:07,778 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:07,778 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:07,778 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:07,778 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:07,778 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:07,779 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:07,779 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:07,779 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:07,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][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 19:12:07,856 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:07,856 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:07,856 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:07,857 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:07,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][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 19:12:07,857 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:07,857 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:07,857 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:07,857 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:07,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][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 19:12:07,858 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 19:12:07,858 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 19:12:07,858 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 19:12:07,858 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:12:07,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][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 19:12:07,858 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:07,858 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:07,859 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:07,859 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:07,859 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:07,859 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:07,859 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:07,859 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:07,859 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:09,110 INFO L130 PetriNetUnfolder]: 27215/53188 cut-off events. [2023-08-29 19:12:09,111 INFO L131 PetriNetUnfolder]: For 20693/22605 co-relation queries the response was YES. [2023-08-29 19:12:09,351 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 19:12:09,542 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 191 selfloop transitions, 5 changer transitions 0/313 dead transitions. [2023-08-29 19:12:09,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 313 transitions, 1257 flow [2023-08-29 19:12:09,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:12:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:12:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3356 transitions. [2023-08-29 19:12:09,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805269186712486 [2023-08-29 19:12:09,547 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3356 transitions. [2023-08-29 19:12:09,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3356 transitions. [2023-08-29 19:12:09,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:12:09,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3356 transitions. [2023-08-29 19:12:09,552 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 19:12:09,556 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 19:12:09,557 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 19:12:09,557 INFO L175 Difference]: Start difference. First operand has 201 places, 199 transitions, 521 flow. Second operand 6 states and 3356 transitions. [2023-08-29 19:12:09,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 313 transitions, 1257 flow [2023-08-29 19:12:09,632 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 19:12:09,634 INFO L231 Difference]: Finished difference. Result has 203 places, 197 transitions, 525 flow [2023-08-29 19:12:09,635 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 19:12:09,635 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -39 predicate places. [2023-08-29 19:12:09,635 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 197 transitions, 525 flow [2023-08-29 19:12:09,636 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 19:12:09,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:12:09,636 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 19:12:09,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 19:12:09,636 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 19:12:09,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:12:09,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2133869231, now seen corresponding path program 2 times [2023-08-29 19:12:09,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:12:09,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234310420] [2023-08-29 19:12:09,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:12:09,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:12:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:12:09,919 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 19:12:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:12:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234310420] [2023-08-29 19:12:09,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234310420] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:12:09,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:12:09,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:12:09,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722266027] [2023-08-29 19:12:09,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:12:09,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:12:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:12:09,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:12:09,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:12:10,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-29 19:12:10,569 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 19:12:10,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:12:10,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-29 19:12:10,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:12:15,313 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:15,314 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 19:12:15,314 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:12:15,314 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:12:15,314 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 19:12:15,523 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:15,524 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 19:12:15,524 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:12:15,524 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 19:12:15,524 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:12:15,531 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:15,531 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 19:12:15,531 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:12:15,531 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:12:15,532 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 19:12:15,796 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:15,796 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 19:12:15,796 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:12:15,796 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:15,796 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 19:12:15,811 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:15,811 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 19:12:15,811 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:15,811 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:12:15,811 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 19:12:15,812 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:15,812 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 19:12:15,812 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 19:12:15,812 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:15,812 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:12:15,880 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 641#true, 147#thread2EXITtrue, 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 800#true, 103#L73-1true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-29 19:12:15,881 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 19:12:15,881 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 19:12:15,881 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:15,881 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:12:15,892 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 793#true, 43#L105-2true, 595#true, 600#(= |#race~N~0| 0), Black: 781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~4#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~M~0 0)), Black: 655#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 620#(and (= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 771#(and (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), Black: 779#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~4#1| 1)), 609#(= |#race~M~0| 0), Black: 790#(not |thread1Thread1of1ForFork0_#t~short8#1|), 604#(= |#race~A~0| 0), 581#L61-6true, 103#L73-1true, 800#true, 641#true, Black: 602#true, Black: 637#(not |thread1Thread1of1ForFork0_#t~short6#1|)]) [2023-08-29 19:12:15,892 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 19:12:15,892 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:15,892 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 19:12:15,892 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:12:15,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, 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 19:12:15,948 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:15,948 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:15,948 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:15,948 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:15,967 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:15,968 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:15,968 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:15,968 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:15,968 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:15,968 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][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 19:12:15,968 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:15,968 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:15,969 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:15,969 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:16,039 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:16,039 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:16,040 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:16,040 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:16,040 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:16,040 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 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 19:12:16,040 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:16,040 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:16,040 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:16,040 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:17,396 INFO L130 PetriNetUnfolder]: 30875/67624 cut-off events. [2023-08-29 19:12:17,396 INFO L131 PetriNetUnfolder]: For 16133/16133 co-relation queries the response was YES. [2023-08-29 19:12:17,689 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 19:12:17,912 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 215 selfloop transitions, 5 changer transitions 0/331 dead transitions. [2023-08-29 19:12:17,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 331 transitions, 1313 flow [2023-08-29 19:12:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:12:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:12:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3382 transitions. [2023-08-29 19:12:17,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48424971363115693 [2023-08-29 19:12:17,919 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3382 transitions. [2023-08-29 19:12:17,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3382 transitions. [2023-08-29 19:12:17,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:12:17,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3382 transitions. [2023-08-29 19:12:17,924 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 19:12:17,929 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 19:12:17,930 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 19:12:17,930 INFO L175 Difference]: Start difference. First operand has 203 places, 197 transitions, 525 flow. Second operand 6 states and 3382 transitions. [2023-08-29 19:12:17,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 331 transitions, 1313 flow [2023-08-29 19:12:17,964 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 19:12:17,966 INFO L231 Difference]: Finished difference. Result has 201 places, 195 transitions, 521 flow [2023-08-29 19:12:17,967 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 19:12:17,967 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -41 predicate places. [2023-08-29 19:12:17,967 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 195 transitions, 521 flow [2023-08-29 19:12:17,968 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 19:12:17,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:12:17,968 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 19:12:17,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 19:12:17,968 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 19:12:17,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:12:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash 714604569, now seen corresponding path program 1 times [2023-08-29 19:12:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:12:17,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259519973] [2023-08-29 19:12:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:12:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:12:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:12:18,004 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 19:12:18,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:12:18,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259519973] [2023-08-29 19:12:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259519973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:12:18,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:12:18,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:12:18,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464846611] [2023-08-29 19:12:18,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:12:18,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:12:18,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:12:18,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:12:18,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:12:18,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 19:12:18,013 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 19:12:18,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:12:18,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 19:12:18,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:12:20,535 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:20,535 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-29 19:12:20,536 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 19:12:20,536 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-29 19:12:20,536 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:12:20,612 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:20,613 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 19:12:20,613 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 19:12:20,613 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:12:20,613 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:12:20,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:20,620 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 19:12:20,620 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:20,620 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 19:12:20,620 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:12:20,829 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:20,829 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 19:12:20,829 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:12:20,829 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 19:12:20,830 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:12:20,842 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:20,842 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 19:12:20,842 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:12:20,842 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:20,842 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 19:12:20,951 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:20,952 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 19:12:20,952 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:12:20,952 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:20,952 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 19:12:20,952 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:20,952 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 19:12:20,952 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:20,952 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:12:20,952 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 19:12:21,014 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:21,014 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 19:12:21,015 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 19:12:21,015 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:12:21,015 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:21,025 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:21,025 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 19:12:21,025 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 19:12:21,025 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:12:21,025 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:21,075 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:21,075 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:21,076 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:21,076 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:21,076 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:21,091 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:21,091 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:21,091 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:21,091 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:21,091 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:21,091 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:21,092 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:21,092 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:21,092 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:21,092 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:21,155 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:21,155 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:21,155 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:21,156 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:21,156 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:21,156 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:21,156 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 19:12:21,156 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:12:21,156 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 19:12:21,156 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 19:12:21,157 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:21,157 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:21,157 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:21,157 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:21,157 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:21,157 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:21,157 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:21,157 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:21,157 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:21,158 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:21,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][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 19:12:21,158 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:21,158 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:21,158 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:21,158 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:22,799 INFO L130 PetriNetUnfolder]: 22940/56634 cut-off events. [2023-08-29 19:12:22,799 INFO L131 PetriNetUnfolder]: For 13840/15438 co-relation queries the response was YES. [2023-08-29 19:12:22,972 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 19:12:23,127 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 102 selfloop transitions, 3 changer transitions 0/228 dead transitions. [2023-08-29 19:12:23,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 228 transitions, 826 flow [2023-08-29 19:12:23,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:12:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:12:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2023-08-29 19:12:23,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042955326460481 [2023-08-29 19:12:23,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1761 transitions. [2023-08-29 19:12:23,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1761 transitions. [2023-08-29 19:12:23,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:12:23,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1761 transitions. [2023-08-29 19:12:23,133 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 19:12:23,135 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 19:12:23,135 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 19:12:23,135 INFO L175 Difference]: Start difference. First operand has 201 places, 195 transitions, 521 flow. Second operand 3 states and 1761 transitions. [2023-08-29 19:12:23,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 228 transitions, 826 flow [2023-08-29 19:12:23,164 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 19:12:23,166 INFO L231 Difference]: Finished difference. Result has 200 places, 197 transitions, 533 flow [2023-08-29 19:12:23,166 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 19:12:23,167 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -42 predicate places. [2023-08-29 19:12:23,167 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 197 transitions, 533 flow [2023-08-29 19:12:23,167 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 19:12:23,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:12:23,167 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 19:12:23,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 19:12:23,168 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 19:12:23,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:12:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1949526157, now seen corresponding path program 1 times [2023-08-29 19:12:23,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:12:23,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216103483] [2023-08-29 19:12:23,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:12:23,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:12:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:12:23,200 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 19:12:23,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:12:23,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216103483] [2023-08-29 19:12:23,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216103483] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:12:23,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:12:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:12:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385481011] [2023-08-29 19:12:23,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:12:23,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:12:23,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:12:23,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:12:23,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:12:23,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 19:12:23,208 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 19:12:23,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:12:23,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 19:12:23,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:12:25,846 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:25,846 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-29 19:12:25,847 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 19:12:25,847 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-29 19:12:25,847 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:12:25,942 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14, #race~A~0=|v_#race~A~0_153|} AuxVars[] AssignedVars[#race~A~0][55], [3#L51-1true, 43#L105-2true, 595#true, Black: 809#(not |thread3Thread1of1ForFork2_#t~short34#1|), 600#(= |#race~N~0| 0), 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 19:12:25,943 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 19:12:25,943 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:12:25,943 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:12:25,943 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 19:12:25,950 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:25,950 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 19:12:25,950 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:25,951 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 19:12:25,951 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 19:12:26,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][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 19:12:26,044 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 19:12:26,044 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:12:26,044 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:12:26,044 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 19:12:26,058 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:26,058 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 19:12:26,058 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:12:26,058 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:26,059 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 19:12:26,330 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:26,331 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 19:12:26,331 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 19:12:26,331 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:26,331 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:12:26,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][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 19:12:26,332 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 19:12:26,332 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:12:26,332 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 19:12:26,332 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:12:26,470 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:26,470 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 19:12:26,470 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 19:12:26,470 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:26,470 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:12:26,481 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:26,481 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 19:12:26,481 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 19:12:26,481 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:12:26,481 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:12:26,565 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:26,566 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:26,566 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:26,566 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:26,566 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:26,588 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:26,588 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:26,588 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:26,588 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:26,589 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:26,589 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:26,589 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 19:12:26,589 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:12:26,589 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:12:26,589 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 19:12:26,690 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:26,691 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:26,691 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:26,691 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:26,691 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:26,691 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:26,691 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:26,691 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:26,692 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:26,692 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:26,692 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2133] L50-2-->L51-1: Formula: (and (= |v_#race~A~0_153| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| v_~N~0_14)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, ~N~0=v_~N~0_14} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_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 19:12:26,692 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:26,692 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:26,692 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:26,692 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:26,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, 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 19:12:26,693 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 19:12:26,693 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:12:26,693 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 19:12:26,693 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 19:12:26,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, 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 19:12:26,693 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 19:12:26,693 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:12:26,694 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 19:12:26,694 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 19:12:29,441 INFO L130 PetriNetUnfolder]: 27259/72619 cut-off events. [2023-08-29 19:12:29,442 INFO L131 PetriNetUnfolder]: For 19984/21585 co-relation queries the response was YES. [2023-08-29 19:12:29,696 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 19:12:29,893 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 110 selfloop transitions, 3 changer transitions 0/236 dead transitions. [2023-08-29 19:12:29,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 236 transitions, 873 flow [2023-08-29 19:12:29,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:12:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:12:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1766 transitions. [2023-08-29 19:12:29,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057273768613975 [2023-08-29 19:12:29,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1766 transitions. [2023-08-29 19:12:29,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1766 transitions. [2023-08-29 19:12:29,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:12:29,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1766 transitions. [2023-08-29 19:12:29,899 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 19:12:29,901 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 19:12:29,901 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 19:12:29,901 INFO L175 Difference]: Start difference. First operand has 200 places, 197 transitions, 533 flow. Second operand 3 states and 1766 transitions. [2023-08-29 19:12:29,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 236 transitions, 873 flow [2023-08-29 19:12:29,996 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 19:12:29,998 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 549 flow [2023-08-29 19:12:29,998 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 19:12:29,998 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -40 predicate places. [2023-08-29 19:12:29,999 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 549 flow [2023-08-29 19:12:29,999 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 19:12:29,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:12:29,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, 1, 1, 1, 1, 1] [2023-08-29 19:12:29,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 19:12:29,999 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 19:12:30,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:12:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash -933145270, now seen corresponding path program 1 times [2023-08-29 19:12:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:12:30,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077574566] [2023-08-29 19:12:30,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:12:30,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:12:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:12:30,087 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 19:12:30,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:12:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077574566] [2023-08-29 19:12:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077574566] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:12:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315706186] [2023-08-29 19:12:30,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:12:30,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:12:30,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:12:30,089 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 19:12:30,091 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 19:12:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:12:30,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 19:12:30,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:12:30,251 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 19:12:30,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:12:30,273 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 19:12:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315706186] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 19:12:30,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:12:30,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-29 19:12:30,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351849334] [2023-08-29 19:12:30,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:12:30,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:12:30,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:12:30,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:12:30,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-29 19:12:30,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 538 out of 1164 [2023-08-29 19:12:30,431 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 19:12:30,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:12:30,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 538 of 1164 [2023-08-29 19:12:30,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:12:37,273 INFO L130 PetriNetUnfolder]: 27752/76157 cut-off events. [2023-08-29 19:12:37,273 INFO L131 PetriNetUnfolder]: For 23952/25632 co-relation queries the response was YES. [2023-08-29 19:12:37,577 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 19:12:37,786 INFO L137 encePairwiseOnDemand]: 1158/1164 looper letters, 111 selfloop transitions, 5 changer transitions 0/238 dead transitions. [2023-08-29 19:12:37,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 238 transitions, 902 flow [2023-08-29 19:12:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:12:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:12:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2785 transitions. [2023-08-29 19:12:37,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47852233676975947 [2023-08-29 19:12:37,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2785 transitions. [2023-08-29 19:12:37,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2785 transitions. [2023-08-29 19:12:37,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:12:37,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2785 transitions. [2023-08-29 19:12:37,793 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 19:12:37,796 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 19:12:37,796 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 19:12:37,797 INFO L175 Difference]: Start difference. First operand has 202 places, 199 transitions, 549 flow. Second operand 5 states and 2785 transitions. [2023-08-29 19:12:37,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 238 transitions, 902 flow [2023-08-29 19:12:38,074 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 19:12:38,076 INFO L231 Difference]: Finished difference. Result has 206 places, 200 transitions, 568 flow [2023-08-29 19:12:38,076 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 19:12:38,076 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -36 predicate places. [2023-08-29 19:12:38,077 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 568 flow [2023-08-29 19:12:38,077 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 19:12:38,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:12:38,077 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 19:12:38,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-29 19:12:38,281 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 19:12:38,282 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 19:12:38,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:12:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash 677930533, now seen corresponding path program 1 times [2023-08-29 19:12:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:12:38,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565601728] [2023-08-29 19:12:38,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:12:38,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:12:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:12:38,327 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 19:12:38,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:12:38,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565601728] [2023-08-29 19:12:38,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565601728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:12:38,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:12:38,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:12:38,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454183977] [2023-08-29 19:12:38,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:12:38,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:12:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:12:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:12:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:12:38,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 19:12:38,334 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 19:12:38,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:12:38,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 19:12:38,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:12:43,973 INFO L130 PetriNetUnfolder]: 23471/58266 cut-off events. [2023-08-29 19:12:43,973 INFO L131 PetriNetUnfolder]: For 25661/28434 co-relation queries the response was YES. [2023-08-29 19:12:44,206 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 19:12:44,379 INFO L137 encePairwiseOnDemand]: 1162/1164 looper letters, 106 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2023-08-29 19:12:44,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 231 transitions, 897 flow [2023-08-29 19:12:44,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:12:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:12:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1757 transitions. [2023-08-29 19:12:44,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031500572737686 [2023-08-29 19:12:44,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1757 transitions. [2023-08-29 19:12:44,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1757 transitions. [2023-08-29 19:12:44,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:12:44,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1757 transitions. [2023-08-29 19:12:44,384 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 19:12:44,413 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 19:12:44,413 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 19:12:44,413 INFO L175 Difference]: Start difference. First operand has 206 places, 200 transitions, 568 flow. Second operand 3 states and 1757 transitions. [2023-08-29 19:12:44,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 231 transitions, 897 flow [2023-08-29 19:12:44,565 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 19:12:44,567 INFO L231 Difference]: Finished difference. Result has 207 places, 199 transitions, 564 flow [2023-08-29 19:12:44,567 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 19:12:44,568 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -35 predicate places. [2023-08-29 19:12:44,568 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 199 transitions, 564 flow [2023-08-29 19:12:44,569 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 19:12:44,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:12:44,569 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 19:12:44,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 19:12:44,569 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 19:12:44,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:12:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash 305892674, now seen corresponding path program 1 times [2023-08-29 19:12:44,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:12:44,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211891615] [2023-08-29 19:12:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:12:44,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:12:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:12:44,603 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 19:12:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:12:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211891615] [2023-08-29 19:12:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211891615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:12:44,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:12:44,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:12:44,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809849873] [2023-08-29 19:12:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:12:44,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:12:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:12:44,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:12:44,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:12:44,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 1164 [2023-08-29 19:12:44,611 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 19:12:44,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:12:44,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 1164 [2023-08-29 19:12:44,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:12:49,732 INFO L130 PetriNetUnfolder]: 21742/53160 cut-off events. [2023-08-29 19:12:49,733 INFO L131 PetriNetUnfolder]: For 27678/30381 co-relation queries the response was YES. [2023-08-29 19:12:49,924 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 19:12:50,071 INFO L137 encePairwiseOnDemand]: 1162/1164 looper letters, 109 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2023-08-29 19:12:50,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 234 transitions, 900 flow [2023-08-29 19:12:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:12:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:12:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2023-08-29 19:12:50,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048682703321878 [2023-08-29 19:12:50,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2023-08-29 19:12:50,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2023-08-29 19:12:50,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:12:50,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2023-08-29 19:12:50,076 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 19:12:50,078 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 19:12:50,078 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 19:12:50,078 INFO L175 Difference]: Start difference. First operand has 207 places, 199 transitions, 564 flow. Second operand 3 states and 1763 transitions. [2023-08-29 19:12:50,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 234 transitions, 900 flow [2023-08-29 19:12:50,256 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 19:12:50,258 INFO L231 Difference]: Finished difference. Result has 209 places, 198 transitions, 564 flow [2023-08-29 19:12:50,258 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 19:12:50,258 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -33 predicate places. [2023-08-29 19:12:50,258 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 198 transitions, 564 flow [2023-08-29 19:12:50,259 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 19:12:50,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:12:50,259 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 19:12:50,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 19:12:50,259 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 19:12:50,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:12:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1960279651, now seen corresponding path program 1 times [2023-08-29 19:12:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:12:50,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673762813] [2023-08-29 19:12:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:12:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:12:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:12:50,288 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 19:12:50,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:12:50,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673762813] [2023-08-29 19:12:50,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673762813] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:12:50,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:12:50,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:12:50,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285128409] [2023-08-29 19:12:50,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:12:50,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:12:50,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:12:50,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:12:50,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:12:50,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 1164 [2023-08-29 19:12:50,304 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 19:12:50,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:12:50,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 1164 [2023-08-29 19:12:50,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:12:55,948 INFO L130 PetriNetUnfolder]: 26021/62543 cut-off events. [2023-08-29 19:12:55,948 INFO L131 PetriNetUnfolder]: For 31861/34905 co-relation queries the response was YES. [2023-08-29 19:12:56,229 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 19:12:56,404 INFO L137 encePairwiseOnDemand]: 1160/1164 looper letters, 76 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2023-08-29 19:12:56,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 195 transitions, 714 flow [2023-08-29 19:12:56,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:12:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:12:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1693 transitions. [2023-08-29 19:12:56,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4848224513172967 [2023-08-29 19:12:56,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1693 transitions. [2023-08-29 19:12:56,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1693 transitions. [2023-08-29 19:12:56,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:12:56,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1693 transitions. [2023-08-29 19:12:56,409 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 19:12:56,410 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 19:12:56,411 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 19:12:56,411 INFO L175 Difference]: Start difference. First operand has 209 places, 198 transitions, 564 flow. Second operand 3 states and 1693 transitions. [2023-08-29 19:12:56,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 195 transitions, 714 flow [2023-08-29 19:12:57,098 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 19:12:57,099 INFO L231 Difference]: Finished difference. Result has 207 places, 195 transitions, 560 flow [2023-08-29 19:12:57,100 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 19:12:57,100 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -35 predicate places. [2023-08-29 19:12:57,100 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 195 transitions, 560 flow [2023-08-29 19:12:57,100 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 19:12:57,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:12:57,101 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 19:12:57,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 19:12:57,101 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 19:12:57,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:12:57,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1662410549, now seen corresponding path program 1 times [2023-08-29 19:12:57,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:12:57,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538489372] [2023-08-29 19:12:57,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:12:57,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:12:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:12:57,129 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 19:12:57,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:12:57,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538489372] [2023-08-29 19:12:57,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538489372] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:12:57,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:12:57,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:12:57,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415226071] [2023-08-29 19:12:57,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:12:57,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:12:57,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:12:57,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:12:57,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:12:57,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 1164 [2023-08-29 19:12:57,146 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 19:12:57,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:12:57,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 1164 [2023-08-29 19:12:57,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:13:04,005 INFO L130 PetriNetUnfolder]: 33826/73303 cut-off events. [2023-08-29 19:13:04,006 INFO L131 PetriNetUnfolder]: For 38933/43007 co-relation queries the response was YES. [2023-08-29 19:13:04,324 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 19:13:04,517 INFO L137 encePairwiseOnDemand]: 1155/1164 looper letters, 110 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2023-08-29 19:13:04,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 222 transitions, 891 flow [2023-08-29 19:13:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:13:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:13:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1727 transitions. [2023-08-29 19:13:04,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945589919816724 [2023-08-29 19:13:04,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1727 transitions. [2023-08-29 19:13:04,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1727 transitions. [2023-08-29 19:13:04,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:13:04,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1727 transitions. [2023-08-29 19:13:04,522 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 19:13:04,524 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 19:13:04,524 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 19:13:04,524 INFO L175 Difference]: Start difference. First operand has 207 places, 195 transitions, 560 flow. Second operand 3 states and 1727 transitions. [2023-08-29 19:13:04,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 222 transitions, 891 flow [2023-08-29 19:13:04,706 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 19:13:04,707 INFO L231 Difference]: Finished difference. Result has 203 places, 192 transitions, 573 flow [2023-08-29 19:13:04,708 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 19:13:04,708 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -39 predicate places. [2023-08-29 19:13:04,708 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 192 transitions, 573 flow [2023-08-29 19:13:04,708 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 19:13:04,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:13:04,709 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 19:13:04,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 19:13:04,709 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 19:13:04,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:13:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1321343099, now seen corresponding path program 1 times [2023-08-29 19:13:04,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:13:04,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932289762] [2023-08-29 19:13:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:13:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:13:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:13:04,833 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 19:13:04,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:13:04,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932289762] [2023-08-29 19:13:04,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932289762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:13:04,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:13:04,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 19:13:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829197196] [2023-08-29 19:13:04,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:13:04,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 19:13:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:13:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 19:13:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 19:13:05,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 1164 [2023-08-29 19:13:05,322 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 19:13:05,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:13:05,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 1164 [2023-08-29 19:13:05,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:13:25,835 INFO L130 PetriNetUnfolder]: 82021/178315 cut-off events. [2023-08-29 19:13:25,835 INFO L131 PetriNetUnfolder]: For 97794/103459 co-relation queries the response was YES. [2023-08-29 19:13:26,932 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 19:13:27,612 INFO L137 encePairwiseOnDemand]: 1151/1164 looper letters, 467 selfloop transitions, 27 changer transitions 0/605 dead transitions. [2023-08-29 19:13:27,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 605 transitions, 2983 flow [2023-08-29 19:13:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-29 19:13:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-29 19:13:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 7927 transitions. [2023-08-29 19:13:27,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48643838978890525 [2023-08-29 19:13:27,623 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 7927 transitions. [2023-08-29 19:13:27,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 7927 transitions. [2023-08-29 19:13:27,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:13:27,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 7927 transitions. [2023-08-29 19:13:27,631 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 19:13:27,639 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 19:13:27,640 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 19:13:27,640 INFO L175 Difference]: Start difference. First operand has 203 places, 192 transitions, 573 flow. Second operand 14 states and 7927 transitions. [2023-08-29 19:13:27,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 605 transitions, 2983 flow [2023-08-29 19:13:34,939 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 19:13:34,943 INFO L231 Difference]: Finished difference. Result has 226 places, 216 transitions, 782 flow [2023-08-29 19:13:34,943 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 19:13:34,943 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -16 predicate places. [2023-08-29 19:13:34,944 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 216 transitions, 782 flow [2023-08-29 19:13:34,944 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 19:13:34,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:13:34,944 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 19:13:34,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 19:13:34,945 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 19:13:34,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:13:34,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2009704277, now seen corresponding path program 1 times [2023-08-29 19:13:34,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:13:34,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249785472] [2023-08-29 19:13:34,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:13:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:13:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:13:35,202 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 19:13:35,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:13:35,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249785472] [2023-08-29 19:13:35,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249785472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:13:35,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:13:35,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:13:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885368691] [2023-08-29 19:13:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:13:35,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:13:35,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:13:35,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:13:35,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:13:35,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-29 19:13:35,790 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 19:13:35,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:13:35,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-29 19:13:35,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:14:00,262 INFO L130 PetriNetUnfolder]: 100817/199713 cut-off events. [2023-08-29 19:14:00,262 INFO L131 PetriNetUnfolder]: For 187190/196292 co-relation queries the response was YES. [2023-08-29 19:14:01,837 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 19:14:02,483 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 249 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2023-08-29 19:14:02,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 358 transitions, 1794 flow [2023-08-29 19:14:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:14:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:14:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3382 transitions. [2023-08-29 19:14:02,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48424971363115693 [2023-08-29 19:14:02,488 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3382 transitions. [2023-08-29 19:14:02,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3382 transitions. [2023-08-29 19:14:02,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:14:02,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3382 transitions. [2023-08-29 19:14:02,650 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 19:14:02,653 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 19:14:02,653 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 19:14:02,653 INFO L175 Difference]: Start difference. First operand has 226 places, 216 transitions, 782 flow. Second operand 6 states and 3382 transitions. [2023-08-29 19:14:02,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 358 transitions, 1794 flow [2023-08-29 19:14:04,884 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 19:14:04,887 INFO L231 Difference]: Finished difference. Result has 228 places, 214 transitions, 785 flow [2023-08-29 19:14:04,887 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 19:14:04,887 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -14 predicate places. [2023-08-29 19:14:04,887 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 214 transitions, 785 flow [2023-08-29 19:14:04,888 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 19:14:04,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:14:04,888 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 19:14:04,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 19:14:04,888 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 19:14:04,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:14:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash 497589136, now seen corresponding path program 1 times [2023-08-29 19:14:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:14:04,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169331509] [2023-08-29 19:14:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:14:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:14:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:14:05,053 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 19:14:05,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:14:05,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169331509] [2023-08-29 19:14:05,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169331509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:14:05,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:14:05,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 19:14:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147100034] [2023-08-29 19:14:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:14:05,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 19:14:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:14:05,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 19:14:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-29 19:14:05,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 1164 [2023-08-29 19:14:05,740 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 19:14:05,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:14:05,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 1164 [2023-08-29 19:14:05,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:14:22,536 INFO L130 PetriNetUnfolder]: 59355/130753 cut-off events. [2023-08-29 19:14:22,537 INFO L131 PetriNetUnfolder]: For 139784/148586 co-relation queries the response was YES. [2023-08-29 19:14:23,529 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 19:14:23,883 INFO L137 encePairwiseOnDemand]: 1152/1164 looper letters, 428 selfloop transitions, 15 changer transitions 0/557 dead transitions. [2023-08-29 19:14:23,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 557 transitions, 3330 flow [2023-08-29 19:14:23,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 19:14:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 19:14:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7226 transitions. [2023-08-29 19:14:23,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47753106000528683 [2023-08-29 19:14:23,888 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 7226 transitions. [2023-08-29 19:14:23,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 7226 transitions. [2023-08-29 19:14:23,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:14:23,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 7226 transitions. [2023-08-29 19:14:23,902 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 19:14:23,908 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 19:14:23,909 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 19:14:23,909 INFO L175 Difference]: Start difference. First operand has 228 places, 214 transitions, 785 flow. Second operand 13 states and 7226 transitions. [2023-08-29 19:14:23,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 557 transitions, 3330 flow [2023-08-29 19:14:27,142 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 19:14:27,146 INFO L231 Difference]: Finished difference. Result has 242 places, 221 transitions, 859 flow [2023-08-29 19:14:27,146 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 19:14:27,146 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, 0 predicate places. [2023-08-29 19:14:27,146 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 221 transitions, 859 flow [2023-08-29 19:14:27,147 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 19:14:27,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:14:27,147 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 19:14:27,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 19:14:27,147 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 19:14:27,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:14:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash 751981737, now seen corresponding path program 1 times [2023-08-29 19:14:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:14:27,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685362448] [2023-08-29 19:14:27,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:14:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:14:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:14:27,558 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 19:14:27,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:14:27,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685362448] [2023-08-29 19:14:27,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685362448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:14:27,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:14:27,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:14:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505774736] [2023-08-29 19:14:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:14:27,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:14:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:14:27,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:14:27,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:14:28,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 1164 [2023-08-29 19:14:28,113 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 19:14:28,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:14:28,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 1164 [2023-08-29 19:14:28,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:14:46,786 INFO L130 PetriNetUnfolder]: 67672/146458 cut-off events. [2023-08-29 19:14:46,786 INFO L131 PetriNetUnfolder]: For 180662/190263 co-relation queries the response was YES. [2023-08-29 19:14:48,228 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 19:14:48,672 INFO L137 encePairwiseOnDemand]: 1157/1164 looper letters, 234 selfloop transitions, 5 changer transitions 0/343 dead transitions. [2023-08-29 19:14:48,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 343 transitions, 1873 flow [2023-08-29 19:14:48,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:14:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:14:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3356 transitions. [2023-08-29 19:14:48,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805269186712486 [2023-08-29 19:14:48,677 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3356 transitions. [2023-08-29 19:14:48,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3356 transitions. [2023-08-29 19:14:48,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:14:48,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3356 transitions. [2023-08-29 19:14:48,679 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 19:14:48,699 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 19:14:48,700 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 19:14:48,700 INFO L175 Difference]: Start difference. First operand has 242 places, 221 transitions, 859 flow. Second operand 6 states and 3356 transitions. [2023-08-29 19:14:48,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 343 transitions, 1873 flow [2023-08-29 19:14:51,216 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 19:14:51,219 INFO L231 Difference]: Finished difference. Result has 243 places, 219 transitions, 856 flow [2023-08-29 19:14:51,219 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 19:14:51,220 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, 1 predicate places. [2023-08-29 19:14:51,220 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 219 transitions, 856 flow [2023-08-29 19:14:51,224 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 19:14:51,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:14:51,224 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 19:14:51,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 19:14:51,224 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 19:14:51,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:14:51,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1273868743, now seen corresponding path program 1 times [2023-08-29 19:14:51,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:14:51,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813194577] [2023-08-29 19:14:51,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:14:51,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:14:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:14:51,354 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 19:14:51,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:14:51,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813194577] [2023-08-29 19:14:51,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813194577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:14:51,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:14:51,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 19:14:51,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12594016] [2023-08-29 19:14:51,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:14:51,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 19:14:51,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:14:51,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 19:14:51,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 19:14:51,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 1164 [2023-08-29 19:14:51,892 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 19:14:51,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:14:51,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 1164 [2023-08-29 19:14:51,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand