/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:16:10,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:16:10,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:16:10,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:16:10,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:16:10,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:16:10,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:16:10,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:16:10,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:16:10,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:16:10,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:16:10,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:16:10,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:16:10,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:16:10,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:16:10,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:16:10,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:16:10,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:16:10,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:16:10,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:16:10,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:16:10,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:16:10,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:16:10,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:16:10,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:16:10,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:16:10,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:16:10,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:16:10,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:16:10,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:16:10,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:16:10,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:16:10,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:16:10,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:16:10,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:16:10,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:16:10,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:16:10,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:16:10,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:16:10,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:16:10,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:16:10,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:16:10,533 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:16:10,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:16:10,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:16:10,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:16:10,536 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:16:10,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:16:10,537 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:16:10,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:16:10,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:16:10,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:16:10,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:16:10,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:16:10,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:16:10,538 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:16:10,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:16:10,539 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:16:10,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:16:10,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:16:10,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:16:10,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:16:10,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:16:10,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:16:10,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:16:10,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:16:10,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:16:10,540 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:16:10,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:16:10,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:16:10,541 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:16:10,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-13 09:16:10,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:16:10,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:16:10,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:16:10,835 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:16:10,835 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:16:10,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2022-12-13 09:16:12,005 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:16:12,251 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:16:12,252 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2022-12-13 09:16:12,273 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b1f333f6/93b30e51bba448cbb8dd872cfd2add83/FLAGf867e5851 [2022-12-13 09:16:12,293 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b1f333f6/93b30e51bba448cbb8dd872cfd2add83 [2022-12-13 09:16:12,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:16:12,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:16:12,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:16:12,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:16:12,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:16:12,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551ac2a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12, skipping insertion in model container [2022-12-13 09:16:12,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:16:12,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:16:12,537 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 09:16:12,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:12,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:12,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:12,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:12,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:12,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:12,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:12,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:12,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:12,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:12,680 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i[31246,31259] [2022-12-13 09:16:12,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:16:12,704 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:16:12,727 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 09:16:12,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:12,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:12,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:12,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:12,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:12,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:12,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:12,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:12,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:12,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:12,749 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i[31246,31259] [2022-12-13 09:16:12,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:16:12,795 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:16:12,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12 WrapperNode [2022-12-13 09:16:12,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:16:12,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:16:12,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:16:12,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:16:12,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,851 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2022-12-13 09:16:12,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:16:12,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:16:12,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:16:12,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:16:12,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,886 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:16:12,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:16:12,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:16:12,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:16:12,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (1/1) ... [2022-12-13 09:16:12,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:16:12,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:16:12,932 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) [2022-12-13 09:16:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 09:16:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:16:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:16:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:16:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-12-13 09:16:12,980 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-12-13 09:16:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:16:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:16:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:16:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:16:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:16:12,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:16:12,981 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-12-13 09:16:12,981 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-12-13 09:16:12,963 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 [2022-12-13 09:16:12,983 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:16:13,139 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:16:13,141 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:16:13,293 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:16:13,322 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:16:13,322 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:16:13,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:16:13 BoogieIcfgContainer [2022-12-13 09:16:13,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:16:13,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:16:13,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:16:13,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:16:13,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:16:12" (1/3) ... [2022-12-13 09:16:13,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391179f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:16:13, skipping insertion in model container [2022-12-13 09:16:13,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:12" (2/3) ... [2022-12-13 09:16:13,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391179f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:16:13, skipping insertion in model container [2022-12-13 09:16:13,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:16:13" (3/3) ... [2022-12-13 09:16:13,332 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2022-12-13 09:16:13,349 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:16:13,349 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 09:16:13,349 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:16:13,418 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 09:16:13,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 248 flow [2022-12-13 09:16:13,492 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 09:16:13,492 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:16:13,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 104 events. 2/104 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 09:16:13,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 108 transitions, 248 flow [2022-12-13 09:16:13,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 91 transitions, 203 flow [2022-12-13 09:16:13,503 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:16:13,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 91 transitions, 203 flow [2022-12-13 09:16:13,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 91 transitions, 203 flow [2022-12-13 09:16:13,565 INFO L130 PetriNetUnfolder]: 2/91 cut-off events. [2022-12-13 09:16:13,565 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:16:13,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 91 events. 2/91 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 09:16:13,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 91 transitions, 203 flow [2022-12-13 09:16:13,570 INFO L226 LiptonReduction]: Number of co-enabled transitions 2408 [2022-12-13 09:16:16,557 INFO L241 LiptonReduction]: Total number of compositions: 56 [2022-12-13 09:16:16,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:16:16,585 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@1d4cd8ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:16:16,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 09:16:16,597 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 09:16:16,598 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:16:16,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:16:16,599 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:16:16,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:16:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:16:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1333688522, now seen corresponding path program 1 times [2022-12-13 09:16:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:16:16,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788188693] [2022-12-13 09:16:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:16:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:16:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:16:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:16:16,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:16:16,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788188693] [2022-12-13 09:16:16,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788188693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:16:16,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:16:16,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:16:16,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857240532] [2022-12-13 09:16:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:16:16,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:16:16,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:16:16,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:16:16,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:16:16,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 66 [2022-12-13 09:16:16,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:16:16,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:16:16,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 66 [2022-12-13 09:16:16,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:16:24,234 INFO L130 PetriNetUnfolder]: 109745/149322 cut-off events. [2022-12-13 09:16:24,235 INFO L131 PetriNetUnfolder]: For 7305/7305 co-relation queries the response was YES. [2022-12-13 09:16:24,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300598 conditions, 149322 events. 109745/149322 cut-off events. For 7305/7305 co-relation queries the response was YES. Maximal size of possible extension queue 4682. Compared 993307 event pairs, 17109 based on Foata normal form. 0/88625 useless extension candidates. Maximal degree in co-relation 264183. Up to 62418 conditions per place. [2022-12-13 09:16:25,113 INFO L137 encePairwiseOnDemand]: 56/66 looper letters, 230 selfloop transitions, 22 changer transitions 16/280 dead transitions. [2022-12-13 09:16:25,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 280 transitions, 1183 flow [2022-12-13 09:16:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:16:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:16:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 368 transitions. [2022-12-13 09:16:25,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2022-12-13 09:16:25,125 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 153 flow. Second operand 8 states and 368 transitions. [2022-12-13 09:16:25,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 280 transitions, 1183 flow [2022-12-13 09:16:25,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 280 transitions, 1131 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-12-13 09:16:25,205 INFO L231 Difference]: Finished difference. Result has 85 places, 86 transitions, 291 flow [2022-12-13 09:16:25,206 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=291, PETRI_PLACES=85, PETRI_TRANSITIONS=86} [2022-12-13 09:16:25,209 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 6 predicate places. [2022-12-13 09:16:25,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:16:25,210 INFO L89 Accepts]: Start accepts. Operand has 85 places, 86 transitions, 291 flow [2022-12-13 09:16:25,215 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:16:25,215 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:16:25,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 86 transitions, 291 flow [2022-12-13 09:16:25,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 86 transitions, 291 flow [2022-12-13 09:16:25,258 INFO L130 PetriNetUnfolder]: 67/517 cut-off events. [2022-12-13 09:16:25,259 INFO L131 PetriNetUnfolder]: For 135/161 co-relation queries the response was YES. [2022-12-13 09:16:25,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 517 events. 67/517 cut-off events. For 135/161 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4195 event pairs, 5 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 814. Up to 68 conditions per place. [2022-12-13 09:16:25,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 86 transitions, 291 flow [2022-12-13 09:16:25,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 3310 [2022-12-13 09:16:25,314 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:16:25,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 09:16:25,316 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 291 flow [2022-12-13 09:16:25,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:16:25,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:16:25,316 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:16:25,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:16:25,317 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:16:25,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:16:25,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1067361701, now seen corresponding path program 1 times [2022-12-13 09:16:25,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:16:25,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654333361] [2022-12-13 09:16:25,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:16:25,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:16:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:16:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:16:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:16:25,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654333361] [2022-12-13 09:16:25,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654333361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:16:25,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:16:25,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:16:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601282811] [2022-12-13 09:16:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:16:25,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:16:25,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:16:25,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:16:25,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:16:25,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66 [2022-12-13 09:16:25,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:16:25,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:16:25,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66 [2022-12-13 09:16:25,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:16:30,753 INFO L130 PetriNetUnfolder]: 67941/101262 cut-off events. [2022-12-13 09:16:30,753 INFO L131 PetriNetUnfolder]: For 23005/25843 co-relation queries the response was YES. [2022-12-13 09:16:30,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221339 conditions, 101262 events. 67941/101262 cut-off events. For 23005/25843 co-relation queries the response was YES. Maximal size of possible extension queue 5963. Compared 847539 event pairs, 24315 based on Foata normal form. 4111/56132 useless extension candidates. Maximal degree in co-relation 149813. Up to 58627 conditions per place. [2022-12-13 09:16:31,227 INFO L137 encePairwiseOnDemand]: 56/66 looper letters, 74 selfloop transitions, 8 changer transitions 0/120 dead transitions. [2022-12-13 09:16:31,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 120 transitions, 548 flow [2022-12-13 09:16:31,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:16:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:16:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2022-12-13 09:16:31,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7171717171717171 [2022-12-13 09:16:31,229 INFO L175 Difference]: Start difference. First operand has 85 places, 86 transitions, 291 flow. Second operand 3 states and 142 transitions. [2022-12-13 09:16:31,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 120 transitions, 548 flow [2022-12-13 09:16:31,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 120 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:16:31,466 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 319 flow [2022-12-13 09:16:31,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2022-12-13 09:16:31,467 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 9 predicate places. [2022-12-13 09:16:31,467 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:16:31,467 INFO L89 Accepts]: Start accepts. Operand has 88 places, 86 transitions, 319 flow [2022-12-13 09:16:31,468 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:16:31,468 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:16:31,468 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 86 transitions, 319 flow [2022-12-13 09:16:31,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 86 transitions, 319 flow [2022-12-13 09:16:31,572 INFO L130 PetriNetUnfolder]: 342/1868 cut-off events. [2022-12-13 09:16:31,573 INFO L131 PetriNetUnfolder]: For 355/370 co-relation queries the response was YES. [2022-12-13 09:16:31,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3586 conditions, 1868 events. 342/1868 cut-off events. For 355/370 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 20297 event pairs, 132 based on Foata normal form. 0/1129 useless extension candidates. Maximal degree in co-relation 3554. Up to 392 conditions per place. [2022-12-13 09:16:31,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 86 transitions, 319 flow [2022-12-13 09:16:31,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 3116 [2022-12-13 09:16:31,622 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:16:31,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 09:16:31,623 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 319 flow [2022-12-13 09:16:31,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:16:31,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:16:31,624 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:16:31,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:16:31,624 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:16:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:16:31,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1853365325, now seen corresponding path program 2 times [2022-12-13 09:16:31,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:16:31,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759112071] [2022-12-13 09:16:31,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:16:31,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:16:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:16:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:16:31,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:16:31,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759112071] [2022-12-13 09:16:31,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759112071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:16:31,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:16:31,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:16:31,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190216012] [2022-12-13 09:16:31,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:16:31,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:16:31,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:16:31,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:16:31,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:16:31,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66 [2022-12-13 09:16:31,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:16:31,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:16:31,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66 [2022-12-13 09:16:31,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:16:33,461 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [60#L748-4true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 129#true, 204#true]) [2022-12-13 09:16:33,461 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,461 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,462 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,462 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,462 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [60#L748-4true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 129#true, 204#true]) [2022-12-13 09:16:33,462 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,462 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,462 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,462 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,463 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [60#L748-4true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 123#true, 129#true, 204#true]) [2022-12-13 09:16:33,463 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,463 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,463 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,463 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,463 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [60#L748-4true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 123#true, 129#true, 204#true]) [2022-12-13 09:16:33,463 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,463 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,463 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,463 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,464 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [60#L748-4true, 139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 129#true, 204#true]) [2022-12-13 09:16:33,464 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,464 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,464 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,464 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,464 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [60#L748-4true, 139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 129#true, 204#true]) [2022-12-13 09:16:33,465 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,465 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,465 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,465 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,465 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [60#L748-4true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:33,466 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,466 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,466 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,466 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,466 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [60#L748-4true, 83#writerEXITtrue, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:33,466 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,466 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,466 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,466 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,467 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [60#L748-4true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 123#true, 204#true]) [2022-12-13 09:16:33,467 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,467 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,467 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,467 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,468 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [60#L748-4true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 123#true, 204#true]) [2022-12-13 09:16:33,468 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,468 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,468 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,468 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,469 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [60#L748-4true, 139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:33,469 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,469 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,469 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,469 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,469 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [60#L748-4true, 139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:33,469 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,470 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,470 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,470 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,473 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [60#L748-4true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:33,473 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,473 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,473 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,473 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,473 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [60#L748-4true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:33,473 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,473 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,473 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,473 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,474 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [60#L748-4true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 123#true, 204#true]) [2022-12-13 09:16:33,474 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,474 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,474 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,474 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,474 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [60#L748-4true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 123#true, 204#true]) [2022-12-13 09:16:33,474 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,474 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,475 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,475 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,475 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [60#L748-4true, 139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:33,475 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,475 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,475 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,475 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,475 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [60#L748-4true, 139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:33,476 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,476 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,476 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:33,476 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 09:16:34,251 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 129#true, 204#true]) [2022-12-13 09:16:34,251 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,251 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,251 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,252 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,252 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 129#true, 204#true]) [2022-12-13 09:16:34,252 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,252 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,252 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,252 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,252 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 123#true, 129#true, 204#true]) [2022-12-13 09:16:34,253 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,253 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,253 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,253 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,253 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 123#true, 129#true, 204#true]) [2022-12-13 09:16:34,253 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,253 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,253 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,253 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,254 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 129#true, 204#true]) [2022-12-13 09:16:34,254 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,254 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,254 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,254 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,254 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 129#true, 204#true]) [2022-12-13 09:16:34,254 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,254 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,254 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,254 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,255 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 129#true, 204#true]) [2022-12-13 09:16:34,255 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,255 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,255 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,255 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,255 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 129#true, 204#true]) [2022-12-13 09:16:34,255 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,255 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,255 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,255 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,256 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 123#true, 129#true, 204#true]) [2022-12-13 09:16:34,256 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,256 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,256 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,256 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,256 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 123#true, 129#true, 204#true]) [2022-12-13 09:16:34,256 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,256 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,256 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,256 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,257 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 129#true, 204#true]) [2022-12-13 09:16:34,257 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,257 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,257 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,257 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,257 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 129#true, 204#true]) [2022-12-13 09:16:34,257 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,257 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,257 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,257 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,259 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [83#writerEXITtrue, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:34,259 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,259 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,261 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,261 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,261 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [83#writerEXITtrue, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:34,261 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,262 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,262 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,262 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,262 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 123#true, 204#true]) [2022-12-13 09:16:34,262 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,262 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,262 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,265 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,265 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 123#true, 204#true]) [2022-12-13 09:16:34,266 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,266 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,266 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,266 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,266 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:34,266 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,266 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,266 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,267 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,267 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:34,267 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,267 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,267 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,267 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,267 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:34,267 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,267 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,267 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,267 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,267 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:34,268 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,268 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,268 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,268 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,268 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 123#true, 204#true]) [2022-12-13 09:16:34,268 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,268 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,268 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,268 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,268 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 123#true, 204#true]) [2022-12-13 09:16:34,268 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,269 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,269 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,269 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,269 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:34,269 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,269 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,269 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,269 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,269 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), 136#true, readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:34,269 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,269 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,269 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,269 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,272 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:34,272 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,272 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,272 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,272 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,272 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [83#writerEXITtrue, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:34,272 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,272 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,272 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,272 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,273 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 123#true, 204#true]) [2022-12-13 09:16:34,273 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,273 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,273 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,273 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,273 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 123#true, 204#true]) [2022-12-13 09:16:34,273 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,273 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,273 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,273 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,274 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:34,274 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,274 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,274 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,274 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,274 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 148#true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:34,274 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,274 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,274 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,274 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,274 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:34,274 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,274 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:34,275 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 123#true, 204#true]) [2022-12-13 09:16:34,275 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 123#true, 204#true]) [2022-12-13 09:16:34,275 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,275 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,276 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,276 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:34,276 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,276 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,276 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,276 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,276 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), 44#L749-1true, Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 88#writerEXITtrue, Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:34,276 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,276 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,276 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:34,276 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 09:16:35,047 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 103#L749-2true, 204#true]) [2022-12-13 09:16:35,048 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,048 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,048 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,048 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,048 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 103#L749-2true, 204#true]) [2022-12-13 09:16:35,048 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,048 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,048 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,048 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,049 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 123#true, 103#L749-2true, 204#true]) [2022-12-13 09:16:35,049 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,049 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,049 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,049 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,049 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 123#true, 103#L749-2true, 204#true]) [2022-12-13 09:16:35,049 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,049 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,049 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,049 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,050 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 103#L749-2true, 204#true]) [2022-12-13 09:16:35,050 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,050 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,050 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,050 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,050 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 103#L749-2true, 204#true]) [2022-12-13 09:16:35,050 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,050 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,050 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:35,050 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 09:16:36,201 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 83#writerEXITtrue, Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 105#L750-1true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:36,201 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,201 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,201 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,201 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,201 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [83#writerEXITtrue, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 105#L750-1true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:36,202 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,202 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,202 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,202 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,202 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 105#L750-1true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 123#true, 204#true]) [2022-12-13 09:16:36,202 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,202 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,202 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,202 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,202 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 105#L750-1true, 153#true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 123#true, 204#true]) [2022-12-13 09:16:36,203 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,203 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,203 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,203 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,203 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([300] L735-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_readerThread1of1ForFork3_~lx~0#1_19| |v_readerThread1of1ForFork3_~ly~0#1_19|)) (= |v_readerThread1of1ForFork3_~lx~0#1_19| v_~x~0_42)) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, ~x~0=v_~x~0_42} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_19|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][162], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 105#L750-1true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 67#readerErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 204#true]) [2022-12-13 09:16:36,203 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,204 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,204 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,204 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,204 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([285] L735-->L739: Formula: (and (= |v_readerThread1of1ForFork3_~lx~0#1_13| v_~x~0_16) (not (= |v_readerThread1of1ForFork3_~lx~0#1_13| |v_readerThread1of1ForFork3_~ly~0#1_11|))) InVars {readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, ~x~0=v_~x~0_16} OutVars{readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_11|, readerThread1of1ForFork3_~lx~0#1=|v_readerThread1of1ForFork3_~lx~0#1_13|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[readerThread1of1ForFork3_~lx~0#1][163], [139#true, Black: 161#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 156#(= ~y~0 ~x~0), Black: 159#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 163#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 153#true, 105#L750-1true, 94#L732true, Black: 206#(= ~w~0 1), readerThread1of1ForFork2InUse, 236#(= ~r~0 0), 135#true, 204#true]) [2022-12-13 09:16:36,204 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,204 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,204 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:36,204 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 09:16:38,561 INFO L130 PetriNetUnfolder]: 84128/130665 cut-off events. [2022-12-13 09:16:38,561 INFO L131 PetriNetUnfolder]: For 64119/66468 co-relation queries the response was YES. [2022-12-13 09:16:38,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345022 conditions, 130665 events. 84128/130665 cut-off events. For 64119/66468 co-relation queries the response was YES. Maximal size of possible extension queue 12303. Compared 1243799 event pairs, 10650 based on Foata normal form. 4447/72091 useless extension candidates. Maximal degree in co-relation 216479. Up to 45395 conditions per place. [2022-12-13 09:16:39,177 INFO L137 encePairwiseOnDemand]: 49/66 looper letters, 99 selfloop transitions, 39 changer transitions 30/206 dead transitions. [2022-12-13 09:16:39,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 206 transitions, 1020 flow [2022-12-13 09:16:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:16:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:16:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 262 transitions. [2022-12-13 09:16:39,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.793939393939394 [2022-12-13 09:16:39,179 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 319 flow. Second operand 5 states and 262 transitions. [2022-12-13 09:16:39,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 206 transitions, 1020 flow [2022-12-13 09:16:40,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 206 transitions, 976 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:16:40,087 INFO L231 Difference]: Finished difference. Result has 90 places, 113 transitions, 467 flow [2022-12-13 09:16:40,087 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=467, PETRI_PLACES=90, PETRI_TRANSITIONS=113} [2022-12-13 09:16:40,087 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 11 predicate places. [2022-12-13 09:16:40,088 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:16:40,088 INFO L89 Accepts]: Start accepts. Operand has 90 places, 113 transitions, 467 flow [2022-12-13 09:16:40,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:16:40,089 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:16:40,089 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 113 transitions, 467 flow [2022-12-13 09:16:40,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 113 transitions, 467 flow [2022-12-13 09:16:40,676 INFO L130 PetriNetUnfolder]: 6919/14414 cut-off events. [2022-12-13 09:16:40,676 INFO L131 PetriNetUnfolder]: For 1883/2014 co-relation queries the response was YES. [2022-12-13 09:16:40,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31540 conditions, 14414 events. 6919/14414 cut-off events. For 1883/2014 co-relation queries the response was YES. Maximal size of possible extension queue 2317. Compared 152784 event pairs, 402 based on Foata normal form. 1/6044 useless extension candidates. Maximal degree in co-relation 31510. Up to 6699 conditions per place. [2022-12-13 09:16:40,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 113 transitions, 467 flow [2022-12-13 09:16:40,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 3868 [2022-12-13 09:16:40,878 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:16:40,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 792 [2022-12-13 09:16:40,880 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 113 transitions, 467 flow [2022-12-13 09:16:40,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:16:40,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:16:40,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:16:40,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:16:40,880 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:16:40,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:16:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash -206544267, now seen corresponding path program 1 times [2022-12-13 09:16:40,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:16:40,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677569570] [2022-12-13 09:16:40,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:16:40,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:16:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:16:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:16:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:16:40,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677569570] [2022-12-13 09:16:40,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677569570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:16:40,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:16:40,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:16:40,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613741341] [2022-12-13 09:16:40,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:16:40,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:16:40,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:16:40,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:16:40,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:16:40,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 63 [2022-12-13 09:16:40,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 113 transitions, 467 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:16:40,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:16:40,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 63 [2022-12-13 09:16:40,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:04,856 INFO L130 PetriNetUnfolder]: 279920/418533 cut-off events. [2022-12-13 09:17:04,857 INFO L131 PetriNetUnfolder]: For 222086/222683 co-relation queries the response was YES. [2022-12-13 09:17:06,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201015 conditions, 418533 events. 279920/418533 cut-off events. For 222086/222683 co-relation queries the response was YES. Maximal size of possible extension queue 25458. Compared 3995221 event pairs, 38108 based on Foata normal form. 153/265102 useless extension candidates. Maximal degree in co-relation 732424. Up to 166970 conditions per place. [2022-12-13 09:17:07,407 INFO L137 encePairwiseOnDemand]: 53/63 looper letters, 308 selfloop transitions, 66 changer transitions 59/447 dead transitions. [2022-12-13 09:17:07,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 447 transitions, 2771 flow [2022-12-13 09:17:07,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:17:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:17:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 328 transitions. [2022-12-13 09:17:07,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2022-12-13 09:17:07,412 INFO L175 Difference]: Start difference. First operand has 87 places, 113 transitions, 467 flow. Second operand 8 states and 328 transitions. [2022-12-13 09:17:07,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 447 transitions, 2771 flow [2022-12-13 09:17:17,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 447 transitions, 2763 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 09:17:17,445 INFO L231 Difference]: Finished difference. Result has 100 places, 175 transitions, 1094 flow [2022-12-13 09:17:17,445 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1094, PETRI_PLACES=100, PETRI_TRANSITIONS=175} [2022-12-13 09:17:17,446 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 21 predicate places. [2022-12-13 09:17:17,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:17,446 INFO L89 Accepts]: Start accepts. Operand has 100 places, 175 transitions, 1094 flow [2022-12-13 09:17:17,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:17,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:17,451 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 175 transitions, 1094 flow [2022-12-13 09:17:17,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 175 transitions, 1094 flow [2022-12-13 09:17:19,208 INFO L130 PetriNetUnfolder]: 17968/36565 cut-off events. [2022-12-13 09:17:19,208 INFO L131 PetriNetUnfolder]: For 17952/18469 co-relation queries the response was YES. [2022-12-13 09:17:19,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86099 conditions, 36565 events. 17968/36565 cut-off events. For 17952/18469 co-relation queries the response was YES. Maximal size of possible extension queue 5441. Compared 427485 event pairs, 605 based on Foata normal form. 173/16228 useless extension candidates. Maximal degree in co-relation 86061. Up to 17874 conditions per place. [2022-12-13 09:17:19,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 175 transitions, 1094 flow [2022-12-13 09:17:19,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 5792 [2022-12-13 09:17:19,588 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:19,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2143 [2022-12-13 09:17:19,590 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 175 transitions, 1094 flow [2022-12-13 09:17:19,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:19,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:19,590 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:19,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:17:19,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1117844139, now seen corresponding path program 1 times [2022-12-13 09:17:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:19,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289004152] [2022-12-13 09:17:19,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:19,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:19,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289004152] [2022-12-13 09:17:19,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289004152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:19,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:19,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:17:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876854440] [2022-12-13 09:17:19,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:19,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:17:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:19,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:17:19,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:17:19,694 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 63 [2022-12-13 09:17:19,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 175 transitions, 1094 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:19,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:19,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 63 [2022-12-13 09:17:19,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:24,126 INFO L130 PetriNetUnfolder]: 36142/67565 cut-off events. [2022-12-13 09:17:24,126 INFO L131 PetriNetUnfolder]: For 57872/59348 co-relation queries the response was YES. [2022-12-13 09:17:24,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207397 conditions, 67565 events. 36142/67565 cut-off events. For 57872/59348 co-relation queries the response was YES. Maximal size of possible extension queue 5797. Compared 734679 event pairs, 4886 based on Foata normal form. 1674/44120 useless extension candidates. Maximal degree in co-relation 173340. Up to 17996 conditions per place. [2022-12-13 09:17:24,465 INFO L137 encePairwiseOnDemand]: 46/63 looper letters, 71 selfloop transitions, 25 changer transitions 74/230 dead transitions. [2022-12-13 09:17:24,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 230 transitions, 1419 flow [2022-12-13 09:17:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:17:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:17:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 272 transitions. [2022-12-13 09:17:24,466 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7195767195767195 [2022-12-13 09:17:24,466 INFO L175 Difference]: Start difference. First operand has 100 places, 175 transitions, 1094 flow. Second operand 6 states and 272 transitions. [2022-12-13 09:17:24,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 230 transitions, 1419 flow [2022-12-13 09:17:24,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 230 transitions, 1403 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-13 09:17:24,941 INFO L231 Difference]: Finished difference. Result has 105 places, 112 transitions, 698 flow [2022-12-13 09:17:24,942 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=698, PETRI_PLACES=105, PETRI_TRANSITIONS=112} [2022-12-13 09:17:24,942 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 26 predicate places. [2022-12-13 09:17:24,942 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:24,943 INFO L89 Accepts]: Start accepts. Operand has 105 places, 112 transitions, 698 flow [2022-12-13 09:17:24,944 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:24,944 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:24,944 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 112 transitions, 698 flow [2022-12-13 09:17:24,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 112 transitions, 698 flow [2022-12-13 09:17:25,294 INFO L130 PetriNetUnfolder]: 1323/5482 cut-off events. [2022-12-13 09:17:25,294 INFO L131 PetriNetUnfolder]: For 6889/7270 co-relation queries the response was YES. [2022-12-13 09:17:25,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18192 conditions, 5482 events. 1323/5482 cut-off events. For 6889/7270 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 68456 event pairs, 0 based on Foata normal form. 17/3911 useless extension candidates. Maximal degree in co-relation 18155. Up to 1103 conditions per place. [2022-12-13 09:17:25,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 112 transitions, 698 flow [2022-12-13 09:17:25,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 2588 [2022-12-13 09:17:25,351 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:25,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 410 [2022-12-13 09:17:25,352 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 112 transitions, 698 flow [2022-12-13 09:17:25,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:25,352 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:25,352 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:25,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:17:25,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:25,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash 614595759, now seen corresponding path program 1 times [2022-12-13 09:17:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:25,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299410636] [2022-12-13 09:17:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:25,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:25,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299410636] [2022-12-13 09:17:25,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299410636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:25,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:25,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:17:25,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611922846] [2022-12-13 09:17:25,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:25,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:17:25,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:25,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:17:25,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:17:25,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 58 [2022-12-13 09:17:25,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 112 transitions, 698 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:25,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:25,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 58 [2022-12-13 09:17:25,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:29,266 INFO L130 PetriNetUnfolder]: 35330/60604 cut-off events. [2022-12-13 09:17:29,266 INFO L131 PetriNetUnfolder]: For 78868/78868 co-relation queries the response was YES. [2022-12-13 09:17:29,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210484 conditions, 60604 events. 35330/60604 cut-off events. For 78868/78868 co-relation queries the response was YES. Maximal size of possible extension queue 3772. Compared 573351 event pairs, 3381 based on Foata normal form. 470/47132 useless extension candidates. Maximal degree in co-relation 170507. Up to 21458 conditions per place. [2022-12-13 09:17:29,586 INFO L137 encePairwiseOnDemand]: 48/58 looper letters, 170 selfloop transitions, 44 changer transitions 24/250 dead transitions. [2022-12-13 09:17:29,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 250 transitions, 1846 flow [2022-12-13 09:17:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:17:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:17:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 286 transitions. [2022-12-13 09:17:29,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6163793103448276 [2022-12-13 09:17:29,588 INFO L175 Difference]: Start difference. First operand has 97 places, 112 transitions, 698 flow. Second operand 8 states and 286 transitions. [2022-12-13 09:17:29,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 250 transitions, 1846 flow [2022-12-13 09:17:30,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 250 transitions, 1685 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 09:17:30,197 INFO L231 Difference]: Finished difference. Result has 103 places, 125 transitions, 889 flow [2022-12-13 09:17:30,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=889, PETRI_PLACES=103, PETRI_TRANSITIONS=125} [2022-12-13 09:17:30,198 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2022-12-13 09:17:30,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:30,198 INFO L89 Accepts]: Start accepts. Operand has 103 places, 125 transitions, 889 flow [2022-12-13 09:17:30,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:30,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:30,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 125 transitions, 889 flow [2022-12-13 09:17:30,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 125 transitions, 889 flow [2022-12-13 09:17:30,528 INFO L130 PetriNetUnfolder]: 1314/5544 cut-off events. [2022-12-13 09:17:30,528 INFO L131 PetriNetUnfolder]: For 10494/10898 co-relation queries the response was YES. [2022-12-13 09:17:30,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16716 conditions, 5544 events. 1314/5544 cut-off events. For 10494/10898 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 69827 event pairs, 0 based on Foata normal form. 17/4038 useless extension candidates. Maximal degree in co-relation 16676. Up to 1051 conditions per place. [2022-12-13 09:17:30,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 125 transitions, 889 flow [2022-12-13 09:17:30,570 INFO L226 LiptonReduction]: Number of co-enabled transitions 2730 [2022-12-13 09:17:30,575 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:30,575 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 377 [2022-12-13 09:17:30,576 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 125 transitions, 889 flow [2022-12-13 09:17:30,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:30,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:30,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:30,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:17:30,576 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:30,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:30,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1166286015, now seen corresponding path program 1 times [2022-12-13 09:17:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:30,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924301285] [2022-12-13 09:17:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:30,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:30,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924301285] [2022-12-13 09:17:30,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924301285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:30,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:30,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:17:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194182384] [2022-12-13 09:17:30,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:30,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:17:30,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:17:30,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:17:30,623 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 58 [2022-12-13 09:17:30,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 125 transitions, 889 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:30,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:30,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 58 [2022-12-13 09:17:30,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:34,314 INFO L130 PetriNetUnfolder]: 33613/57729 cut-off events. [2022-12-13 09:17:34,315 INFO L131 PetriNetUnfolder]: For 88378/88378 co-relation queries the response was YES. [2022-12-13 09:17:34,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191330 conditions, 57729 events. 33613/57729 cut-off events. For 88378/88378 co-relation queries the response was YES. Maximal size of possible extension queue 3580. Compared 542578 event pairs, 3329 based on Foata normal form. 482/45250 useless extension candidates. Maximal degree in co-relation 160870. Up to 21220 conditions per place. [2022-12-13 09:17:34,787 INFO L137 encePairwiseOnDemand]: 48/58 looper letters, 167 selfloop transitions, 49 changer transitions 33/261 dead transitions. [2022-12-13 09:17:34,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 261 transitions, 1963 flow [2022-12-13 09:17:34,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:17:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:17:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 286 transitions. [2022-12-13 09:17:34,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6163793103448276 [2022-12-13 09:17:34,789 INFO L175 Difference]: Start difference. First operand has 103 places, 125 transitions, 889 flow. Second operand 8 states and 286 transitions. [2022-12-13 09:17:34,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 261 transitions, 1963 flow [2022-12-13 09:17:36,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 261 transitions, 1953 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 09:17:36,033 INFO L231 Difference]: Finished difference. Result has 112 places, 134 transitions, 1102 flow [2022-12-13 09:17:36,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1102, PETRI_PLACES=112, PETRI_TRANSITIONS=134} [2022-12-13 09:17:36,034 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 33 predicate places. [2022-12-13 09:17:36,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:36,034 INFO L89 Accepts]: Start accepts. Operand has 112 places, 134 transitions, 1102 flow [2022-12-13 09:17:36,035 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:36,035 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:36,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 134 transitions, 1102 flow [2022-12-13 09:17:36,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 134 transitions, 1102 flow [2022-12-13 09:17:36,287 INFO L130 PetriNetUnfolder]: 1170/5350 cut-off events. [2022-12-13 09:17:36,287 INFO L131 PetriNetUnfolder]: For 12120/12380 co-relation queries the response was YES. [2022-12-13 09:17:36,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17230 conditions, 5350 events. 1170/5350 cut-off events. For 12120/12380 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 67945 event pairs, 0 based on Foata normal form. 59/3965 useless extension candidates. Maximal degree in co-relation 17186. Up to 1015 conditions per place. [2022-12-13 09:17:36,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 134 transitions, 1102 flow [2022-12-13 09:17:36,337 INFO L226 LiptonReduction]: Number of co-enabled transitions 2862 [2022-12-13 09:17:36,343 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:36,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 309 [2022-12-13 09:17:36,343 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 134 transitions, 1102 flow [2022-12-13 09:17:36,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:36,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:36,344 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:36,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:17:36,344 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash 152446950, now seen corresponding path program 1 times [2022-12-13 09:17:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:36,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210815370] [2022-12-13 09:17:36,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:36,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:36,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210815370] [2022-12-13 09:17:36,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210815370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:36,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:36,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:17:36,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712748508] [2022-12-13 09:17:36,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:36,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:17:36,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:36,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:17:36,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:17:36,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 58 [2022-12-13 09:17:36,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 134 transitions, 1102 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:36,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:36,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 58 [2022-12-13 09:17:36,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:38,482 INFO L130 PetriNetUnfolder]: 12832/30375 cut-off events. [2022-12-13 09:17:38,482 INFO L131 PetriNetUnfolder]: For 60250/61247 co-relation queries the response was YES. [2022-12-13 09:17:38,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101885 conditions, 30375 events. 12832/30375 cut-off events. For 60250/61247 co-relation queries the response was YES. Maximal size of possible extension queue 2742. Compared 374683 event pairs, 4396 based on Foata normal form. 1553/23454 useless extension candidates. Maximal degree in co-relation 80024. Up to 10735 conditions per place. [2022-12-13 09:17:38,608 INFO L137 encePairwiseOnDemand]: 47/58 looper letters, 48 selfloop transitions, 11 changer transitions 45/168 dead transitions. [2022-12-13 09:17:38,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 168 transitions, 1359 flow [2022-12-13 09:17:38,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:17:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:17:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2022-12-13 09:17:38,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6689655172413793 [2022-12-13 09:17:38,609 INFO L175 Difference]: Start difference. First operand has 112 places, 134 transitions, 1102 flow. Second operand 5 states and 194 transitions. [2022-12-13 09:17:38,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 168 transitions, 1359 flow [2022-12-13 09:17:39,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 168 transitions, 1350 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 09:17:39,728 INFO L231 Difference]: Finished difference. Result has 115 places, 104 transitions, 801 flow [2022-12-13 09:17:39,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=801, PETRI_PLACES=115, PETRI_TRANSITIONS=104} [2022-12-13 09:17:39,729 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 36 predicate places. [2022-12-13 09:17:39,729 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:39,729 INFO L89 Accepts]: Start accepts. Operand has 115 places, 104 transitions, 801 flow [2022-12-13 09:17:39,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:39,731 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:39,731 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 104 transitions, 801 flow [2022-12-13 09:17:39,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 104 transitions, 801 flow [2022-12-13 09:17:39,925 INFO L130 PetriNetUnfolder]: 834/4335 cut-off events. [2022-12-13 09:17:39,925 INFO L131 PetriNetUnfolder]: For 8088/8088 co-relation queries the response was YES. [2022-12-13 09:17:39,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14442 conditions, 4335 events. 834/4335 cut-off events. For 8088/8088 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 54648 event pairs, 0 based on Foata normal form. 0/3207 useless extension candidates. Maximal degree in co-relation 14397. Up to 1015 conditions per place. [2022-12-13 09:17:39,959 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 104 transitions, 801 flow [2022-12-13 09:17:39,959 INFO L226 LiptonReduction]: Number of co-enabled transitions 2136 [2022-12-13 09:17:39,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [220] L729-->L732: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_5|} OutVars{~y~0=v_~y~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_5|} AuxVars[] AssignedVars[~y~0] and [246] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:39,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [220] L729-->L732: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_5|} OutVars{~y~0=v_~y~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_5|} AuxVars[] AssignedVars[~y~0] and [252] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:39,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [234] L729-->L732: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_5|} OutVars{~y~0=v_~y~0_1, readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_5|} AuxVars[] AssignedVars[~y~0] and [246] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:40,001 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [234] L729-->L732: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_5|} OutVars{~y~0=v_~y~0_1, readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_5|} AuxVars[] AssignedVars[~y~0] and [252] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:40,159 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_3|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~l~0#1] and [252] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:40,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_3|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~l~0#1] and [246] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:40,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [233] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1] and [252] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:40,356 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [233] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1] and [246] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:40,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [233] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1] and [252] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:40,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [233] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1] and [246] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:40,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_3|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~l~0#1] and [252] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:40,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_3|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~l~0#1] and [246] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:17:40,478 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 09:17:40,479 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 750 [2022-12-13 09:17:40,479 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 98 transitions, 857 flow [2022-12-13 09:17:40,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:40,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:40,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:40,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:17:40,479 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:40,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:40,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1592938289, now seen corresponding path program 1 times [2022-12-13 09:17:40,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:40,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612806697] [2022-12-13 09:17:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:40,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:40,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:40,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612806697] [2022-12-13 09:17:40,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612806697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:40,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:40,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:17:40,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502446053] [2022-12-13 09:17:40,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:40,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:17:40,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:40,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:17:40,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:17:40,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 72 [2022-12-13 09:17:40,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 98 transitions, 857 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:40,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:40,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 72 [2022-12-13 09:17:40,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:41,642 INFO L130 PetriNetUnfolder]: 4148/11160 cut-off events. [2022-12-13 09:17:41,643 INFO L131 PetriNetUnfolder]: For 39021/39059 co-relation queries the response was YES. [2022-12-13 09:17:41,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42813 conditions, 11160 events. 4148/11160 cut-off events. For 39021/39059 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 126863 event pairs, 1026 based on Foata normal form. 316/8797 useless extension candidates. Maximal degree in co-relation 40028. Up to 2899 conditions per place. [2022-12-13 09:17:41,699 INFO L137 encePairwiseOnDemand]: 61/72 looper letters, 0 selfloop transitions, 0 changer transitions 90/90 dead transitions. [2022-12-13 09:17:41,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 90 transitions, 605 flow [2022-12-13 09:17:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:17:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:17:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2022-12-13 09:17:41,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-13 09:17:41,701 INFO L175 Difference]: Start difference. First operand has 108 places, 98 transitions, 857 flow. Second operand 5 states and 174 transitions. [2022-12-13 09:17:41,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 90 transitions, 605 flow [2022-12-13 09:17:41,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 90 transitions, 444 flow, removed 18 selfloop flow, removed 27 redundant places. [2022-12-13 09:17:41,985 INFO L231 Difference]: Finished difference. Result has 81 places, 0 transitions, 0 flow [2022-12-13 09:17:41,985 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=81, PETRI_TRANSITIONS=0} [2022-12-13 09:17:41,986 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 2 predicate places. [2022-12-13 09:17:41,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:41,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 0 transitions, 0 flow [2022-12-13 09:17:41,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 09:17:41,987 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 09:17:41,987 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:41,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 09:17:41,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 09:17:41,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 09:17:41,987 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:41,990 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 09:17:41,990 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 09:17:41,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:41,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 09:17:41,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2022-12-13 09:17:41,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 09:17:42,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 09:17:42,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 09:17:42,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-12-13 09:17:42,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 09:17:42,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:17:42,008 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:42,012 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:17:42,012 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:17:42,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:17:42 BasicIcfg [2022-12-13 09:17:42,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:17:42,015 INFO L158 Benchmark]: Toolchain (without parser) took 89718.54ms. Allocated memory was 180.4MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 154.6MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 746.2MB. Max. memory is 8.0GB. [2022-12-13 09:17:42,015 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:17:42,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.73ms. Allocated memory is still 180.4MB. Free memory was 154.6MB in the beginning and 133.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 09:17:42,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.38ms. Allocated memory is still 180.4MB. Free memory was 133.6MB in the beginning and 131.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:17:42,016 INFO L158 Benchmark]: Boogie Preprocessor took 36.84ms. Allocated memory is still 180.4MB. Free memory was 131.0MB in the beginning and 129.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:17:42,016 INFO L158 Benchmark]: RCFGBuilder took 434.51ms. Allocated memory is still 180.4MB. Free memory was 129.4MB in the beginning and 113.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 09:17:42,016 INFO L158 Benchmark]: TraceAbstraction took 88687.70ms. Allocated memory was 180.4MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 112.6MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 704.3MB. Max. memory is 8.0GB. [2022-12-13 09:17:42,021 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 497.73ms. Allocated memory is still 180.4MB. Free memory was 154.6MB in the beginning and 133.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.38ms. Allocated memory is still 180.4MB. Free memory was 133.6MB in the beginning and 131.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.84ms. Allocated memory is still 180.4MB. Free memory was 131.0MB in the beginning and 129.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 434.51ms. Allocated memory is still 180.4MB. Free memory was 129.4MB in the beginning and 113.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 88687.70ms. Allocated memory was 180.4MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 112.6MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 704.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 102 PlacesBefore, 79 PlacesAfterwards, 91 TransitionsBefore, 66 TransitionsAfterwards, 2408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 35 ConcurrentYvCompositions, 2 ChoiceCompositions, 56 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2763, independent: 2663, independent conditional: 2663, independent unconditional: 0, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2038, independent: 1981, independent conditional: 0, independent unconditional: 1981, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2038, independent: 1981, independent conditional: 0, independent unconditional: 1981, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2038, independent: 1929, independent conditional: 0, independent unconditional: 1929, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 109, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2763, independent: 682, independent conditional: 682, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 2038, unknown conditional: 2038, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2051, Positive cache size: 1994, Positive conditional cache size: 1994, Positive unconditional cache size: 0, Negative cache size: 57, Negative conditional cache size: 57, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 3310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 503, independent: 465, independent conditional: 465, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, independent: 99, independent conditional: 25, independent unconditional: 74, dependent: 16, dependent conditional: 9, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 115, independent: 99, independent conditional: 25, independent unconditional: 74, dependent: 16, dependent conditional: 9, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 115, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 9, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 19, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 503, independent: 366, independent conditional: 366, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 115, unknown conditional: 115, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 99, Positive conditional cache size: 99, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 3116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 411, independent: 378, independent conditional: 378, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 81, independent conditional: 21, independent unconditional: 60, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 92, independent: 81, independent conditional: 21, independent unconditional: 60, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 92, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 411, independent: 297, independent conditional: 297, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 92, unknown conditional: 92, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 180, Positive conditional cache size: 180, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 87 PlacesBefore, 87 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 3868 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 712, independent: 687, independent conditional: 687, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, independent: 193, independent conditional: 125, independent unconditional: 68, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 198, independent: 193, independent conditional: 125, independent unconditional: 68, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 198, independent: 193, independent conditional: 0, independent unconditional: 193, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 712, independent: 494, independent conditional: 494, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 198, unknown conditional: 198, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 373, Positive conditional cache size: 373, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 100 PlacesBefore, 100 PlacesAfterwards, 175 TransitionsBefore, 175 TransitionsAfterwards, 5792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 373, Positive conditional cache size: 373, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 2588 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 373, Positive conditional cache size: 373, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 2730 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 373, Positive conditional cache size: 373, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 134 TransitionsBefore, 134 TransitionsAfterwards, 2862 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 373, Positive conditional cache size: 373, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 114 PlacesBefore, 108 PlacesAfterwards, 104 TransitionsBefore, 98 TransitionsAfterwards, 2136 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 458, independent: 458, independent conditional: 458, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 144, independent conditional: 60, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 144, independent: 144, independent conditional: 60, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 144, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 458, independent: 314, independent conditional: 314, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 144, unknown conditional: 144, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 549, Positive cache size: 517, Positive conditional cache size: 517, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 549, Positive cache size: 517, Positive conditional cache size: 517, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 739]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 88.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 79.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 945 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 945 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2453 IncrementalHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 61 mSDtfsCounter, 2453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1102occurred in iteration=7, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 09:17:42,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...